Efficient batch verification for UP

Omer Reingold, Guy N. Rothblum, Ron D. Rothblum

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנס

תקציר

Consider a setting in which a prover wants to convince a verifier of the correctness of k NP statements. For example, the prover wants to convince the verifier that k given integers N1,⋯, Nk are all RSA moduli (i.e., products of equal length primes). Clearly this problem can be solved by simply having the prover send the k NP witnesses, but this involves a lot of communication. Can interaction help? In particular, is it possible to construct interactive proofs for this task whose communication grows sub-linearly with k? Our main result is such an interactive proof for verifying the correctness of any k UP statements (i.e., NP statements that have a unique witness). The proof-system uses only a constant number of rounds and the communication complexity is kδ · poly (m), where δ > 0 is an arbitrarily small constant, m is the length of a single witness, and the poly term refers to a fixed polynomial that only depends on the language and not on δ. The (honest) prover strategy can be implemented in polynomial-time given access to the k (unique) witnesses. Our proof leverages "interactive witness verification" (IWV), a new type of proof-system that may be of independent interest. An IWV is a proof-system in which the verifier needs to verify the correctness of an NP statement using: (i) a sublinear number of queries to an alleged NP witness, and (ii) a short interaction with a powerful but untrusted prover. In contrast to the setting of PCPs and Interactive PCPs, here the verifier only has access to the raw NP witness, rather than some encoding thereof.

שפה מקוריתאנגלית
כותר פרסום המארח33rd Computational Complexity Conference, CCC 2018
עורכיםRocco A. Servedio
מוציא לאורSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
עמודים22:1-22:23
מספר עמודים23
מסת"ב (אלקטרוני)9783959770699
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 1 יוני 2018
אירוע33rd Computational Complexity Conference, CCC 2018 - San Diego, ארצות הברית
משך הזמן: 22 יוני 201824 יוני 2018

סדרות פרסומים

שםLeibniz International Proceedings in Informatics, LIPIcs
כרך102
ISSN (מודפס)1868-8969

כנס

כנס33rd Computational Complexity Conference, CCC 2018
מדינה/אזורארצות הברית
עירSan Diego
תקופה22/06/1824/06/18

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Efficient batch verification for UP'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי