M. Bellare and S. Goldwasser, Encapsulated key escrow, 1996.

M. Bellare and S. Goldwasser, Verifiable partial key escrow, Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS '97, pp.78-91, 1997.

I. Biehl, J. Buchmann, S. Hamdy, and A. Meyer, A signature scheme based on the intractability of computing roots. Designs, Codes and Cryptography, vol.25, pp.223-236, 2002.

D. Boneh, J. Bonneau, B. Bünz, and B. Fisch, Verifiable delay functions, Advances in Cryptology -CRYPTO 2018, pp.757-788, 2018.

D. Boneh, B. Bünz, and B. Fisch, A survey of two verifiable delay functions, Cryptology ePrint Archive, vol.712, 2018.

D. Boneh, B. Bünz, and B. Fisch, Batching techniques for accumulators with applications to iops and stateless blockchains, Advances in Cryptology -CRYPTO 2019, vol.11692, pp.561-586, 2019.

D. Boneh and M. Franklin, Efficient generation of shared RSA keys, Annual International Cryptology Conference, pp.425-439, 1997.

D. Boneh and M. Naor, Timed commitments, Advances in Cryptology -CRYPTO 2000, vol.1880, pp.236-254, 2000.

J. Buchmann and S. Hamdy, A survey on IQ cryptography, Proceedings of Public Key Cryptography and Computational Number Theory, pp.1-15, 2001.

J. Buchmann and H. C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology, vol.1, issue.2, pp.107-118, 1988.

B. Bünz, B. Fisch, and A. Szepieniec, Transparent snarks from DARK compilers. Cryptology ePrint Archive, 1229.

B. Cohen and K. Pietrzak, The Chia network blockchain. Chia network, white paper, 2019.

D. A. Cox, Primes of the form x 2 + ny 2 : Fermat, class field theory, and complex multiplication, vol.34, 2011.

C. Records, , 2018.

Y. Dodis, J. Katz, A. Smith, and S. Walfish, Composability and On-Line Deniability of Authentication, pp.146-162, 2009.

D. Dolev, C. Dwork, and M. Naor, Nonmalleable cryptography. SIAM review, vol.45, issue.4, pp.727-784, 2003.

N. Döttling, S. Garg, G. Malavolta, and P. N. Vasudevan, Tight verifiable delay functions, Cryptology ePrint Archive, 2019.

J. Drake, Ethereum 2.0 randomness, workshop at Stanford hosted by the Ethereum Foundation and the Stanford Center for Blockchain Research, 2018.

J. Drake, Minimal VDF randomness beacon, Ethereum Research post, 2018.

C. Dwork, M. Naor, and A. Sahai, Concurrent zero-knowledge, Journal of the ACM (JACM), vol.51, issue.6, pp.851-898, 2004.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on computing, vol.18, issue.1, pp.186-208, 1989.

J. L. Hafner and K. S. Mccurley, A rigorous subexponential algorithm for computation of class groups, Journal of the American mathematical society, vol.2, issue.4, pp.837-850, 1989.

A. Joux, D. Naccache, and E. Thomé, When e-th roots become easier than factoring, Advances in Cryptology -ASIACRYPT 2007, vol.4833, pp.13-28, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00187782

J. Kilian, A note on efficient zero-knowledge proofs and arguments, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp.723-732, 1992.

A. K. Lenstra and B. Wesolowski, Trustworthy public randomness with sloth, unicorn and trx, International Journal of Applied Cryptology, 2016.

L. Long, Binary quadratic forms. Chia network, Chia VDF Competition Guide, 2019.

S. Micali, Computationally sound proofs, SIAM Journal on Computing, vol.30, issue.4, pp.1253-1298, 2000.

R. Pass, On deniability in the common reference string and random oracle model, Advances in Cryptology -CRYPTO 2003, vol.2729, pp.316-337, 2003.

K. Pietrzak, Simple verifiable delay functions, vol.627, 2018.

M. O. Rabin, Transaction protection by beacons, Journal of Computer and System Sciences, vol.27, issue.2, pp.256-267, 1983.

R. L. Rivest, A. Shamir, and D. A. Wagner, Time-lock puzzles and timed-release crypto, 1996.

T. Sander, Efficient accumulators without trapdoor extended abstract, International Conference on Information and Communications Security, pp.252-262

. Springer, , 1999.

R. Swarbrick, VDF proof feasibility study, Argon Design, technical report, 2018.

U. Vollmer, Asymptotically fast discrete logarithms in quadratic number fields, International Algorithmic Number Theory Symposium (ANTS), pp.581-594

. Springer, , 2000.