Document Open Access Logo

Distribution-Free Proofs of Proximity

Authors Hugo Aaronson , Tom Gur , Ninad Rajgopal , Ron D. Rothblum

PDF
Thumbnail PDF

File

LIPIcs.CCC.2024.24.pdf
  • Filesize: 1.01 MB
  • 18 pages

Document Identifiers

Author Details

Hugo Aaronson
  • Department of Computer Science and Technology, University of Cambridge, UK
Tom Gur
  • Department of Computer Science and Technology, University of Cambridge, UK
Ninad Rajgopal
  • Department of Computer Science and Technology, University of Cambridge, UK
Ron D. Rothblum
  • Faculty of Computer Science, Technion, Haifa, Israel

Funding

Tom Gur and Ninad Rajgopal are supported by the Tom Gur’s UKRI Future Leaders Fellowship MR/S031545/1. Tom Gur is also supported in part by EPSRC New Horizons Grant EP/X018180/1 and EPSRC RoaRQ Grant EP/W032635/1. Ron Rothblum is funded by the European Union (ERC, FASTPROOF, 101041208). Part of this work was completed when the first three authors were affiliated with the University of Warwick. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them.

Acknowledgements

We are grateful to Oded Goldreich for his insightful comments, some of which led to rephrasing Theorem 1 to indicate the trade-off between the query and communication complexities with better clarity. We are also thankful to Marcel Dall'Agnol for many helpful discussions.

Cite AsGet BibTex

Hugo Aaronson, Tom Gur, Ninad Rajgopal, and Ron D. Rothblum. Distribution-Free Proofs of Proximity. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.CCC.2024.24

Abstract

Motivated by the fact that input distributions are often unknown in advance, distribution-free property testing considers a setting in which the algorithmic task is to accept functions f: [n] → {0,1} having a certain property Π and reject functions that are ε-far from Π, where the distance is measured according to an arbitrary and unknown input distribution 𝒟 ∼ [n]. As usual in property testing, the tester is required to do so while making only a sublinear number of input queries, but as the distribution is unknown, we also allow a sublinear number of samples from the distribution 𝒟. In this work we initiate the study of distribution-free interactive proofs of proximity (df-IPPs) in which the distribution-free testing algorithm is assisted by an all powerful but untrusted prover. Our main result is that for any problem Π ∈ NC, any proximity parameter ε > 0, and any (trade-off) parameter τ ≤ √n, we construct a df-IPP for Π with respect to ε, that has query and sample complexities τ+O(1/ε), and communication complexity Õ(n/τ + 1/ε). For τ as above and sufficiently large ε (namely, when ε > τ/n), this result matches the parameters of the best-known general purpose IPPs in the standard uniform setting. Moreover, for such τ, its parameters are optimal up to poly-logarithmic factors under reasonable cryptographic assumptions for the same regime of ε as the uniform setting, i.e., when ε ≥ 1/τ. For smaller values of ε (i.e., when ε < τ/n), our protocol has communication complexity Ω(1/ε), which is worse than the Õ(n/τ) communication complexity of the uniform IPPs (with the same query complexity). With the aim of improving on this gap, we further show that for IPPs over specialised, but large distribution families, such as sufficiently smooth distributions and product distributions, the communication complexity can be reduced to Õ(n/τ^{1-o(1)}). In addition, we show that for certain natural families of languages, such as symmetric and (relaxed) self-correctable languages, it is possible to further improve the efficiency of distribution-free IPPs.

Subject Classification

ACM Subject Classification
  • Theory of computation → Interactive proof systems
Keywords
  • Property Testing
  • Interactive Proofs
  • Distribution-Free Property Testing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Hugo Aaronson, Tom Gur, Ninad Rajgopal, and Ron Rothblum. Distribution-free proofs of proximity. Electron. Colloquium Comput. Complex., TR23-118, 2023. URL: https://arxiv.org/abs/TR23-118.
  2. Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, and Yuichi Yoshida. Low degree testing over the reals. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 738-792. SIAM, 2023. Google Scholar
  3. Aleksandrs Belovs. Quantum algorithm for distribution-free junta testing. In René van Bevern and Gregory Kucherov, editors, Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings, volume 11532 of Lecture Notes in Computer Science, pages 50-59. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-19955-5_5.
  4. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Fast Reed-Solomon interactive oracle proofs of proximity. In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, volume 107 of LIPIcs, pages 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.14.
  5. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 1-10, 2004. Google Scholar
  6. Itay Berman, Ron D. Rothblum, and Vinod Vaikuntanathan. Zero-knowledge proofs of proximity. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA, volume 94 of LIPIcs, pages 19:1-19:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.19.
  7. Arnab Bhattacharyya and Yuichi Yoshida. Property Testing - Problems and Techniques. Springer, 2022. URL: https://doi.org/10.1007/978-981-16-8622-1.
  8. Eric Blais, Renato Pinto Jr Ferreira, and Nathaniel Harms. VC dimension and distribution-free sample-based testing. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 504-517, 2021. Google Scholar
  9. Andrej Bogdanov and Luca Trevisan. Average-case complexity. Found. Trends Theor. Comput. Sci., 2(1), 2006. URL: https://doi.org/10.1561/0400000004.
  10. Sarah Bordage, Mathieu Lhotel, Jade Nardi, and Hugues Randriam. Interactive oracle proofs of proximity to algebraic geometry codes. In Shachar Lovett, editor, 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA, volume 234 of LIPIcs, pages 30:1-30:45. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.CCC.2022.30.
  11. Nader H. Bshouty. Almost optimal distribution-free junta testing. In Amir Shpilka, editor, 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA, volume 137 of LIPIcs, pages 2:1-2:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.CCC.2019.2.
  12. Xi Chen and Shyamal Patel. Distribution-free testing for halfspaces (almost) requires pac learning. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1715-1743. SIAM, 2022. Google Scholar
  13. Xi Chen and Jinyu Xie. Tight bounds for the distribution-free testing of monotone conjunctions. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 54-71. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch5.
  14. Alessandro Chiesa and Tom Gur. Proofs of proximity for distribution testing. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA, volume 94 of LIPIcs, pages 53:1-53:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.53.
  15. Marcel Dall'Agnol, Tom Gur, Subhayan Roy Moulik, and Justin Thaler. Quantum proofs of proximity. Quantum, 6:834, 2022. Google Scholar
  16. Funda Ergün, Ravi Kumar, and Ronitt Rubinfeld. Fast approximate probabilistically checkable proofs. Inf. Comput., 189(2):135-159, 2004. URL: https://doi.org/10.1016/j.ic.2003.09.005.
  17. Eldar Fischer, Yonatan Goldhirsh, and Oded Lachish. Partial tests, universal tests and decomposability. In Proceedings of the 5th conference on Innovations in theoretical computer science, pages 483-500, 2014. Google Scholar
  18. Noah Fleming and Yuichi Yoshida. Distribution-free testing of linear functions on ℝⁿ. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, volume 151 of LIPIcs, pages 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ITCS.2020.22.
  19. Dana Glasner and Rocco A. Servedio. Distribution-free testing lower bounds for basic boolean functions. In Moses Charikar, Klaus Jansen, Omer Reingold, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, volume 4627 of Lecture Notes in Computer Science, pages 494-508. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74208-1_36.
  20. Guy Goldberg and Guy N Rothblum. Sample-based proofs of proximity. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  21. Oded Goldreich. Introduction to property testing. Cambridge University Press, 2017. Google Scholar
  22. Oded Goldreich. Testing bipartitness in an augmented VDF bounded-degree graph model. CoRR, abs/1905.03070, 2019. URL: https://arxiv.org/abs/1905.03070.
  23. Oded Goldreich. Testing graphs in vertex-distribution-free models. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 527-534, 2019. Google Scholar
  24. Oded Goldreich. The uniform distribution is complete with respect to testing identity to a fixed distribution. In Oded Goldreich, editor, Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation, volume 12050 of Lecture Notes in Computer Science, pages 152-172. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-43662-9_10.
  25. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4):653-750, 1998. URL: https://doi.org/10.1145/285055.285060.
  26. Oded Goldreich and Tom Gur. Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. Theoretical computer science, 878:83-101, 2021. Google Scholar
  27. Oded Goldreich and Salil P Vadhan. On the complexity of computational problems regarding distributions. Studies in Complexity and Cryptography, 6650:390-405, 2011. Google Scholar
  28. Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum. Delegating computation: interactive proofs for muggles. Journal of the ACM (JACM), 62(4):1-64, 2015. Google Scholar
  29. Shafi Goldwasser, Guy N Rothblum, Jonathan Shafer, and Amir Yehudayoff. Interactive proofs for verifying machine learning. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  30. Tom Gur. On locally verifiable proofs of proximity. PhD thesis, The Weizmann Institute of Science (Israel), 2017. Google Scholar
  31. Tom Gur, Govind Ramnarayan, and Ron Rothblum. Relaxed locally correctable codes. Theory of Computing, 16(1):1-68, 2020. Google Scholar
  32. Tom Gur and Ron D. Rothblum. Non-interactive proofs of proximity. Comput. Complex., 27(1):99-207, 2018. URL: https://doi.org/10.1007/s00037-016-0136-9.
  33. Shirley Halevy and Eyal Kushilevitz. Distribution-free property-testing. SIAM J. Comput., 37(4):1107-1138, 2007. URL: https://doi.org/10.1137/050645804.
  34. Shirley Halevy and Eyal Kushilevitz. Distribution-free connectivity testing for sparse graphs. Algorithmica, 51:24-48, 2008. Google Scholar
  35. Tal Herman and Guy N Rothblum. Verifying the unseen: interactive proofs for label-invariant distribution properties. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 1208-1219, 2022. Google Scholar
  36. Yael Tauman Kalai and Ron D Rothblum. Arguments of proximity. In Advances in Cryptology-CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, pages 422-442. Springer, 2015. Google Scholar
  37. Zhengyang Liu, Xi Chen, Rocco A Servedio, Ying Sheng, and Jinyu Xie. Distribution-free junta testing. ACM Transactions on Algorithms (TALG), 15(1):1-23, 2018. Google Scholar
  38. Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, and Jinyu Xie. Distribution-free junta testing. ACM Trans. Algorithms, 15(1):1:1-1:23, 2019. URL: https://doi.org/10.1145/3264434.
  39. Omer Reingold, Guy N Rothblum, and Ron D Rothblum. Efficient batch verification for UP. In 33rd Computational Complexity Conference (CCC 2018). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  40. Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum. Constant-round interactive proofs for delegating computation. SIAM J. Comput., 50(3), 2021. URL: https://doi.org/10.1137/16M1096773.
  41. Dana Ron and Asaf Rosin. Optimal distribution-free sample-based testing of subsequence-freeness with one-sided error. ACM Transactions on Computation Theory (TOCT), 14(1):1-31, 2022. Google Scholar
  42. Noga Ron-Zewi and Ron D Rothblum. Local proofs approaching the witness length. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 846-857. IEEE, 2020. Google Scholar
  43. Guy N Rothblum and Ron D Rothblum. Batch verification and proofs of proximity with polylog overhead. In Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II, pages 108-138. Springer, 2020. Google Scholar
  44. Guy N. Rothblum, Salil P. Vadhan, and Avi Wigderson. Interactive proofs of proximity: delegating computation in sublinear time. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 793-802. ACM, 2013. URL: https://doi.org/10.1145/2488608.2488709.
  45. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput., 25(2):252-271, 1996. URL: https://doi.org/10.1137/S0097539793255151.
  46. Amit Sahai and Salil P. Vadhan. Manipulating statistical difference. In Panos M. Pardalos, Sanguthevar Rajasekaran, and José Rolim, editors, Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997, volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 251-270. DIMACS/AMS, 1997. URL: https://doi.org/10.1090/dimacs/043/14.
  47. Salil P Vadhan. An unconditional study of computational zero knowledge. SIAM Journal on Computing, 36(4):1160-1214, 2006. Google Scholar
  48. Salil Pravin Vadhan. A study of statistical zero-knowledge proofs. PhD thesis, Massachusetts Institute of Technology, 1999. Google Scholar
  49. Leslie G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984. URL: https://doi.org/10.1145/1968.1972.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact