Abstract
Interactive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof.
The first variant, known as MA-proofs of Proximity (MAP), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as AM-proofs of Proximity (AMP), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both MAPs and AMPs is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity.
Our main result is an exponential separation between the power of MAPs and AMPs. Specifically, we exhibit an explicit and natural property \(\Pi\) that admits an AMP with complexity \(O(\log n)\), whereas any MAP for \(\Pi\) has complexity \(\tilde{\Omega}(n^{1/4})\), where n denotes the length of the input in bits. Our MAP lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a \(\Omega(n^{1/6})\) QMA lower bound for the same property \(\Pi\).
Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that AMPs can only be quadratically stronger than MAPs. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Scott Aaronson (2012). Impossibility of succinct quantum proofs for collision-freeness. Quantum Information & Computation 12(1- 2), 21–28. URL http://www.rintonpress.com/xxqic12/qic-12-12/0021-0028.pdf.
Scott Aaronson & Avi Wigderson (2009). Algebrization: A New Barrier in Complexity Theory. TOCT 1(1), 2:1–2:54. URL http://doi.acm.org/10.1145/1490270.1490272.
Amir Abboud, Aviad Rubinstein & R. Ryan Williams (2017). Distributed PCP Theorems for Hardness of Approximation in P. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, 25–36. URL https://doi.org/10.1109/FOCS.2017.12.
Dorit Aharonov & Tomer Naveh (2002). Quantum NP-a survey. arXiv preprint quant-ph/0210077 .
László Babai, Peter Frankl & Janos Simon (1986). Complexity classes in communication complexity theory. In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, 337–347. URL https://doi.org/10.1109/SFCS.1986.15.
László Babai & Shlomo Moran (1988). Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. 36(2), 254–276. URL https://doi.org/10.1016/0022-0000(88)90028-1.
Mihir Bellare & Moti Yung (1996). Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. J. Cryptology 9(3), 149–166.
Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan & Salil P. Vadhan (2006). Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. 36(4), 889–974. URL https://doi.org/10.1137/S0097539705446810.
Itay Berman, Ron D. Rothblum & Vinod Vaikuntanathan (2017). Zero-Knowledge Proofs of Proximity. IACR Cryptology ePrint Archive 2017, 114. URL http://eprint.iacr.org/2017/114.
Eric Blais, Joshua Brody & Kevin Matulef (2012). Property Testing Lower Bounds via Communication Complexity. Computational Complexity 21(2), 311–358. URL https://doi.org/10.1007/s00037-012-0040-x.
Mark Braverman (2011). Poly-logarithmic independence fools bounded-depth boolean circuits. Commun. ACM 54(4), 108–115. URL http://doi.acm.org/10.1145/1924421.1924446.
Clément L. Canonne (2015). A Survey on Distribution Testing: Your Data is Big. But is it Blue? Electronic Colloquium on Computational Complexity (ECCC) 22, 63. URL http://eccc.hpi-web.de/report/2015/063.
Amit Chakrabarti, Graham Cormode, Andrew McGregor & Justin Thaler (2014). Annotations in Data Streams. ACM Trans. Algorithms 11(1), 7:1–7:30. URL http://doi.acm.org/10.1145/2636924.
Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler & Suresh Venkatasubramanian (2015). Verifiable Stream Computation and Arthur-Merlin Communication. In 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, 217–243. URL https://doi.org/10.4230/LIPIcs.CCC.2015.217.
Alessandro Chiesa & Tom Gur (2017). Proofs of Proximity for Distribution Testing. ECCC 24, 155. URL https://eccc.weizmann.ac.il/report/2017/155.
Graham Cormode, Michael Mitzenmacher & Justin Thaler (2010). Streaming Graph Computations with a Helpful Advisor. In Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, 231–242. URL https://doi.org/10.1007/978-3-642-15775-2_20.
Graham Cormode, Justin Thaler & Ke Yi (2011). Verifying Computations with Streaming Interactive Proofs. PVLDB 5(1), 25– 36. URL http://www.vldb.org/pvldb/vol5/p025_grahamcormode_vldb2012.pdf.
Irit Dinur & Omer Reingold (2006). Assignment Testers: Toward a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4), 975–1024. URL https://doi.org/10.1137/S0097539705446962.
Funda Ergün, Ravi Kumar & Ronitt Rubinfeld (2004). Fast approximate probabilistically checkable proofs. Inf. Comput. 189(2), 135–159. URL https://doi.org/10.1016/j.ic.2003.09.005.
Uriel Feige, Dror Lapidot & Adi Shamir (1999). Multiple Non- Interactive Zero Knowledge Proofs Under General Assumptions. SIAM Journal on Computing Preliminary version in FOCS’90.
Eldar Fischer, Yonatan Goldhirsh & Oded Lachish (2014). Partial tests, universal tests and decomposability. In Innovations in Theoretical Computer Science, ITCS’14, Princeton, NJ, USA, January 12-14, 2014, 483–500. URL http://doi.acm.org/10.1145/2554797.2554841.
Eldar Fischer, Oded Lachish & Yadu Vasudev (2015). Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, 1163– 1182. URL https://doi.org/10.1109/FOCS.2015.75.
Oded Goldreich (2017). Introduction to Property Testing. Cambridge University Press. ISBN 978-1-107-19405-2.
Oded Goldreich, Shafi Goldwasser & Dana Ron (1998). Property Testing and its Connection to Learning and Approximation. J. ACM 45(4), 653–750. URL http://doi.acm.org/10.1145/285055.285060.
Oded Goldreich & Tom Gur (2016a). Universal Locally Testable Codes. Electronic Colloquium on Computational Complexity (ECCC)23, 42. URL http://eccc.hpi-web.de/report/2016/042.
Oded Goldreich & Tom Gur (2016b). Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP. Electronic Colloquium on Computational Complexity (ECCC) 23, 192. URL http://eccc.hpi-web.de/report/2016/192.
Oded Goldreich, Tom Gur & Ilan Komargodski (2015a). Strong Locally Testable Codes with Relaxed Local Decoders. In 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, 1–41. URL https://doi.org/10.4230/LIPIcs.CCC.2015.1.
Oded Goldreich, Tom Gur & Ron D. Rothblum (2015b). Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). In International Colloquium on Automata, Languages and Programming ICALP. URL https://doi.org/10.1007/978-3-662-47672-7_54.
Oded Goldreich & Or Sheffet (2010). On The Randomness Complexity of Property Testing. Computational Complexity 19(1), 99–133. URL https://doi.org/10.1007/s00037-009-0282-4.
Mika Göös, Toniann Pitassi & Thomas Watson (2015). Zero- Information Protocols and Unambiguity in Arthur-Merlin Communication. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11- 13, 2015, 113–122. URL http://doi.acm.org/10.1145/2688073.2688074.
Tom Gur (2017). On Locally Verifiable Proofs of Proximity. Ph.D. thesis, Weizmann Institute.
Tom Gur & Ran Raz (2015). Arthur-Merlin streaming complexity. Inf. Comput. 243, 145–165. URL https://doi.org/10.1016/j.ic.2014.12.011.
Tom Gur & Ron D. Rothblum (2016). Non-interactive proofs of proximity. Computational Complexity ISSN 1420-8954. URL https://doi.org/10.1007/s00037-016-0136-9.
Tom Gur & Ron D. Rothblum (2017). A Hierarchy Theorem for Interactive Proofs of Proximity. In Innovations in Theoretical Computer Science ITCS.
Tom Gur & Ron D. Rothblum (2018). Non-interactive proofs of proximity. Computational Complexity 27(1), 99–207.
Yael Tauman Kalai & Ron D. Rothblum (2015). Arguments of Proximity - [Extended Abstract]. In CRYPTO. URL https://doi.org/10.1007/978-3-662-48000-7_21.
Bala Kalyanasundaram & Georg Schnitger (1992). The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math. 5(4), 545–557. URL https://doi.org/10.1137/0405044.
Hartmut Klauck (2003). Rectangle Size Bounds and Threshold Covers in Communication Complexity. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, 118–134. URL https://doi.org/10.1109/CCC.2003.1214415.
Hartmut Klauck (2011). On Arthur Merlin Games in Communication Complexity. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011, 189–199. URL https://doi.org/10.1109/CCC.2011.33.
Eyal Kushilevitz & Noam Nisan (1997). Communication complexity. Cambridge University Press. ISBN 978-0-521-56067-2.
Carsten Lund, Lance Fortnow, Howard J. Karloff & Noam Nisan (1992). Algebraic Methods for Interactive Proof Systems. J. ACM 39(4), 859–868. URL http://doi.acm.org/10.1145/146585.146605.
Ilan Newman (1991). Private vs. Common Random Bits in Communication Complexity. Inf. Process. Lett. 39(2), 67–71. URL https://doi.org/10.1016/0020-0190(91)90157-D.
Ran Raz (2009). Quantum Information and the PCP Theorem. Algorithmica 55(3), 462–489. URL https://doi.org/10.1007/s00453-007-9033-6.
Ran Raz & Amir Shpilka (2004). On the Power of Quantum Proofs. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, 260–274. URL https://doi.org/10.1109/CCC.2004.1313849.
Ran Raz, Gábor Tardos, Oleg Verbitsky & Nikolai K. Vereshchagin (1998). Arthur-Merlin Games in Boolean Decision Trees. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998, 58–67. URL https://doi.org/10.1109/CCC.1998.694591.
Omer Reingold, Guy N. Rothblum & Ron D. Rothblum (2016). Constant-round interactive proofs for delegating computation. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, 49–62. URL http://doi.acm.org/10.1145/2897518.2897652.
Dana Ron (2008). Property Testing: A Learning Theory Perspective. Foundations and Trends in Machine Learning 1(3), 307–402. URL https://doi.org/10.1561/2200000004.
Dana Ron (2009). Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in Theoretical Computer Science 5(2), 73–205. URL https://doi.org/10.1561/0400000029.
Guy N. Rothblum, Salil P. Vadhan & Avi Wigderson (2013). Interactive proofs of proximity: delegating computation in sublinear time. In Symposium on Theory of Computing, STOC. URL http://doi.acm.org/10.1145/2488608.2488709.
Ronitt Rubinfeld & Madhu Sudan (1996). Robust Characterizations of Polynomials with Applications to Program Testing. SIAM J. Comput. 25(2), 252–271. URL https://doi.org/10.1137/S0097539793255151.
Alexander A. Sherstov (2016). The Multiparty Communication Complexity of Set Disjointness. SIAM J. Comput. 45(4), 1450–1489. URL https://doi.org/10.1137/120891587.
Justin Thaler (2016). Semi-Streaming Algorithms for Annotated Graph Streams. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 59:1–59:14. URL https://doi.org/10.4230/LIPIcs.ICALP.2016.59.
Acknowledgements
We thank Oded Goldreich and Justin Thaler for very helpful discussions. We also thank the anonymous reviewers of Computational Complexity for useful comments. TG was supported in part by UKRI Future Leaders Fellowship MR/S031545/1.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Gur, T., Liu, Y.P. & Rothblum, R.D. An Exponential Separation Between MA and AM Proofs of Proximity. comput. complex. 30, 12 (2021). https://doi.org/10.1007/s00037-021-00212-3
Received:
Published:
DOI: https://doi.org/10.1007/s00037-021-00212-3