Show simple item record

dc.contributor.authorGur, Tom
dc.contributor.authorRothblum, Ron
dc.date.accessioned2018-06-22T16:56:32Z
dc.date.available2018-06-22T16:56:32Z
dc.date.issued2016-06
dc.identifier.issn1016-3328
dc.identifier.issn1420-8954
dc.identifier.urihttp://hdl.handle.net/1721.1/116525
dc.description.abstractWe initiate a study of non-interactive proofs of proximity. These proof systems consist of a verifier that wishes to ascertain the validity of a given statement, using a short (sublinear length) explicitly given proof, and a sublinear number of queries to its input. Since the verifier cannot even read the entire input, we only require it to reject inputs that are far from being valid. Thus, the verifier is only assured of the proximity of the statement to a correct one. Such proof systems can be viewed as the NP (or more accurately MA) analogue of property testing. We explore both the power and limitations of non-interactive proofs of proximity. We show that such proof systems can be exponentially stronger than property testers, but are exponentially weaker than the interactive proofs of proximity studied by Rothblum, Vadhan and Wigderson (STOC 2013). In addition, we show a natural problem that has a full and (almost) tight multiplicative trade-off between the length of the proof and the verifier’s query complexity. On the negative side, we also show that there exist properties for which even a linearly long (non-interactive) proof of proximity cannot significantly reduce the query complexity.en_US
dc.description.sponsorshipIsrael Science Foundation (grant No. 671/13)en_US
dc.publisherSpringer-Verlagen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s00037-016-0136-9en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSpringer International Publishingen_US
dc.titleNon-interactive proofs of proximityen_US
dc.typeArticleen_US
dc.identifier.citationGur, Tom, and Ron D. Rothblum. “Non-Interactive Proofs of Proximity.” Computational Complexity 27, no. 1 (June 3, 2016): 99–207.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.mitauthorRothblum, Ron
dc.relation.journalcomputational complexityen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2018-02-27T05:14:51Z
dc.language.rfc3066en
dc.rights.holderSpringer International Publishing
dspace.orderedauthorsGur, Tom; Rothblum, Ron D.en_US
dspace.embargo.termsNen
dc.identifier.orcidhttps://orcid.org/0000-0003-2844-4052
mit.licensePUBLISHER_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record