Bibliography

[WXWJWR22] - Qiang Wu and Liang Xi and Shiren Wang and Shan Ji and Shenqing Wang and Yongjun Ren - Verifiable Delay Function and Its Blockchain-Related Application: {A} Survey. - 2022. -

Summary/Abstract

N/A

[KST22] - Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla - Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. - 2022. -

Summary/Abstract

N/A

[Pa08] - Paul Valiant - Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency. - 2008. -

Summary/Abstract

N/A

[KMT22] - Dmitry Khovratovich and Mary Maller and Pratyush Ranjan Tiwari - MinRoot: Candidate Sequential Function for Ethereum {VDF}. - 2022. -

Summary/Abstract

N/A

[FMPS19] - Luca De Feo and Simon Masson and Christophe Petit and Antonio Sanso - Verifiable Delay Functions from Supersingular Isogenies and Pairings. - 2019. -

Summary/Abstract

N/A

[Pie19] - Krzysztof Pietrzak - Simple Verifiable Delay Functions. - 2019. -

Summary/Abstract

N/A

[Wes19] - Benjamin Wesolowski - Efficient Verifiable Delay Functions. - 2019. -

Summary/Abstract

N/A

[DN92] - Cynthia Dwork and Moni Naor - Pricing via Processing or Combatting Junk Mail. - 1992. -

Summary/Abstract

N/A

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

Summary/Abstract

N/A

[BBBF18] - Dan Boneh and Joseph Bonneau and Benedikt B{\{u}}nz and Ben Fisch - Verifiable Delay Functions. - 2018. -

Summary/Abstract

N/A

[KCMW15] - Chun{-}Han Ko and Ching{-}Chun Chou and Hsiang{-}Yun Meng and Hung{-}Yu Wei - Strategy-Proof Resource Allocation Mechanism for Multi-Flow Wireless Multicast. - 2015. -

Summary/Abstract

N/A

[LW15] - Arjen K. Lenstra and Benjamin Wesolowski - A random zoo: sloth, unicorn, and trx. - 2015. -

Summary/Abstract

N/A

[KZG10] - Aniket Kate and Gregory M. Zaverucha and Ian Goldberg - Constant-Size Commitments to Polynomials and Their Applications. - 2010. -

Summary/Abstract

N/A

[FKLO0W21] - Nicholas Franzese and Jonathan Katz and Steve Lu and Rafail Ostrovsky and Xiao Wang and Chenkai Weng - Constant-Overhead Zero-Knowledge for {RAM} Programs. - 2021. -

Summary/Abstract

N/A

[GWC19] - Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru - {PLONK:} Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. - 2019. -

Summary/Abstract

N/A

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

Summary/Abstract

N/A

[MRV99] - Silvio Micali and Michael O. Rabin and Salil P. Vadhan - Verifiable Random Functions. - 1999. -

Summary/Abstract

N/A

[PWHVNRG17] - DimitriosPapadopoulos and Duane Wessels and Shumon Huque and Moni Naor and Jan Včelák and Leonid Reyzin and Sharon Goldberg - Making NSEC5 Practical for DNSSEC. - 2017. -

Summary/Abstract

N/A

[DY05] - Yevgeniy Dodis and Aleksandr Yampolskiy - A Verifiable Random Function with Short Proofs and Keys. - 2005. -

Summary/Abstract

N/A

[Jag15] - Tibor Jager - Verifiable Random Functions from Weaker Assumptions. - 2015. -

Summary/Abstract

N/A

[HJ15] - Dennis Hofheinz and Tibor Jager - Verifiable Random Functions from Standard Assumptions. - 2016. -

Summary/Abstract

N/A

[BMR10] - Dan Boneh and Hart William Montgomery and Ananth Raghunathan - Algebraic pseudorandom functions with improved efficiency from the augmented cascade. - 2010. -

Summary/Abstract

N/A

[GLOW20] - David Galindo and Jia Liu and Mihai Ordean and Jin{-}Mann Wong - Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons. - 2021. -

Summary/Abstract

N/A

[EKSSZSC20] - Muhammed F. Esgin and Veronika Kuchta and Amin Sakzad and Ron Steinfeld and Zhenfei Zhang and Shifeng Sun and Shumo Chu - Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand. - 2021. -

Summary/Abstract

N/A

[SECG1] - Certicom Research - SEC1: Elliptic Curve Cryptography. - 2009. -

Summary/Abstract

N/A

[BCKL09] - Mira Belenkiy and Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya - Compact E-Cash and Simulatable VRFs Revisited. - 2009. -

Summary/Abstract

N/A

[Bit19] - Nir Bitansky - Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. - 2020. -

Summary/Abstract

N/A

[Lysyanskaya02] - Anna Lysyanskaya - Unique Signatures and Verifiable Random Functions from the {DH-DDH} Separation. - 2002. -

Summary/Abstract

N/A

[MR02] - Silvio Micali and Ronald L. Rivest - Micropayments Revisited. - 2002. -

Summary/Abstract

N/A

[GJKR99] - Rosario Gennaro and Stanislaw Jarecki and Hugo Krawczyk and Tal Rabin - Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. - 1999. -

Summary/Abstract

N/A

[Ped91] - Torben P. Pedersen - Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. - 1991. -

Summary/Abstract

N/A

[BKP11] - Michael Backes and Aniket Kate and Arpita Patra - Computational Verifiable Secret Sharing Revisited. - 2011. -

Summary/Abstract

N/A

[CZAPGD20] - Alin Tomescu and Robert Chen and Yiming Zheng and Ittai Abraham and Benny Pinkas and Guy Golan{-}Gueta and Srinivas Devadas - Towards Scalable Threshold Cryptosystems. - 2020. -

Summary/Abstract

N/A

[Ped91a] - Torben P. Pedersen - A Threshold Cryptosystem without a Trusted Party (Extended Abstract). - 1991. -

Summary/Abstract

N/A

[CGJKR99] - Ran Canetti and Rosario Gennaro and Stanislaw Jarecki and Hugo Krawczyk and Tal Rabin - Adaptive Security for Threshold Cryptosystems. - 1999. -

Summary/Abstract

N/A

[CS04] - John F. Canny and Stephen Sorkin - Practical Large-Scale Distributed Key Generation. - 2004. -

Summary/Abstract

N/A

[KG09] - Aniket Kate and Ian Goldberg - Distributed Key Generation for the Internet. - 2009. -

Summary/Abstract

N/A

[CGMA85] - Benny Chor and Shafi Goldwasser and Silvio Micali and Baruch Awerbuch - Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). - 1985. -

Summary/Abstract

N/A

[CD22] - Wouter Castryck and Thomas Decru - An efficient key recovery attack on {SIDH} (preliminary version). - 2022. -

Summary/Abstract

N/A

[CGL06] - Denis Xavier Charles and Eyal Z. Goren and Kristin E. Lauter - Cryptographic hash functions from expander graphs. - 2006. -

Summary/Abstract

N/A

[MOT20] - Tomoki Moriya and Hiroshi Onuki and Tsuyoshi Takagi - SiGamal: {A} Supersingular Isogeny-Based {PKE} and Its Application to a {PRF}. - 2020. -

Summary/Abstract

N/A

[Sil09] - Joseph H. Silverman - The arithmetic of elliptic curves. - 1986. -

Summary/Abstract

N/A

[EHLMP18] - Kirsten Eisentr{\{a}}ger and Sean Hallgren and Kristin E. Lauter and Travis Morrison and Christophe Petit - Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions. - 2018. -

Summary/Abstract

N/A

[Was08] - Laurence C. Washington - Elliptic Curves: Number Theory and Cryptography. - 2008. -

Summary/Abstract

N/A

[TZ08] - Jean{-}Pierre Tillich and Gilles Z{\'{e}}mor - Collisions for the {LPS} Expander Graph Hash Function. - 2008. -

Summary/Abstract

N/A

[PLQ08] - Christophe Petit and Kristin E. Lauter and Jean{-}Jacques Quisquater - Full Cryptanalysis of {LPS} and Morgenstern Hash Functions. - 2008. -

Summary/Abstract

N/A

[S91] - Claus{-}Peter Schnorr - Efficient Signature Generation by Smart Cards. - 1991. -

Summary/Abstract

N/A

[TS21] - Dmytro Tymokhanov and Omer Shlomovits - Alpha-Rays: Key Extraction Attacks on Threshold {ECDSA} Implementations. - 2021. -

Summary/Abstract

N/A

[CGGMP21] - Ran Canetti and Rosario Gennaro and Steven Goldfeder and Nikolaos Makriyannis and Udi Peled - {UC} Non-Interactive, Proactive, Threshold {ECDSA} with Identifiable Aborts. - 2021. -

Summary/Abstract

N/A

[BCJZ20] - Brendel, Jacqueline and Cremers, Cas and Jackson, Dennis and Zhao, Mang - The provable security of ed25519: theory and practice. - 2021. -

Summary/Abstract

N/A

[HW10] - Susan Hohenberger and Brent Waters - Constructing Verifiable Random Functions with Large Input Spaces. - 2010. -

Summary/Abstract

N/A

[Shamir79] - Adi Shamir - How to Share a Secret. - 1979. -

Summary/Abstract

N/A

[BDLSY12] - Daniel J. Bernstein and Niels Duif and Tanja Lange and Peter Schwabe and Bo{-}Yin Yang - High-speed high-security signatures. - 2012. -

Summary/Abstract

N/A

[KG20] - Chelsea Komlo and Ian Goldberg - {FROST:} Flexible Round-Optimized Schnorr Threshold Signatures. - 2020. -

Summary/Abstract

N/A

[GKRRS21] - Lorenzo Grassi and Dmitry Khovratovich and Christian Rechberger and Arnab Roy and Markus Schofnegger - Poseidon: {A} New Hash Function for Zero-Knowledge Proof Systems. - 2021. -

Summary/Abstract

N/A

[BDPA08] - Guido Bertoni and Joan Daemen and Micha{\{e}}l Peeters and Gilles Van Assche - On the Indifferentiability of the Sponge Construction. - 2008. -

Summary/Abstract

N/A

[MS78] - MacWilliams, F.J. and Sloane, N.J.A. - The Theory of Error-Correcting Codes. - 1978. -

Summary/Abstract

N/A

[GRS20] - Lorenzo Grassi and Christian Rechberger and Markus Schofnegger - Proving Resistance Against Infinitely Long Subspace Trails: How to Choose the Linear Layer. - 2020. -

Summary/Abstract

N/A

[RS16] - Ronald L. Rivest and Jacob C. N. Schuldt - Spritz---a spongy RC4-like stream cipher and hash function.. - 2016. -

Summary/Abstract

N/A

[GLRRS20] - Lorenzo Grassi and Reinhard Lüftenegger and Christian Rechberger and Dragos Rotaru and Markus Schofnegger - On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy. - 2019. -

Summary/Abstract

N/A

[DJRV01] - Daemen, Joan, and Rijmen, Vincent - The Wide Trail Design Strategy. - 2001. -

Summary/Abstract

We explain the theoretical background of the wide trail design strategy, which was used to design Rijndael, the Advanced Encryption Standard (AES). In order to facilitate the discussion, we introduce our own notation to describe differential and linear cryptanalysis. We present a block cipher structure and prove bounds on the resistance against differential and linear cryptanalysis.

[KS22] - Abhiram Kothapalli and Srinath Setty - {SuperNova}: Proving universal machine executions without universal circuits. - 2022. -

Summary/Abstract

N/A