Miller, C.
(2017),
An Elementary Proof of Private Random Number Generation from Bell Inequalities, arXiv e-Print archive, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=923946, https://arxiv.org/abs/1707.06597
(Accessed January 2, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
An Elementary Proof of Private Random Number Generation from Bell Inequalities
Published
Author(s)
Abstract
The field of device-independent quantum cryptography has seen enormous success in the past several years, including security proofs for key distribution and random number generation that account for arbitrary imperfections in the devices used. Full security proofs in the field so far are long and technically deep. In this paper we show that the concept of the mirror adversary can be used to simplify device-independent proofs. We give a short proof that any bipartite Bell violation can be used to generate private random numbers. The proof is based on elementary techniques and is self-contained.Citation
arXiv e-Print archive
Pub Weblink
Pub Type
Websites
Download Paper
Keywords
quantum cryptography, multiplayer games, nonlocality
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 20, 2017, Updated May 1, 2019