• Corpus ID: 1424166

A random zoo: sloth, unicorn, and trx

  title={A random zoo: sloth, unicorn, and trx},
  author={Arjen K. Lenstra and Benjamin Wesolowski},
  journal={IACR Cryptol. ePrint Arch.},
Many applications require trustworthy generation of public random numbers. It is shown how this can be achieved using a hash function that is timed to be as slow as desired (sloth), while the correctness of the resulting hash can be verified quickly. It is shown how sloth can be used for uncontestable random number generation (unicorn), and how unicorn can be used for a new trustworthy random ellip­ tic curves service (trx) and random-sample 

Tables from this paper

A publicly verifiable protocol for random number generation

  • João PennaJeroen van de Graaf
  • Computer Science, Mathematics
    Anais do XVII Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2017)
  • 2017
This work proposes an improvement of NIST’s randomness beacon which is publicly verifiable and fully transparent: any outsider who did not witness the bit generation in person but has internet access can convince himself that the beacon acted honestly, provided he can be sure that fresh, independent random bits were contributed to the seed value.

Breeding unicorns: Developing trustworthy and scalable randomness beacons

This paper designs, implements, and evaluates a trustworthy and efficient randomness beacon allowing users to join at any time, and reports on a Ethereum smart contract-based lottery using the authors' beacon.

Trust , and public entropy : a unicorn hunt

The design of a secure, trustworthy random beacon is discussed, and what constraints are unavoidable to reach certain security guarantees are derived.

Spurt: Scalable Distributed Randomness Beacon with Transparent Setup

Spurt is presented, an efficient distributed randomness beacon protocol that does not require any trusted or expensive setup and is secure against a malicious adversary that controls up to one-third of the nodes in a partially synchronous network.

SCRAPE: Scalable Randomness Attested by Public Entities

This work presents a coin tossing protocol for an honest majority that allows for any entity to verify that an output was honestly generated by observing publicly available information (even after the execution is complete), while achieving both guaranteed output delivery and scalability.

Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness

This work uses public and immutable cryptocurrency smart contracts, along with a set of potentially malicious randomness providers, to produce a trustworthy stream of timestamped public random numbers, including the stored history of random numbers.

RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness

This design allows RandRunner to tolerate adversarial or failed leaders while guaranteeing safety and liveness of the protocol despite possible periods of asynchrony, and avoids the necessity of a BFT consensus protocol and its accompanying high complexity and communication overhead.

Verifiable Delay Functions

The requirements for a verifiable delay function (VDF) are formalized and new candidate constructions are presented that are the first to achieve an exponential gap between evaluation and verification time.

Trap Me If You Can - Million Dollar Curve

This article proposes a way of combining lotteries from several different countries which would require an adversary to manipulate several independent draws in order to introduce a trap in the generated cryptosystem.

Homomorphic Encryption Random Beacon

This work introduces HERB: a new randomness beacon protocol based on additively homomorphic encryption that meets the requirements listed above and additionaly provides Guaranteed Output Delivery.



Malicious Hashing: Eve's Variant of SHA-1

This proof-of-concept demonstrates the exploitability of custom SHA-1 versions for malicious purposes, such as the injection of user surveillance features, and proposes definitions of malicious hash functions and of associated security notions.

Encapsulated Key Escrow

A new approach to key escrow is introduced, applicable to any encryption algorithm, which makes it veriiably computationally possible for an authority to only selectively wiretap a small number of individual users, and computationally prohibitive to launch large scale wiretapping.

Quantum Random Number Generation on a Mobile Phone

The quality of the cameras integrated in mobile telephones has improved significantly so that now they are sensitive to light at the few-photon level, and it is demonstrated how these can be used to generate random numbers of a quantum origin.

On Bitcoin as a public randomness source

This work formalizes the use of Bitcoin as a source of publiclyverifiable randomness and shows that any attack on this beacon would form an attack on Bitcoin itself and hence have a monetary cost that can be bound, unlike any other construction for a public randomness beacon in the literature.

Verifiable partial key escrow

This work provides schemes to perform partial key escrow in a verifiable manner in a public-key encryption setting and shows that other proposals for verifiable partial key Escrow suffer from the early recovery problem, and thus do not in fact offer an advantage over standard key-escrow schemes.

Timed Commitments

We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the

Transaction Protection by Beacons

  • M. Rabin
  • Computer Science
    J. Comput. Syst. Sci.
  • 1983

Random Number Generated from White Noise of Webcam

Through algorithms, 91% IPcam generating sequences pass at least four statistical tests, 87% pass all five ones has been approved, which implies improvement by algorithm on personal devices such as laptop, for instance, is necessary to generate qualified random number to protect private information.

Time-lock Puzzles and Timed-release Crypto

There are two natural approaches to implementing timed-release crypto: Use ``time-lock puzzles''--computational problems that can not be solved without running a computer continuously for at least a certain amount of time, and use trusted agents who promise not to reveal certain information until a specified date.