Certification of randomness without seed randomness
Shubhayan Sarkar

TL;DR
This paper introduces a novel one-sided device-independent method to certify two bits of randomness without requiring seed randomness, leveraging quantum networks with shared entanglement and trusted measurements.
Contribution
It presents the first scheme to certify randomness without seed randomness using quantum networks with no inputs and a trusted party.
Findings
Certifies two bits of randomness without seed randomness.
Certifies maximally entangled states and Bell basis measurements.
Utilizes quantum networks with no inputs and shared sources.
Abstract
The security of any cryptographic scheme relies on access to random number generators. Device-independently certified random number generators provide maximum security as one can discard the presence of an intruder by considering only the statistics generated by these devices. Any of the known device-independent schemes to certify randomness require an initial feed of randomness into the devices, which can be called seed randomness. In this work, we propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness. For our purpose, we utilise the framework of quantum networks with no inputs and two independent sources shared among two parties with one of them being trusted. Along with it, we also certify the maximally entangled state and the Bell basis measurement with the untrusted party which is then used to certify the randomness…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
