A public randomness service

@article{Fischer2011APR,
  title={A public randomness service},
  author={Michael J. Fischer and Michaela Iorga and Ren{\'e} Peralta},
  journal={Proceedings of the International Conference on Security and Cryptography},
  year={2011},
  pages={434-438}
}
  • M. Fischer, M. Iorga, R. Peralta
  • Published 18 July 2011
  • Computer Science
  • Proceedings of the International Conference on Security and Cryptography
We argue that it is time to design, implement, and deploy a trusted public randomness server on the Internet. NIST plans to deploy a prototype during 2011. We discuss some of the engineering choices that have been made as well as some of the issues currently under discussion. 

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
TLDR
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.

Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness

TLDR
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.

Improvement on Bitcoin’s Verifiable Public Randomness with Semi-Trusted Delegates

TLDR
It is argued that a successful attack against this scheme to impose a bias on a single bit of the output randomness requires not only a significant financial cost but also a corruption of more than k out of n trusted delegates.

Secure sealed-bid online auctions using discreet cryptographic proofs

MPC for Group Reconstruction Circuits

In this work, we generalize threshold Schnorr signatures, ElGamal encryption, and a wide variety of other functionalities, using a novel formalism of group reconstruction circuits (GRC)s. We

A simple low-latency real-time certifiable quantum random number generator

TLDR
Low-latency real-time randomness generation from measurements on photonic time-bin states is shown and can be run continuously and is thus well suited as a quantum randomness beacon.

Breeding unicorns: Developing trustworthy and scalable randomness beacons

TLDR
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.

RandomBlocks: A Transparent, Verifiable Blockchain-based System for Random Numbers

TLDR
This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of designing and testing web-based systems.

Experimentally generated randomness certified by the impossibility of superluminal signals

TLDR
1,024 random bits that are uniformly distributed to within 10−12 and unpredictable assuming the impossibility of superluminal communication are generated and certified using a loophole-free Bell test and a protocol is described that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities.

E-BOOT: Preventing Boot-Time Entropy Starvation in Cloud Systems

TLDR
E-Boot is the first technique that completely satisfies the entropy demand of virtualized boot- loaders and operating systems at boot time, and successfully feeds bootloaders and boot time Linux kernel hardening techniques with high-quality random numbers, reducing also to zero the number of userspace blocks and delays.

References

SHOWING 1-10 OF 28 REFERENCES

Minimum Disclosure Proofs of Knowledge

Probabilistic Encryption

A Provably Secure Oblivious Transfer Protocol

TLDR
This work presents an implementation of the Oblivious Transfer which it believes will simplify the development of secure cryptographic protocols and is provably secure under the assumptions that factoring is hard and that the message is chosen at random from a large message space.

A Provably Secure Oblivious Transfer Protocol

  • Bcrgcr
  • Computer Science, Mathematics
  • 2002
TLDR
This work presents an implementation of the Oblivious Transfer which it believes will simplify the development of secure cryptographic protocols and is provably secure under the assumptions that factoring is hard and that the message is chosen at random from a large message space.

Transaction Protection by Beacons

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

A secure protocol for the oblivious transfer (extended abstract)

TLDR
A new protocol for the oblivious transfer is presented, similar to Rabin's, but the potential flaw in his protocol is fixed so that it is possible to prove that the protocol works, subject only to the assumption about the difficulty of factoring.

Zero-Knowledge Simulation of Boolean Circuits

A zero-knowledge interactive proof is a protocol by which Alice can convince a polynomially-bounded Bob of the truth of some theorem without giving him any hint as to how the proof might proceed.

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs

How to generate cryptographically strong sequences of pseudo random bits

  • M. BlumS. Micali
  • Computer Science, Mathematics
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
TLDR
A more operative definition of Randomness should be pursued in the light of modern Complexity Theory.

On the communication complexity of zero-knowledge proofs

TLDR
This paper studies the concrete complexity of the known general methods for constructing zero-knowledge proofs, and establishes that circuit-based methods, which can be applied in either the GMR or the BCC model, have the potential of producing proofs which could be used in practice.