Trustworthy public randomness with sloth, unicorn, and trx

DOI10.1504/IJACT.2017.089354zbMath1428.94083MaRDI QIDQ1626133

Benjamin Wesolowski, Arjen K. Lenstra

Publication date: 26 November 2018

Published in: International Journal of Applied Cryptography (Search for Journal in Brave)

zbMATH Keywords

random beaconpublic random number generationslow-timed hash

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10)

Related Items (6)

Practical statistically-sound proofs of exponentiation in any group ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Time-release cryptography from minimal circuit assumptions ⋮ On a decentralized trustless pseudo-random number generation algorithm ⋮ Efficient verifiable delay functions ⋮ Continuous verifiable delay functions

This page was built for publication: Trustworthy public randomness with sloth, unicorn, and trx