Bibliography

[DXNT24] Z. Di and L. Xia and W. Nguyen and N. Tyagi. "MuxProofs: Succinct Arguments for Machine Computation from Vector Lookups". In: ASIACRYPT 2024. IACR ePrint paper 2023/974, 2024

[LXZS24] T. Liu and T. Xie and J. Zhang and D. Song and Y. Zhang. "Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs". In: IEEE S&P 2024. 2024

[TPN24] K. Tang and M. Pham and C. Ngo. "RAMenPaSTA: Parallelizable Scalable Transparent Arguments of Knowledge for RAM Programs". IACR ePrint paper 2024/336, 2024

[MY23] N. Makriyannis and O. Yomtov. "Practical Key-Extraction Attacks in Leading MPC Wallets". Cryptology ePrint Archive, Paper 2023/1234, IACR ePrint paper 2023/1234, 2023

[KS23] A. Kothapalli and S. Setty. "CycleFold: Folding-Scheme-Based Recursive Arguments over a Cycle of Elliptic Curves". IACR ePrint paper 2023/1192, 2023

[ZGGX23] T. Zheng and S. Gao and Y. Guo and B. Xiao. "KiloNova: Non-Uniform PCD with Zero-Knowledge Property from Generic Folding Schemes". IACR ePrint paper 2023/1579, 2023

[WXWJWR22] Q. Wu and L. Xi and S. Wang and S. Ji and S. Wang and Y. Ren. "Verifiable Delay Function and Its Blockchain-Related Application: A Survey". In: Sensors. 2022, pp. 7524

[KST22] A. Kothapalli and S. Setty and I. Tzialla. "Nova: Recursive Zero-Knowledge Arguments from Folding Schemes". In: Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part IV. Ed. by Y. Dodis and T. Shrimpton. Springer, 2022, pp. 359-388

[KMT22] D. Khovratovich and M. Maller and P. Tiwari. "MinRoot: Candidate Sequential Function for Ethereum VDF". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2022/1626, 2022, pp. 1626

[CD22] W. Castryck and T. Decru. "An efficient key recovery attack on SIDH (preliminary version)". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2022/975, 2022, pp. 975

[KS22] A. Kothapalli and S. Setty. "SuperNova: Proving universal machine executions without universal circuits". Cryptology ePrint Archive, Paper 2022/1758, IACR ePrint paper 2022/1758, 2022

[H22] U. Haböck. "Multivariate Lookups Based on Logarithmic Derivatives". IACR ePrint paper 2022/1530, 2022

[KST22] A. Kothapalli and S. Setty and I. Tzialla. "Nova: Recursive Zero-Knowledge Arguments from Folding Schemes". In: Advances in Cryptology – CRYPTO 2022. Ed. by Y. Dodis and T. Shrimpton. Cham: Springer Nature Switzerland, 2022, pp. 359-388. isbn: 978-3-031-15985-5

[FKLO0W21] N. Franzese and J. Katz and S. Lu and R. Ostrovsky and X. Wang and C. Weng. "Constant-Overhead Zero-Knowledge for RAM Programs". In: CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021. Ed. by Y. Kim and J. Kim and G. Vigna and E. Shi. ACM, 2021, pp. 178-191

[GLOW20] D. Galindo and J. Liu and M. Ordean and J. Wong. "Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons". In: IEEE EuroS&P 2021. IEEE, 2021, pp. 88-102

[EKSSZSC20] M. Esgin and V. Kuchta and A. Sakzad and R. Steinfeld and Z. Zhang and S. Sun and S. Chu. "Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand". In: FC 2021. Ed. by N. Borisov and C. Diaz. Springer, 2021, pp. 560-578

[TS21] D. Tymokhanov and O. Shlomovits. "Alpha-Rays: Key Extraction Attacks on Threshold ECDSA Implementations". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2021/1621, 2021, pp. 1621

[CGGMP21] R. Canetti and R. Gennaro and S. Goldfeder and N. Makriyannis and U. Peled. "UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2021/060, 2021, pp. 60

[BCJZ20] J. Brendel and C. Cremers and D. Jackson and M. Zhao. "The provable security of ed25519: theory and practice". In: 2021 IEEE Symposium on Security and Privacy (SP). IEEE, 2021, pp. 1659-1676

[GKRRS21] L. Grassi and D. Khovratovich and C. Rechberger and A. Roy and M. Schofnegger. "Poseidon: A New Hash Function for Zero-Knowledge Proof Systems". In: 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021. Ed. by M. Bailey and R. Greenstadt. USENIX Association, 2021, pp. 519-535

[BCLMS21] B. Bunz and A. Chiesa and W. Lin and P. Mishra and N. Spooner. "Proof-Carrying Data without Succinct Arguments". In: CRYPTO 2021. 2021

[FKLOW21] N. Franzese and J. Katz and S. Lu and R. Ostrovsky and X. Wang and C. Weng. "Constant-Overhead Zero-Knowledge for RAM Programs". In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: Association for Computing Machinery, 2021, pp. 178-191. isbn: 978-1-4503-8454-4

[Bit19] N. Bitansky. "Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs". In: J. Cryptol.. 2020, pp. 459-493

[CZAPGD20] A. Tomescu and R. Chen and Y. Zheng and I. Abraham and B. Pinkas and G. Golan-Gueta and S. Devadas. "Towards Scalable Threshold Cryptosystems". In: 2020 IEEE SP. IEEE, 2020, pp. 877-893

[MOT20] T. Moriya and H. Onuki and T. Takagi. "SiGamal: A Supersingular Isogeny-Based PKE and Its Application to a PRF". In: Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part II. Ed. by S. Moriai and H. Wang. Springer, 2020, pp. 551-580

[FKLPW20] L. Feo and D. Kohel and A. Leroux and C. Petit and B. Wesolowski. "SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies". In: Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part I. Ed. by S. Moriai and H. Wang. Springer, 2020, pp. 64-93

[GG20] R. Gennaro and S. Goldfeder. "One Round Threshold ECDSA with Identifiable Abort". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2020/540, 2020, pp. 540

[KG20] C. Komlo and I. Goldberg. "FROST: Flexible Round-Optimized Schnorr Threshold Signatures". In: Selected Areas in Cryptography - SAC 2020 - 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Ed. by O. Dunkelman and M. Jr. and C. O'Flynn. Springer, 2020, pp. 34-65

[GRS20] L. Grassi and C. Rechberger and M. Schofnegger. "Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer". Cryptology ePrint Archive, Paper 2020/500, IACR ePrint paper 2020/500, 2020

[BCMS20] B. Bunz and A. Chiesa and P. Mishra and N. Spooner. "Proof-Carrying Data from Accumulation Schemes". In: TCC 2020. IACR ePrint paper 2020/499, 2020

[CHMMVW20] A. Chiesa and Y. Hu and M. Maller and P. Mishra and P. Vesely and N. Ward. "Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS". In: EUROCRYPT 2020. 2020

[S20] S. Setty. "Spartan: Efficient and General-Purpose zkSNARKs without Trusted Setup". In: Advances in Cryptology – CRYPTO 2020. Ed. by D. Micciancio and T. Ristenpart. Cham: Springer International Publishing, 2020, pp. 704-737. isbn: 978-3-030-56877-1

[FMPS19] L. Feo and S. Masson and C. Petit and A. Sanso. "Verifiable Delay Functions from Supersingular Isogenies and Pairings". In: Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part I. Ed. by S. Galbraith and S. Moriai. Springer, 2019, pp. 248-277

[Pie19] K. Pietrzak. "Simple Verifiable Delay Functions". In: 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA. Ed. by A. Blum. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, pp. 60:1-60:15

[Wes19] B. Wesolowski. "Efficient Verifiable Delay Functions". In: Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III. Ed. by Y. Ishai and V. Rijmen. Springer, 2019, pp. 379-407

[GWC19] A. Gabizon and Z. Williamson and O. Ciobotaru. "PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge". In: IACR Cryptol. ePrint Arch.. IACR ePrint paper 2019/953, 2019, pp. 953

[GLRRS20] L. Grassi and R. Lüftenegger and C. Rechberger and D. Rotaru and M. Schofnegger. "On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy". Cryptology ePrint Archive, Paper 2019/1107, IACR ePrint paper 2019/1107, 2019

[BCRSSVW19] E. Ben-Sasson and A. Chiesa and M. Riabzev and N. Spooner and M. Virza and N. Ward. "Aurora: Transparent Succinct Arguments for R1CS". In: EUROCRYPT 2019. 2019

[GWC19] A. Gabizon and Z. Williamson and O. Ciobotaru. "PLONK: Permutations over Lagrange-Bases for Oecumenical Noninteractive Arguments of Knowledge". IACR ePrint paper 2019/953, 2019

[BBBF18] D. Boneh and J. Bonneau and B. Bünz and B. Fisch. "Verifiable Delay Functions". In: CRYPTO-2018. Ed. by H. Shacham and A. Boldyreva. Springer, 2018, pp. 757-788

[EHLMP18] K. Eisenträger and S. Hallgren and K. Lauter and T. Morrison and C. Petit. "Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions". In: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III. Ed. by J. Nielsen and V. Rijmen. Springer, 2018, pp. 329-368

[Ra17] randao.org. "Randao". 2017

[PWHVNRG17] D. Papadopoulos and D. Wessels and S. Huque and M. Naor and J. Včelák and L. Reyzin and S. Goldberg. "Making NSEC5 Practical for DNSSEC". IACR ePrint paper 2017/099.pdf, 2017

[HJ15] D. Hofheinz and T. Jager. "Verifiable Random Functions from Standard Assumptions". In: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I. Ed. by E. Kushilevitz and T. Malkin. Springer, 2016, pp. 336-362

[RS16] R. Rivest and J. Schuldt. "Spritz—a spongy RC4-like stream cipher and hash function.". Cryptology ePrint Archive, Paper 2016/856, IACR ePrint paper 2016/856, 2016

[KCMW15] C. Ko and C. Chou and H. Meng and H. Wei. "Strategy-Proof Resource Allocation Mechanism for Multi-Flow Wireless Multicast". In: IEEE Trans. Wirel. Commun.. 2015, pp. 3143-3156

[LW15] A. Lenstra and B. Wesolowski. "A random zoo: sloth, unicorn, and trx". In: IACR Cryptol. ePrint Arch.. 2015, pp. 366

[Jag15] T. Jager. "Verifiable Random Functions from Weaker Assumptions". In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Ed. by Y. Dodis and J. Nielsen. Springer, 2015, pp. 121-143

[BCGTV13] E. Ben-Sasson and A. Chiesa and D. Genkin and E. Tromer and M. Virza. "SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge". In: Advances in Cryptology – CRYPTO 2013. Ed. by R. Canetti and J. Garay. Berlin, Heidelberg: Springer, 2013, pp. 90-108. isbn: 978-3-642-40084-1

[BCIOP13] N. Bitansky and A. Chiesa and Y. Ishai and O. Paneth and R. Ostrovsky. "Succinct Non-Interactive Arguments via Linear Interactive Proofs". In: Theory of Cryptography. Ed. by A. Sahai. Berlin, Heidelberg: Springer, 2013, pp. 315-333. isbn: 978-3-642-36594-2

[GGPR13] R. Gennaro and C. Gentry and B. Parno and M. Raykova. "Quadratic Span Programs and Succinct NIZKs without PCPs". In: Advances in Cryptology – EUROCRYPT 2013. Ed. by T. Johansson and P. Nguyen. Berlin, Heidelberg: Springer, 2013, pp. 626-645. isbn: 978-3-642-38348-9

[Sipser2012-introduction-to-theory-of-computation] M. Sipser. "Introduction to the Theory of Computation". 2012

[BDLSY12] D. Bernstein and N. Duif and T. Lange and P. Schwabe and B. Yang. "High-speed high-security signatures". In: J. Cryptogr. Eng.. 2012, pp. 77-89

[BKP11] M. Backes and A. Kate and A. Patra. "Computational Verifiable Secret Sharing Revisited". In: ASIACRYPT 1991. Ed. by D. Lee and X. Wang. Springer, 2011, pp. 590-609

[KZG10] A. Kate and G. Zaverucha and I. Goldberg. "Constant-Size Commitments to Polynomials and Their Applications". In: Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings. Ed. by M. Abe. Springer, 2010, pp. 177-194

[BW10] S. Hohenberger and B. Waters. "Constructing Verifiable Random Functions with Large Input Spaces". In: EUROCRYPT 2010. Springer, 2010, pp. 656-672

[BMR10] D. Boneh and H. Montgomery and A. Raghunathan. "Algebraic pseudorandom functions with improved efficiency from the augmented cascade". In: ACM CCS 2010. ACM, 2010, pp. 131-140

[HW10] S. Hohenberger and B. Waters. "Constructing Verifiable Random Functions with Large Input Spaces". In: Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings. Ed. by H. Gilbert. Springer, 2010, pp. 656-672

[CT10] A. Chiesa and E. Tromer. "Proof-Carrying Data and Hearsay Arguments from Signature Cards". In: Proceedings of the First Symposium on Innovations in Computer Science (ICS 2010). 2010

[SECG1] C. Research. "SEC1: Elliptic Curve Cryptography". 2009

[BCKL09] M. Belenkiy and M. Chase and M. Kohlweiss and A. Lysyanskaya. "Compact E-Cash and Simulatable VRFs Revisited". In: Pairing-Based Cryptography - Pairing 2009. Ed. by H. Shacham and B. Waters. Springer, 2009, pp. 114-131

[KG09] A. Kate and I. Goldberg. "Distributed Key Generation for the Internet". In: IEE ICDCS 2009. IEEE Computer Society, 2009, pp. 119-128

[CLG09] D. Charles and K. Lauter and E. Goren. "Families of Ramanujan Graphs and Quaternion Algebras". In: CRM Proceedings and Lecture Notes. 2009

[Pa08] P. Valiant. "Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency". In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Ed. by R. Canetti. Springer, 2008, pp. 1-18

[Was08] L. Washington. "Elliptic Curves: Number Theory and Cryptography". 2008 . isbn: 978-1-4200-7146-7

[TZ08] J. Tillich and G. Zémor. "Collisions for the LPS Expander Graph Hash Function". In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings. Ed. by N. Smart. Springer, 2008, pp. 254-269

[PLQ08] C. Petit and K. Lauter and J. Quisquater. "Full Cryptanalysis of LPS and Morgenstern Hash Functions". In: Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings. Ed. by R. Ostrovsky and R. Prisco and I. Visconti. Springer, 2008, pp. 263-277

[BDPA08] G. Bertoni and J. Daemen and M. Peeters and G. Assche. "On the Indifferentiability of the Sponge Construction". In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings. Ed. by N. Smart. Springer, 2008, pp. 181-197

[CGL06] D. Charles and E. Goren and K. Lauter. "Cryptographic hash functions from expander graphs". In: IACR Cryptol. ePrint Arch.. 2006, pp. 21

[DY05] Y. Dodis and A. Yampolskiy. "A Verifiable Random Function with Short Proofs and Keys". In: PKC 2005. Springer, 2005, pp. 416-431

[CS04] J. Canny and S. Sorkin. "Practical Large-Scale Distributed Key Generation". In: EUROCRYPT 2004. Ed. by C. Cachin and J. Camenisch. Springer, 2004, pp. 138-152

[MR04] P. MacKenzie and M. Reiter. "Two-party generation of DSA signatures". In: Int. J. Inf. Sec.. 2004, pp. 218-239

[Lysyanskaya02] A. Lysyanskaya. "Unique Signatures and Verifiable Random Functions from the DH-DDH Separation". In: CRYPTO 2002. Ed. by M. Yung. Springer, 2002, pp. 597-612

[MR02] S. Micali and R. Rivest. "Micropayments Revisited". In: CT-RSA 2002. Ed. by B. Preneel. Springer, 2002, pp. 149-163

[MRV99] S. Micali and M. Rabin and S. Vadhan. "Verifiable Random Functions". In: FOCS 1999. IEEE Computer Society, 1999, pp. 120-130

[GJKR99] R. Gennaro and S. Jarecki and H. Krawczyk and T. Rabin. "Secure Distributed Key Generation for Discrete-Log Based Cryptosystems". In: EUROCRYPT 1999. Springer, 1999, pp. 295-310

[CGJKR99] R. Canetti and R. Gennaro and S. Jarecki and H. Krawczyk and T. Rabin. "Adaptive Security for Threshold Cryptosystems". In: CRYPTO 1999. Ed. by M. Wiener. Springer, 1999, pp. 98-115

[P99] P. Paillier. "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes". In: Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding. Ed. by J. Stern. Springer, 1999, pp. 223-238

[GMR98] R. Gennaro and D. Micciancio and T. Rabin. "An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products". In: CCS '98, Proceedings of the 5th ACM Conference on Computer and Communications Security, San Francisco, CA, USA, November 3-5, 1998. Ed. by L. Gong and M. Reiter. ACM, 1998, pp. 67-72

[DN92] C. Dwork and M. Naor. "Pricing via Processing or Combatting Junk Mail". In: Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings. Ed. by E. Brickell. Springer, 1992, pp. 139-147

[LFKN92] C. Lund and L. Fortnow and H. Karloff and N. Nisan. "Algebraic Methods for Interactive Proof Systems". In: J. ACM. 1992, pp. 859-868

[Ped91] T. Pedersen. "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing". In: CRYPTO 1991. Springer, 1991, pp. 129-140

[Ped91a] T. Pedersen. "A Threshold Cryptosystem without a Trusted Party (Extended Abstract)". In: EUROCRYPT 1991. Ed. by D. Davies. Springer, 1991, pp. 522-526

[S91] C. Schnorr. "Efficient Signature Generation by Smart Cards". In: J. Cryptol.. 1991, pp. 161-174

[Sil09] J. Silverman. "The arithmetic of elliptic curves". In: Graduate texts in mathematics. Springer, 1986 . isbn: 978-3-540-96203-8

[CGMA85] B. Chor and S. Goldwasser and S. Micali and B. Awerbuch. "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)". In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985. IEEE Computer Society, 1985, pp. 383-395

[Shamir79] A. Shamir. "How to Share a Secret". In: Commun. ACM. 1979, pp. 612-613

[MS78] F. MacWilliams and N. Sloane. "The Theory of Error-Correcting Codes". North-holland Publishing Company, 1978

[chainlink] Unknown Author. "chain.link".

[DJRV01] "Daemen and V. Rijmen. ""The Wide Trail Design Strategy"". In: "Cryptography and Coding". Ed. by B. "Honary. "Berlin, Heidelberg": "Springer Berlin Heidelberg", "2001", pp. "222-238". isbn: "978-3-540-45325-3