references.bib

@article{Shamir92,
  author    = {Shamir, Adi},
  title     = {{IP} = {PSPACE}},
  journal   = {Journal of the ACM},
  volume    = {39},
  number    = {4},
  pages     = {869--877},
  year      = {1992},
  url       = {https://doi.org/10.1145/146585.146609},
  addendum  = {A preliminary version of this article appears in FOCS~1990.},
}

@article{LundFKN92,
  author    = {Lund, Carsten and Fortnow, Lance and Karloff, {Howard J.} and Nisan, Noam},
  title     = {Algebraic methods for interactive proof systems},
  journal   = {Journal of the ACM},
  volume    = {39},
  number    = {4},
  pages     = {859--868},
  year      = {1992},
  url       = {https://doi.org/10.1145/146585.146605},
  addendum  = {A preliminary version of this article appears in FOCS~1990.},
}

@article{GoldwasserKR15,
  author    = {Goldwasser, Shafi and Kalai, Yael Tauman and Rothblum, Guy N.},
  title     = {Delegating computation: interactive proofs for {M}uggles},
  journal   = {Journal of the ACM},
  volume    = {62},
  number    = {4},
  pages     = {27:1--27:64},
  year      = {2015},
  url       = {https://doi.org/10.1145/2699436},
  addendum  = {A preliminary version of this article appears in STOC~2008.},
}

@inproceedings{Babai85,
  author    = {Babai, L\'{a}szl\'{o}},
  title     = {Trading group theory for randomness},
  booktitle = {Proceedings of STOC 1985 (17th Symposium on Theory of Computing)},
  series    = {STOC~1985},
  pages     = {421--429},
  year      = {1985},
  url       = {https://doi.org/10.1145/22145.22192},
}

@article{GoldreichH98,
  author    = {Goldreich, Oded and H\r{a}stad, Johan},
  title     = {On the complexity of interactive proofs with bounded communication},
  journal   = {Information Processing Letters},
  volume    = {67},
  number    = {4},
  pages     = {205--214},
  year      = {1998},
  url       = {https://doi.org/10.1016/S0020-0190(98)00116-1}
}

@inproceedings{BabaiFLS91,
  author    = {Babai, L\'{a}szl\'{o} and Fortnow, Lance and Levin, Leonid A. and Szegedy, Mario},
  title     = {Checking computations in polylogarithmic time},
  booktitle = {Proceedings of STOC 1991 (23rd Symposium on Theory of Computing)},
  series    = {STOC~1991},
  pages     = {21--32},
  year      = {1991},
  url       = {https://doi.org/10.1145/103418.103428}
}

@article{BabaiFL91,
  author    = {Babai, L{\'{a}}szl{\'{o}} and Fortnow, Lance and Lund, Carsten},
  title     = {Non-Deterministic exponential time has two-prover interactive protocols},
  journal   = {Computational Complexity},
  volume    = {1},
  pages     = {3--40},
  year      = {1991},
  url       = {https://doi.org/10.1007/BF01200056},
  addendum  = {A preliminary version of this article appears in FOCS~1990.},
}

@article{Fortnow89,
  author    = {Fortnow, Lance},
  title     = {The complexity of perfect zero-knowledge},
  journal   = {Advances in Computing Research},
  volume    = {5},
  pages     = {327--343},
  year      = {1989},
  url       = {https://doi.org/10.1145/28395.28418},
  addendum  = {A preliminary version of this article appears in STOC~1987.},
}

@inproceedings{AielloH87,
  author    = {Aiello, William and H{\aa}stad, Johan},
  title     = {Perfect zero-knowledge languages can be recognized in two rounds},
  booktitle = {Proceedings of FOCS 1987 (28th Symposium on Foundations of Computer Science)},
  series    = {FOCS~1987},
  pages     = {439--448},
  year      = {1987},
  url       = {https://doi.org/10.1109/SFCS.1987.47}
}

@inproceedings{BenOrGGHKMR88,
  author    = {{Ben-Or}, Michael and Goldreich, Oded and Goldwasser, Shafi and H{\aa}stad, Johan and Kilian, Joe and Micali, Silvio and Rogaway, Phillip},
  title     = {Everything provable is provable in zero-knowledge},
  booktitle = {Proceedings of CRYPTO 1988 (8th International Cryptology Conference)},
  series    = {CRYPTO~1988},
  pages     = {37--56},
  year      = {1988},
  url       = {https://doi.org/10.1007/0-387-34799-2_4}
}

@article{GoldwasserMR89,
  author    = {Goldwasser, Shafi and Micali, Silvio and Rackoff, Charles},
  title     = {The knowledge complexity of interactive proof systems},
  journal   = {SIAM Journal on Computing},
  volume    = {18},
  number    = {1},
  pages     = {186--208},
  year      = {1989},
  url       = {https://doi.org/10.1137/0218012},
  addendum  = {A preliminary version of this article appears in STOC~1985.},
}

@article{AroraLMSS98,
  author    = {Arora, Sanjeev and Lund, Carsten and Motwani, Rajeev and Sudan, Madhu and Szegedy, Mario},
  title     = {Proof verification and the hardness of approximation problems},
  journal   = {Journal of the ACM},
  volume    = {45},
  number    = {3},
  pages     = {501--555},
  year      = {1998},
  url       = {https://doi.org/10.1145/278298.278306},
  addendum  = {A preliminary version of this article appears in FOCS~1992.},
 }

@article{AroraS98,
  author    = {Arora, Sanjeev and Safra, Shmuel},
  title     = {Probabilistic checking of proofs: a new characterization of {NP}},
  journal   = {Journal of the ACM},
  volume    = {45},
  number    = {1},
  pages     = {70--122},
  year      = {1998},
  url       = {https://doi.org/10.1145/273865.273901},
  addendum  = {A preliminary version of this article appears in FOCS~1992.},
 }

@phdthesis{Sudan92,
  author    = {Sudan, Madhu},
  title     = {Efficient checking of polynomials and proofs and the hardness of approximations},
  school    = {UC Berkeley},
  year      = {1992},
}

@article{BenSassonS08,
  author    = {{Ben-Sasson}, Eli and Sudan, Madhu},
  title     = {Short {PCP}s with polylog query complexity},
  journal   = {SIAM Journal on Computing},
  volume    = {38},
  number    = {2},
  pages     = {551--607},
  year      = {2008},
  url       = {https://doi.org/10.1137/050646445},
  addendum  = {A preliminary version of this article appears in STOC~2005.},
 }

@article{FeigeGLSS96,
  author    = {Feige, Uriel and Goldwasser, Shafi and Lov\'{a}sz, Laszlo and Safra, Shmuel and Szegedy, Mario},
  title     = {Interactive proofs and the hardness of approximating cliques},
  journal   = {Journal of the ACM},
  volume    = {43},
  number    = {2},
  pages     = {268--292},
  year      = {1996},
  url       = {https://doi.org/10.1145/226643.226652},
  addendum  = {A preliminary version of this article appears in FOCS~1991.},
}

@inproceedings{BenSassonGHSV05,
  author    = {{Ben-Sasson}, Eli and Goldreich, Oded and Harsha, Prahladh and Sudan, Madhu and Vadhan, Salil},
  title     = {Short {PCP}s verifiable in polylogarithmic time},
  booktitle = {Proceedings of CCC 2005 (20th Conference on Computational Complexity)},
  series    = {CCC~2005},
  year      = {2005},
  pages     = {120--134},
  url       = {https://doi.org/10.1109/CCC.2005.27}
}

@inproceedings{BenSassonBHR18-fri,
  author    = {{Ben-Sasson}, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael},
  title     = {Fast {R}eed--{S}olomon interactive oracle proofs of proximity},
  booktitle = {Proceedings of ICALP 2018 (45th International Colloquium on Automata, Languages and Programming)},
  series    = {ICALP~2018},
  pages     = {14:1--14:17},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2018.14}
}

@article{Dinur07,
  author    = {Dinur, Irit},
  title     = {The {PCP} theorem by gap amplification},
  journal   = {Journal of the ACM},
  volume    = {54},
  number    = {3},
  pages     = {12:1--12:44},
  year      = {2007},
  url       = {https://doi.org/10.1145/1236457.1236459},
  addendum  = {A preliminary version of this article appears in STOC~2006.},
}

@article{GoldreichMW91,
  author    = {Goldreich, Oded and Micali, Silvio and Wigderson, Avi},
  title     = {Proofs that yield nothing but their validity or all languages in {NP} have zero-knowledge proof systems},
  journal   = {Journal of the ACM},
  volume    = {38},
  number    = {3},
  pages     = {691--729},
  year      = {1991},
  url       = {https://doi.org/10.1145/116825.116852},
  addendum  = {A preliminary version of this article appears in FOCS~1986.},
}

@article{GoldreichVW02,
  author    = {Goldreich, Oded and Vadhan, Salil and Wigderson, Avi},
  title     = {On interactive proofs with a laconic prover},
  journal   = {Computational Complexity},
  volume    = {11},
  number    = {1-2},
  pages     = {1--53},
  year      = {2002},
  url       = {https://doi.org/10.1007/s00037-002-0169-0},
  addendum  = {A preliminary version of this article appears in ICALP~2001.},
}

@inproceedings{DinurHK15,
  author    = {Dinur, Irit and Harsha, Prahladh and Kindler, Guy},
  title     = {Polynomially low error {PCP}s with polyloglog n queries via modular composition},
  booktitle = {Proceedings of STOC 2015 (47th Symposium on Theory of Computing)},
  series    = {STOC~2015},
  pages     = {267--276},
  year      = {2015},
  url       = {https://doi.org/10.1145/2746539.2746630}
}

@inproceedings{RazS97,
  author    = {Raz, Ran and Safra, Shmuel},
  title     = {A sub-constant error-probability low-degree test, and a sub-constant error-probability {PCP} characterization of {NP}},
  booktitle = {Proceedings of STOC 1997 (29th Symposium on Theory of Computing)},
  series    = {STOC~1997},
  pages     = {475--484},
  year      = {1997},
  url       = {https://doi.org/10.1145/258533.258641}
}

@inproceedings{BenSassonCS16,
  author    = {{Ben-Sasson}, Eli and Chiesa, Alessandro and Spooner, Nicholas},
  title     = {Interactive oracle proofs},
  booktitle = {Proceedings of TCC 2016-B (14th Theory of Cryptography Conference)},
  series    = {TCC~2016-B},
  pages     = {31--60},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-662-53644-5_2}
}

@article{Micali00,
  author    = {Micali, Silvio},
  title     = {Computationally sound proofs},
  journal   = {SIAM Journal on Computing},
  volume    = {30},
  number    = {4},
  pages     = {1253--1298},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539795284959},
  addendum  = {A preliminary version of this article appears in FOCS~1994.},
}

@inproceedings{Kilian92,
  author    = {Kilian, Joe},
  title     = {A note on efficient zero-knowledge proofs and arguments},
  booktitle = {Proceedings of STOC 1992 (24th Symposium on Theory of Computing)},
  series    = {STOC~1992},
  pages     = {723--732},
  year      = {1992},
  url       = {https://doi.org/10.1145/129712.129782}
}

@inproceedings{FiatS86,
  author    = {Fiat, Amos and Shamir, Adi},
  title     = {How to prove yourself: practical solutions to identification and signature problems},
  booktitle = {Proceedings of CRYPTO 1986 (6th International Cryptology Conference)},
  series    = {CRYPTO~1986},
  pages     = {186--194},
  year      = {1986},
  url       = {https://doi.org/10.1007/3-540-47721-7_12}
}

@inproceedings{ChiesaY21-micali,
  author    = {Chiesa, Alessandro and Yogev, Eylon},
  title     = {Tight security bounds for micali's {SNARGs}},
  booktitle = {Proceedings of the 19th Theory of Cryptography Conference},
  series    = {TCC~2021},
  pages     = {401--434},
  year      = {2021},
}

@inproceedings{ChiesaY21-slim,
  author    = {Chiesa, Alessandro and Yogev, Eylon},
  title     = {Subquadratic {SNARGs} in the random oracle model},
  booktitle = {Proceedings of the 41st International Cryptology Conference},
  series    = {CRYPTO~2021},
  pages     = {711--741},
  year      = {2021},
}

@inproceedings{ChiesaMS19,
  author    = {Chiesa, Alessandro and Manohar, Peter and Spooner, Nicholas},
  title     = {Succinct arguments in the quantum random oracle model},
  booktitle = {Proceedings of TCC 2019 (17th Theory of Cryptography Conference)},
  series    = {TCC~2019},
  pages     = {1--29},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-36033-7_1}
}

@inproceedings{Merkle89-tree,
  author    = {Merkle, Ralph C.},
  title     = {A certified digital signature},
  booktitle = {Proceedings of CRYPTO 1989 (9th International Cryptology Conference)},
  series    = {CRYPTO~1989},
  pages     = {218--238},
  year      = {1989},
  url       = {https://doi.org/10.1007/0-387-34805-0_21}
}

@article{ReingoldRR21,
  author    = {Reingold, Omer and Rothblum, Ron and Rothblum, Guy},
  title     = {Constant-round interactive proofs for delegating computation},
  journal   = {SIAM Journal on Computing},
  volume    = {50},
  number    = {3},
  year      = {2021},
  url       = {https://doi.org/10.1137/16M1096773},
  addendum  = {A preliminary version of this article appears in STOC~2016.},
}

@misc{CanettiCHLRR18,
  author    = {Canetti, Ran and Chen, Yilei and Holmgren, Justin and Lombardi, Alex and Rothblum, Guy N. and Rothblum, Ron D.},
  title     = {{F}iat--{S}hamir from simpler assumptions},
  howpublished = {Cryptology ePrint Archive, Report 2018/1004},
  year      = {2018},
  url       = {https://eprint.iacr.org/2018/1004}
}

@inproceedings{Valiant08,
  author    = {Valiant, Paul},
  title     = {Incrementally verifiable computation or proofs of knowledge imply time/space efficiency},
  booktitle = {Proceedings of TCC 2008 (5th Theory of Cryptography Conference)},
  series    = {TCC~2008},
  pages     = {1--18},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-78524-8_1}
}

@article{CanettiGH04,
  author    = {Canetti, Ran and Goldreich, Oded and Halevi, Shai},
  title     = {The random oracle methodology, revisited},
  journal   = {Journal of the ACM},
  volume    = {51},
  number    = {4},
  pages     = {557--594},
  year      = {2004},
  url       = {https://doi.org/10.1145/1008731.1008734},
  addendum  = {A preliminary version of this article appears in STOC~1998.},
}

@inproceedings{BellareR93,
  author    = {Bellare, Mihir and Rogaway, Phillip},
  title     = {Random oracles are practical: a paradigm for designing efficient protocols},
  booktitle = {Proceedings of CCS 1993 (1st Conference on Computer and Communications Security)},
  series    = {CCS~1993},
  pages     = {62--73},
  year      = {1993},
  url       = {https://doi.org/10.1145/168588.168596}
}

@inproceedings{BenSassonCFGRS17,
  author    = {{Ben-Sasson}, Eli and Chiesa, Alessandro and Forbes, Michael A. and Gabizon, Ariel and Riabzev, Michael and Spooner, Nicholas},
  title     = {Zero knowledge protocols from succinct constraint detection},
  booktitle = {Proceedings of TCC 2017 (15th Theory of Cryptography Conference)},
  series    = {TCC~2017},
  pages     = {172--206},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-70503-3_6}
}

@inproceedings{BenSassonCGRS17,
  author    = {{Ben-Sasson}, Eli and Chiesa, Alessandro and Gabizon, Ariel and Riabzev, Michael and Spooner, Nicholas},
  title     = {Interactive oracle proofs with constant rate and query complexity},
  booktitle = {Proceedings of ICALP 2017 (44th International Colloquium on Automata, Languages and Programming)},
  series    = {ICALP~2017},
  pages     = {40:1--40:15},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.40}
}

@inproceedings{RonZewiR20,
  author    = {{Ron-Zewi}, Noga and Rothblum, Ron},
  title     = {Local proofs approaching the witness length},
  booktitle = {Proceedings of FOCS 2020 (61st Symposium on Foundations of Computer Science)},
  series    = {FOCS~2020},
  pages     = {846--857},
  year      = {2020},
  url       = {https://doi.org/10.1109/FOCS46700.2020.00083}
}

@inproceedings{BootleCGGHJ17,
  author    = {Bootle, Jonathan and Cerulli, Andrea and Ghadafi, Essam and Groth, Jens and Hajiabadi, Mohammad and Jakobsen, Sune K.},
  title     = {Linear-Time zero-knowledge proofs for arithmetic circuit satisfiability},
  booktitle = {Proceedings of ASIACRYPT 2017 (23rd International Conference on the Theory and Applications of Cryptology and Information Security)},
  series    = {ASIACRYPT~2017},
  pages     = {336--365},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-70700-6_12}
}

@inproceedings{BootleCG20,
  author    = {Bootle, Jonathan and Chiesa, Alessandro and Groth, Jens},
  title     = {Linear-Time arguments with sublinear verification from tensor codes},
  booktitle = {Proceedings of TCC 2020 (18th Theory of Cryptography Conference)},
  series    = {TCC~2020},
  pages     = {19--46},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-64378-2_2}
}

@inproceedings{BootleCL22,
  author    = {Bootle, Jonathan and Chiesa, Alessandro and Liu, Siqi},
  title     = {Zero-Knowledge {IOP}s with linear-time prover and polylogarithmic-time verifier},
  booktitle = {Proceedings of EUROCRYPT 2022 (42nd International Conference on Theory and Application of Cryptographic Techniques)},
  series    = {EUROCRYPT~2022},
  pages     = {275--304},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-07085-3_10}
}

@inproceedings{BenSassonBHR18-sci,
  author    = {{Ben-Sasson}, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael},
  title     = {Scalable zero knowledge with no trusted setup},
  booktitle = {Proceedings of CRYPTO 2019 (39th International Cryptology Conference)},
  series    = {CRYPTO~2019},
  pages     = {733--764},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-26954-8_23}
}

@inproceedings{BenSassonCRSVW19,
  author    = {{Ben-Sasson}, Eli and Chiesa, Alessandro and Riabzev, Michael and Spooner, Nicholas and Virza, Madars and Ward, Nicholas P.},
  title     = {Aurora: transparent succinct arguments for {R1CS}},
  booktitle = {Proceedings of EUROCRYPT 2019 (38th International Conference on the Theory and Applications of Cryptographic Techniques)},
  series    = {EUROCRYPT~2019},
  pages     = {103--128},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-17653-2_4}
}

@inproceedings{ChiesaOS20,
  author    = {Chiesa, Alessandro and Ojha, Dev and Spooner, Nicholas},
  title     = {Fractal: post-quantum and transparent recursive proofs from holography},
  booktitle = {Proceedings of EUROCRYPT 2020 (39th International Conference on the Theory and Applications of Cryptographic Techniques)},
  series    = {EUROCRYPT~2020},
  pages     = {769--793},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-45721-1_27}
}

@inproceedings{CascudoG22,
  author    = {Cascudo, Ignacio and Giunta, Emanuele},
  title     = {On interactive oracle proofs for boolean {R1CS} statements},
  booktitle = {Proceedings of FC 2022 (26th International Conference on Financial Cryptography and Data Security)},
  series    = {FC~2022},
  pages     = {230--247},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-18283-9_11}
}

@inproceedings{Pass03,
  author    = {Pass, Rafael},
  title     = {On deniability in the common reference string and random oracle model},
  booktitle = {Proceedings of CRYPTO 2003 (23rd International Cryptology Conference)},
  series    = {CRYPTO~2003},
  pages     = {316--337},
  year      = {2003},
  url       = {https://doi.org/10.1007/978-3-540-45146-4_19}
}

@inproceedings{AttemaFK22,
  author    = {Attema, Thomas and Fehr, Serge and Kloo{\ss}, Michael},
  title     = {{F}iat--{S}hamir transformation of multi-round interactive proofs},
  booktitle = {Proceedings of TCC 2022 (20th Theory of Cryptography Conference)},
  series    = {TCC~2022},
  pages     = {113--142},
  year      = {2022},
  url       = {https://eprint.iacr.org/2021/1377}
}

@inproceedings{AttemaCK21,
  author    = {Attema, Thomas and Cramer, Ronald and Kohl, Lisa},
  title     = {A compressed $\Sigma$-Protocol theory for lattices},
  booktitle = {Proceedings of CRYPTO 2021 (41st International Cryptology Conference)},
  series    = {CRYPTO~2021},
  pages     = {549--579},
  year      = {2021},
  url       = {https://eprint.iacr.org/2021/307}
}

@misc{ZKProof,
  author    = {ZKProof},
  title     = {{ZKProof} community reference},
  url       = {https://docs.zkproof.org/reference},
  year      = {2022},
}

@misc{FOPPSummer21,
  author    = {Chiesa, Alessandro and Gur, Tom},
  title     = {Foundations and frontiers of probabilistic proofs},
  url       = {https://www.slmath.org/workshops/931},
  year      = {2021},
}

@misc{FOPPSummer23,
  author    = {Chiesa, Alessandro},
  title     = {Foundations and frontiers of probabilistic proofs},
  url       = {https://www.slmath.org/workshops/1037},
  year      = {2023},
}

@misc{ThalerBook,
  author    = {Thaler, Justin},
  title     = {Proofs, arguments, and zero-knowledge},
  url       = {https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.html},
  year      = {2022},
}

@inproceedings{RonZewiR22,
  author    = {{Ron-Zewi}, Noga and Rothblum, Ron D.},
  title     = {Proving as fast as computing: succinct arguments with constant prover overhead},
  booktitle = {Proceedings of STOC 2022 (54th Symposium on the Theory of Computing)},
  series    = {STOC~2022},
  pages     = {1353--1363},
  year      = {2022},
  url       = {https://doi.org/10.1145/3519935.3519956}
}

@inproceedings{GolovnevSTW23,
  author    = {Golovnev, Alexander and Lee, Jonathan and Setty, Srinath T. V. and Thaler, Justin and Wahby, Riad S.},
  title     = {Brakedown: linear-time and field-agnostic {SNARKs} for {R1CS}},
  booktitle = {Proceedings of CRYPTO 2023 (43rd Annual International Cryptology Conference)},
  series    = {CRYPTO~2023},
  year      = {2023},
  url       = {https://doi.org/10.1007/978-3-031-38545-2_7}
}

@misc{BlockGTZ23,
  author    = {Block, Alexander R. and Garreta, Albert and Tiwari, Pratyush Ranjan and Zaj\k{a}c, Micha\l{}},
  title     = {On soundness notions for interactive oracle proofs},
  howpublished = {Cryptology ePrint Archive, Paper 2023/1256},
  year      = {2023},
  url       = {https://eprint.iacr.org/2023/1256}
}

@misc{Holmgren19,
  author    = {Holmgren, Justin},
  title     = {On round-by-round soundness and state restoration attacks},
  howpublished = {Cryptology ePrint Archive, Paper 2019/1261},
  year      = {2019},
  url       = {https://eprint.iacr.org/2019/1261}
}

@inproceedings{PointchevalS96,
  author    = {Pointcheval, David and Stern, Jacques},
  title     = {Security proofs for signature schemes},
  booktitle = {Proceedings of EUROCRYPT 1996 (15th International Conference on Theory and Application of Cryptographic Techniques)},
  series    = {EUROCRYPT~1996},
  pages     = {387--398},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-68339-9_33}
}

@inproceedings{BellareN06,
  author    = {Mihir Bellare and Gregory Neven},
  title     = {Multi-signatures in the plain public-key model and a general forking lemma},
  booktitle = {Proceedings of CCS 2006 (13th Conference on Computer and Communications Security)},
  series    = {CCS~2006},
  pages     = {390--399},
  year      = {2006},
  url       = {https://doi.org/10.1145/1180405.1180453}
}

@article{Mie09,
 author    = {Mie, Thilo},
 title     = {Short {PCPP}s verifiable in polylogarithmic time with o(1) queries},
 journal   = {Annals of Mathematics and Artificial Intelligence},
 pages     = {313--338},
 volume    = {56},
 issue     = {3},
 year      = {2009},
 url       = {https://doi.org/10.1007/s10472-009-9169-y}
}

@article{DinurFKRS11,
  author    = {Dinur, Irit and Fischer, Eldar and Kindler, Guy and Raz, Ran and Safra, Shmuel},
  title     = {{PCP} characterizations of {NP}: toward a polynomially-small error-probability},
  journal   = {Computational Complexity},
  volume    = {20},
  number    = {3},
  pages     = {413--504},
  year      = {2011},
  url       = {https://doi.org/10.1007/s00037-011-0014-4},
  addendum  = {A preliminary version of this article appears in STOC~1999.},
}

@article{AroraS03,
  author    = {Arora, Sanjeev and Sudan, Madhu},
  title     = {Improved low-degree testing and its applications},
  journal   = {Combinatorica},
  volume    = {23},
  number    = {3},
  pages     = {365--426},
  year      = {2003},
  url       = {https://doi.org/10.1007/s00493-003-0025-0},
  addendum  = {A preliminary version of this article appears in STOC~1997.},
}

@inproceedings{BlockGKTTZ23,
  author    = {Block, Alexander R. and Garreta, Albert and Katz, Jonathan and Thaler, Justin and Tiwari, Pratyush Ranjan and Zaj\k{a}c, Micha\l{}},
  title     = {{Fiat--Shamir} security of {FRI} and related {SNARKs}},
  booktitle = {Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security},
  series    = {ASIACRYPT~2023},
  pages     = {3--40},
  year      = {2023},
  url       = {https://doi.org/10.1007/978-981-99-8724-5\_1},
}

@inproceedings{Schnorr89,
  author    = {Schnorr, {Claus-Peter}},
  title     = {Efficient identification and signatures for smart cards},
  booktitle = {Proceedings of CRYPTO 1989 (9th International Cryptology Conference)},
  series    = {CRYPTO~1989},
  pages     = {239--252},
  year      = {1989},
  url       = {https://doi.org/10.1007/0-387-34805-0_22}
}

@inproceedings{BuenzBBPWM18,
  author    = {B\"unz, Benedikt and Bootle, Jonathan and Boneh, Dan and Poelstra, Andrew and Wuille, Pieter and Maxwell, Greg},
  title     = {Bulletproofs: short proofs for confidential transactions and more},
  booktitle = {Proceedings of S\&P~2018 (39th IEEE Symposium on Security and Privacy)},
  series    = {S\&P~2018},
  pages     = {315--334},
  year      = {2018},
  url       = {https://doi.org/10.1109/SP.2018.00020}
}

@article{BennettG81,
  author    = {Bennett, Charles H. and Gill, John},
  title     = {Relative to a random oracle {$A$}, {$P^A \neq NP^A \neq coNP^A$} with probability 1},
  journal   = {SIAM Journal on Computing},
  volume    = {10},
  number    = {1},
  pages     = {96--113},
  year      = {1981},
  url       = {https://doi.org/10.1137/0210008}
}

@article{Brassard81,
  author    = {Brassard, Gilles},
  title     = {A time-luck tradeoff in relativized cryptography},
  journal   = {Journal of Computer and System Sciences},
  volume    = {22},
  number    = {3},
  pages     = {280--311},
  year      = {1981},
  url       = {https://doi.org/10.1016/0022-0000(81)90034-9}
}

@inproceedings{ImpagliazzoR89,
  author    = {Impagliazzo, Russell and Rudich, Steven},
  title     = {Limits on the provable consequences of one-way permutations},
  booktitle = {Proceedings of STOC 1989 (21st Symposium on Theory of Computing)},
  series    = {STOC~1989},
  pages     = {44--61},
  year      = {1989},
  url       = {https://doi.org/10.1145/73007.73012}
}

@phdthesis{Cramer97,
  author    = {Cramer, Ronald},
  title     = {Modular design of secure yet practical cryptographic protocols},
  school    = {University of Amsterdam},
  year      = {1997},
  url       = {https://ir.cwi.nl/pub/21438/21438A.pdf}
}

@inproceedings{Damgard89,
  author    = {Damg{\aa}rd, Ivan},
  title     = {A design principle for hash functions},
  booktitle = {Proceedings of CRYPTO 1989 (9th International Cryptology Conference)},
  series    = {CRYPTO~1989},
  volume    = {435},
  pages     = {416--427},
  year      = {1989},
  url       = {https://doi.org/10.1007/0-387-34805-0_39}
}

@inproceedings{Merkle89-hash,
  author    = {Merkle, Ralph C.},
  title     = {One way hash functions and {DES}},
  booktitle = {Proceedings of CRYPTO 1989 (9th International Cryptology Conference)},
  series    = {CRYPTO~1989},
  volume    = {435},
  pages     = {428--446},
  year      = {1989},
  url       = {https://doi.org/10.1007/0-387-34805-0_40}
}

@inproceedings{BootleCCGP16,
  author    = {Bootle, Jonathan and Cerulli, Andrea and Chaidos, Pyrros and Groth, Jens and Petit, Christophe},
  title     = {Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting},
  booktitle = {Proceedings of EUROCRYPT 2016 (35th International Conference on Theory and Application of Cryptographic Techniques)},
  series    = {EUROCRYPT~2016},
  pages     = {327--357},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-662-49896-5_12}
}

@inproceedings{BenSassonCGV16,
  author    = {{Ben-Sasson}, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars},
  title     = {Quasilinear-Size zero knowledge from linear-algebraic {PCP}s},
  booktitle = {Proceedings of TCC 2016-A (13th Theory of Cryptography Conference)},
  series    = {TCC~2016-A},
  pages     = {33--64},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-662-49099-0_2}
}

@misc{ArnonCFY24,
  author    = {Arnon, Gal and Chiesa, Alessandro and Fenzi, Giacomo and Yogev, Eylon},
  title     = {{STIR}: {R}eed--{S}olomon proximity testing with fewer queries},
  howpublished = {Cryptology ePrint Archive, Report 2024/390},
  year      = {2024},
  url       = {https://eprint.iacr.org/2024/390}
}

@inproceedings{BonehDFLSZ11,
  author    = {Boneh, Dan and Dagdelen, {\"{O}}zg{\"{u}}r and Fischlin, Marc and Lehmann, Anja and Schaffner, Christian and Zhandry, Mark},
  title     = {Random oracles in a quantum world},
  booktitle = {Proceedings of ASIACRYPT~2011 (17th International Conference on the Theory and Application of Cryptology and Information Security)},
  series    = {ASIACRYPT~2011},
  pages     = {41--69},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-25385-0_3}
}


@inproceedings{LiuZ19,
  author    = {Liu, Qipeng and Zhandry, Mark},
  title     = {Revisiting post-quantum {F}iat--{S}hamir},
  booktitle = {Proceedings of CRYPTO~'19 (39th Annual International Cryptology Conference)},
  series    = {CRYPTO~'19},
  pages     = {326--355},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-26951-7_12}
}

@inproceedings{DonFMS19,
  author    = {Don, Jelle and Fehr, Serge and Majenz, Christian and Schaffner, Christian},
  title     = {Security of the {F}iat--{S}hamir transformation in the quantum random-oracle model},
  booktitle = {Proceedings of CRYPTO~'19 (39th Annual International Cryptology Conference)},
  series    = {CRYPTO~'19},
  pages     = {356--383},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-26951-7_13}
}

@inproceedings{YamakawaZ22,
  author    = {Yamakawa, Takashi and Zhandry, Mark},
  title     = {Verifiable quantum advantage without structure},
  booktitle = {Proceedings of FOCS 2022 (63rd Symposium on Foundations of Computer Science)},
  series    = {FOCS~2022},
  pages     = {69--74},
  year      = {2022},
  url       = {https://doi.org/10.1109/FOCS54457.2022.00014}
}

@article{BarakG08,
  author    = {Barak, Boaz and Goldreich, Oded},
  title     = {Universal Arguments and their Applications},
  journal   = {SIAM Journal on Computing},
  volume    = {38},
  number    = {5},
  year      = {2008},
  pages     = {1661--1694},
  url       = {https://doi.org/10.1137/070709244},
  addendum  = {A preliminary version of this article appears in CCC~'02.}
}

@misc{IshaiMSX15,
  author    = {Ishai, Yuval and Mahmoody, Mohammad and Sahai, Amit and Xiao, David},
  title     = {On Zero-Knowledge {PCP}s: Limitations, Simplifications, and Applications},
  year      = {2015},
  url       = {http://www.cs.virginia.edu/~mohammad/files/papers/ZKPCPs-Full.pdf}
}

@misc{ChiesaDGS24,
  author    = {Chiesa, Alessandro and {Dall'Agnol}, Marcel and Guan, Ziyi and Spooner, Nicholas},
  title     = {On the Security of Succinct Interactive Arguments from Vector Commitments},
  howpublished = {Cryptology ePrint Archive, Paper 2023/1737},
  year      = {2023},
  url       = {https://eprint.iacr.org/2023/1737}
}

@inproceedings{GentryW11,
  author    = {Gentry, Craig and Wichs, Daniel},
  title     = {Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions},
  booktitle = {Proceedings of STOC~'11 (43rd Annual ACM Symposium on Theory of Computing)},
  series    = {STOC~'11},
  year      = {2011},
  pages     = {99--108},
  url       = {https://doi.org/10.1145/1993636.1993651}
}