Abstract
Interactive oracle proofs (IOPs) are a proof system model that combines features of interactive proofs (IPs) and probabilistically checkable proofs (PCPs). IOPs have prominent applications in complexity theory and cryptography, most notably to constructing succinct arguments.
In this work, we study the limitations of IOPs, as well as their relation to those of PCPs. We present a versatile toolbox of IOP-to-IOP transformations containing tools for: (i) length and round reduction; (ii) improving completeness; and (iii) derandomization.
We use this toolbox to establish several barriers for IOPs:
-
Low-error IOPs can be transformed into low-error PCPs. In other words, interaction can be used to construct low-error PCPs; alternatively, low-error IOPs are as hard to construct as low-error PCPs. This relates IOPs to PCPs in the regime of the sliding scale conjecture for inverse-polynomial soundness error.
-
Limitations of quasilinear-size IOPs for 3SAT with small soundness error.
-
Limitations of IOPs where query complexity is much smaller than round complexity.
-
Limitations of binary-alphabet constant-query IOPs.
We believe that our toolbox will prove useful to establish additional barriers beyond our work.
G. Arnon—Supported in part by a grant from the Israel Science Foundation (no. 2686/20) and by the Simons Foundation Collaboration on the Theory of Algorithmic Fairness.
A. Chiesa—Supported in part by the Ethereum Foundation.
E. Yogev—Supported in part by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office, and by the Alter Family Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
There exists a function in \({\textsf{E}}\) with circuit complexity \(2^{\varOmega (n)}\) for circuits with \(\textrm{PSPACE}\) gates.
- 2.
\(\texttt{RETH}\) states that there exists a constant \(c>0\) such that \(\textrm{3SAT}\notin \textrm{BPTIME}[2^{c \cdot n}]\).
- 3.
Assuming \(\texttt{ETH}\), the proof length of the PCP can be \(2^{o(n)}\).
- 4.
It is sufficient to assume that \(\beta = \frac{1}{2} \cdot \left( \frac{2\cdot e\cdot \textsf{l}\cdot \log \lambda }{c \cdot n}\right) ^{-\textsf{q}}\) to find contradiction in \(\beta \le \frac{1}{2} \cdot \left( \frac{2\cdot e \cdot \textsf{l}\cdot \log \lambda }{c\cdot n}\right) ^{-\textsf{q}}\) since we can always increase the soundness error without loss of generality.
References
Applebaum, B., Golombek, E.: On the randomness complexity of interactive proofs and statistical zero-knowledge proofs. In: Proceedings of the 2nd Conference on Information-Theoretic Cryptography, ITC 2021, pp. 4:1–4:23 (2021)
Arnon, G., Chiesa, A., Yogev, E.: Hardness of approximation for stochastic problems via interactive oracle proofs. In: Proceedings of the 37th Annual IEEE Conference on Computational Complexity, CCC 2022, pp. 24:1–24:16 (2022)
Arnon, G., Chiesa, A., Yogev, E.: A PCP theorem for interactive proofs. In: Proceedings of the 41st Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 2022, pp. 64–94 (2022)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998). Preliminary version in FOCS ’92
Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). Preliminary version in FOCS ’92
Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 21–32 (1991)
Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximations. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 294–304 (1993)
Ben-Sasson, E., et al.: Computational integrity with a public random string from quasi-linear PCPs. In: Proceedings of the 36th Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 2017, pp. 551–579 (2017)
Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: Proceedings of the 45th International Colloquium on Automata, Languages and Programming, ICALP 2018, pp. 14:1–14:17 (2018)
Ben-Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., Spooner, N.: Interactive oracle proofs with constant rate and query complexity. In: Proceedings of the 44th International Colloquium on Automata, Languages and Programming, ICALP 2017, pp. 40:1–40:15 (2017)
Ben-Sasson, E., Chiesa, A., Gabizon, A., Virza, M.: Quasilinear-size zero knowledge from linear-algebraic PCPs. In: Proceedings of the 13th Theory of Cryptography Conference, TCC 2016-A, pp. 33–64 (2016)
Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, pp. 31–60 (2016)
Ben-Sasson, E., Sudan, M.: Short PCPs with polylog query complexity. SIAM J. Comput. 38(2), 551–607 (2008). Preliminary version appeared in STOC ’05
Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Proceedings of the 23rd International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2017, pp. 336–365 (2017)
Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Proceedings of the 18th Theory of Cryptography Conference, TCC 2020, pp. 19–46 (2020)
Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier. In: Proceedings of the 41st Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 2022, pp. 275–304 (2022)
Bordage, S., Nardi, J.: Interactive oracle proofs of proximity to algebraic geometry codes. In: Proceedings of the 37th Annual IEEE Conference on Computational Complexity, CCC 2022, pp. 30:1–30:45 (2022)
Chiesa, A., Yogev, E.: Barriers for succinct arguments in the random oracle model. In: Proceedings of the 18th Theory of Cryptography Conference, TCC 2020, pp. 47–76 (2020)
Condon, A., Feigenbaum, J., Lund, C., Shor, P.W.: Random debaters and the hardness of approximating stochastic functions. SIAM J. Comput. 26(2), 369–400 (1997)
Dinur, I.: The PCP theorem by gap amplification. J. ACM 54(3), 12 (2007)
Dinur, I., Harsha, P., Kindler, G.: Polynomially low error PCPs with polyloglog n queries via modular composition. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 267–276 (2015)
Drucker, A.: A PCP characterization of AM. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, pp. 581–592 (2011)
Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-complete (preliminary version). In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, SFCS 1991, pp. 2–12 (1991)
Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268–292 (1996). Preliminary version in FOCS ’91
Fürer, M., Goldreich, O., Mansour, Y., Sipser, M., Zachos, S.: On completeness and soundness in interactive proof systems. Adv. Comput. Res. 5, 429–442 (1989)
Goldreich, O., Håstad, J.: On the complexity of interactive proofs with bounded communication. Inf. Process. Lett. 67(4), 205–214 (1998)
Goldreich, O., Vadhan, S., Wigderson, A.: On interactive proofs with a laconic prover. Comput. Complex. 11(1/2), 1–53 (2002)
Golovnev, A., Lee, J., V., S.S.T., Thaler, J., Wahby, R.S.: Brakedown: linear-time and post-quantum snarks for R1CS. Cryptology ePrint Archive, Report 2021/1043 (2021)
Hast, G.: Beating a random assignment: approximating constraint satisfaction problems. Ph.D. thesis, KTH (2005)
Håstad, J.: On the NP-hardness of max-not-2. SIAM J. Comput. 43(1), 179–193 (2014)
Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Linear-time zero-knowledge snarks for R1CS. Cryptology ePrint Archive, Report 2021/30 (2021)
Manurangsi, P., Nakkiran, P., Trevisan, L.: Near-optimal NP-hardness of approximating MAX k-CSPR. Theory Comput. 18(3), 1–29 (2022)
Nassar, S., Rothblum, R.D.: Succinct interactive oracle proofs: applications and limitations. In: Proceedings of the 42nd Annual International Cryptology Conference, CRYPTO 2022 (2022)
Reingold, O., Rothblum, R., Rothblum, G.: Constant-round interactive proofs for delegating computation. In: Proceedings of the 48th ACM Symposium on the Theory of Computing, STOC 2016, pp. 49–62 (2016)
Ron-Zewi, N., Rothblum, R.: Local proofs approaching the witness length. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020, pp. 846–857 (2020)
Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Proceedings of the 54th ACM Symposium on the Theory of Computing, STOC 2022, pp. 1353–1363 (2022)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)
Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Proceedings of the 39th Annual International Cryptology Conference, CRYPTO 1919, pp. 733–764 (2019)
Zwick, U.: Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: Proceedings of the 9th Annual Symposium on Discrete Algorithms, SODA 1998, pp. 201–210 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Arnon, G., Bhangale, A., Chiesa, A., Yogev, E. (2022). A Toolbox for Barriers on Interactive Oracle Proofs. In: Kiltz, E., Vaikuntanathan, V. (eds) Theory of Cryptography. TCC 2022. Lecture Notes in Computer Science, vol 13747. Springer, Cham. https://doi.org/10.1007/978-3-031-22318-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-22318-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-22317-4
Online ISBN: 978-3-031-22318-1
eBook Packages: Computer ScienceComputer Science (R0)