Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Serving Verifiable, Device-Independent Randomness to the Public

Gautam A. Kavuri, Jasper Palfree, Yanbao Zhang, Joshua C. Bienfang, Morgan W. Mitchell, Michael D. Mazurek, Martin J. Stevens, Emanuel H. Knill, Richard P. Mirin, Sae Woo Nam, Lynden K. Shalm

Published Jan 1, 2023• 0 citations
Publisher

Abstract

Device-independent random number generators can be certified unhackable simply by the impossibility of superluminal signaling. We demonstrate a novel protocol to transparently operationalize this security through a public randomness beacon service.
DOI
10.1364/cleo_at.2023.am3n.3

Related papers

Traceable Device-Independent Randomness as a Service

Gautam A. Kavuri, Jasper Palfree, Dileep V. Reddy +10 more

We implement a traceable protocol for device-independent random number generation. Our demonstration involves transparently integrating a device-independent RNG into a public randomness beacon, and feeding 7434 random number pulses into the beacon over 39 days.

Quantum 2.0 Conference and Exhibition•Jan 1, 2024•0 citations

A publicly verifiable protocol for random number generation

João Penna, Jeroen van de Graaf

Chance plays an essential role in many decision procedures such as lotteries, draws etc. As such procedures are moving on-line, several web services offering randomness have appeared over the last few years. NIST’s randomness beacon, which publishes a sequence of 512 random bytes every minute, unfortunately lacks transparency: the beacon does not eliminate the possibility of an insider attack who knows the outcomes beforehand. We propose an improvement of NIST’s 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. Our proposal is based on a novel cryptographic assumption: the existence of functions that are slow to compute even on the fastest supercomputers.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Nov 6, 2017•0 citations

Experimentally generated randomness certified by the impossibility of superluminal signals

Peter Bierhorst, Emanuel Knill, Scott Glancy +9 more

arXiv:1803.06219•Nature•Mar 31, 2018•181 citations

A trustless decentralized protocol for distributed consensus of public quantum random numbers

Lac Nguyen, Jeevanandha Ramanathan, Wang, Michelle Mei +2 more

Quantum random number (QRNG) beacons distinguish themselves from classical counterparts by providing intrinsic unpredictability originating from the fundamental laws of quantum mechanics. Most demonstrations have focused on certifiable randomness generators to guarantee the public that their genuineness is independent from imperfect implementations. These efforts however do not benefit applications where multiple distrusted users need a common set of random numbers, as they must rely on the honesty of beacon owners. In this paper, we formally introduce a design and proof-of-principle experiment of the first consensus protocol producing QRNs in a decentralized environment (dQRNG). Such protocol allows N number of participants contribute in the generation process and publicly verify numbers they collect. Security of the protocol is guaranteed given(N-1) dishonest participants. Our method is thus suited for distribute systems that requires a bias-resistant, highly secure, and public-verifiable random beacon.

arXiv:2108.12038•Jan 1, 2021•2 citations

Device-independent randomness certification using multiple copies of entangled states

Shyam Sundar Mahato, A. K. Pan

arXiv:2212.14341•Physics Letters A•Nov 4, 2022•8 citations

Certified Quantum Randomness

Stefano Pironio

I explain how the non-local correlations of entangled states can be used to design conceptually new random number generators whose randomness can be certified without any detailed assumptions about their internal working.

Conference on Lasers and Electro-Optics•Jan 1, 2012•2 citations
Chance plays an essential role in many decision procedures such as lotteries, draws etc. As such procedures are moving on-line, several web services offering randomness have appeared over the last few years. NIST’s randomness beacon, which publishes a sequence of 512 random bytes every minute, unfortunately lacks transparency: the beacon does not eliminate the possibility of an insider attack who knows the outcomes beforehand. We propose an improvement of NIST’s 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. Our proposal is based on a novel cryptographic assumption: the existence of functions that are slow to compute even on the fastest supercomputers.
Quantum random number (QRNG) beacons distinguish themselves from classical counterparts by providing intrinsic unpredictability originating from the fundamental laws of quantum mechanics. Most demonstrations have focused on certifiable randomness generators to guarantee the public that their genuineness is independent from imperfect implementations. These efforts however do not benefit applications where multiple distrusted users need a common set of random numbers, as they must rely on the honesty of beacon owners. In this paper, we formally introduce a design and proof-of-principle experiment of the first consensus protocol producing QRNs in a decentralized environment (dQRNG). Such protocol allows N number of participants contribute in the generation process and publicly verify numbers they collect. Security of the protocol is guaranteed given(N-1) dishonest participants. Our method is thus suited for distribute systems that requires a bias-resistant, highly secure, and public-verifiable random beacon.