References

ANO+21

Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, and Omer Shlomovits. Low-bandwidth threshold ecdsa via pseudorandom correlation generators. Cryptology ePrint Archive, Paper 2021/1587, 2021. https://eprint.iacr.org/2021/1587. URL: https://eprint.iacr.org/2021/1587.

AABS+19

Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, and Alan Szepieniec. Design of symmetric-key primitives for advanced cryptographic protocols. Cryptology ePrint Archive, Paper 2019/426, 2019. https://eprint.iacr.org/2019/426. URL: https://eprint.iacr.org/2019/426, doi:10.13154/tosc.v2020.i3.1-45.

BKSV21

Karim Baghery, Markulf Kohlweiss, Janno Siim, and Mikhail Volkhov. Another look at extraction and randomization of groth's zk-snark. In Financial Cryptography. 2021.

BGI+12

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. J. ACM, 59:6:1–6:48, 2012.

BSGL20

Eli Ben-Sasson, Lior Goldberg, and David Levit. Stark friendly hash – survey and recommendation. Cryptology ePrint Archive, Paper 2020/948, 2020. https://eprint.iacr.org/2020/948. URL: https://eprint.iacr.org/2020/948.

BCHO22

Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, and Michele Orru. Gemini: elastic snarks for diverse environments. In Orr Dunkelman and Stefan Dziembowski, editors, Advances in Cryptology – EUROCRYPT 2022, 427–457. Cham, 2022. Springer International Publishing. URL: https://link.springer.com/chapter/10.1007/978-3-031-07085-3_15.

Can01

Ran Canetti. Universally composable security: a new paradigm for cryptographic protocols. Proceedings 2001 IEEE International Conference on Cluster Computing, pages 136–145, 2001.

Can04

Ran Canetti. Universally composable signature, certification, and authentication. Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., pages 219–233, 2004.

CF01

Ran Canetti and Marc Fischlin. Universally composable commitments. IACR Cryptol. ePrint Arch., 2001:55, 2001.

CY21

Alessandro Chiesa and Eylon Yogev. Subquadratic snargs in the random oracle model. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology – CRYPTO 2021, 711–741. Cham, 2021. Springer International Publishing. URL: https://link.springer.com/chapter/10.1007/978-3-030-84242-0_25.

DN02

Damgard and Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In Moti Yung, editor, Advances in Cryptology — CRYPTO 2002, 581–596. Berlin, Heidelberg, 2002. Springer Berlin Heidelberg.

GLS+21

Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, and Riad S. Wahby. Brakedown: linear-time and post-quantum snarks for r1cs. Cryptology ePrint Archive, Paper 2021/1043, 2021. https://eprint.iacr.org/2021/1043. URL: https://eprint.iacr.org/2021/1043.

Gro10

Jens Groth. Short pairing-based non-interactive zero-knowledge arguments. In ASIACRYPT. 2010. URL: https://www.iacr.org/archive/asiacrypt2010/6477323/6477323.pdf.

Gro16

Jens Groth. On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-Sébastien Coron, editors, Advances in Cryptology – EUROCRYPT 2016, 305–326. Berlin, Heidelberg, 2016. Springer Berlin Heidelberg.

GM17

Jens Groth and Mary Maller. Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. In Jonathan Katz and Hovav Shacham, editors, Advances in Cryptology – CRYPTO 2017, 581–612. Cham, 2017. Springer International Publishing. URL: https://eprint.iacr.org/2017/540.pdf.

KCLM21

Irakliy Khaburzaniya, Konstantinos Chalkias, Kevin Lewi, and Harjasleen Malvai. Aggregating hash-based signatures using starks. IACR Cryptol. ePrint Arch., 2021:1048, 2021.

Kil92

Joe Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In STOC '92. 1992.

Kil95

Joe Kilian. Improved efficient arguments (preliminary version). In CRYPTO. 1995.

Mic00

Silvio Micali. Computationally sound proofs. SIAM J. Comput., 30:1253–1298, 2000.

PHGR13

Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. Pinocchio: nearly practical verifiable computation. 2013 IEEE Symposium on Security and Privacy, pages 238–252, 2013. URL: https://eprint.iacr.org/2013/279.pdf.

SAD20

Alan Szepieniec, Tomer Ashur, and Siemen Dhooghe. Rescue-prime: a standard specification (sok). Cryptology ePrint Archive, Paper 2020/1143, 2020. https://eprint.iacr.org/2020/1143. URL: https://eprint.iacr.org/2020/1143.