Infinite randomness expansion with a constant number of devices
- 31 May 2014
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the forty-sixth annual ACM symposium on Theory of computing
- p. 427-436
- https://doi.org/10.1145/2591796.2591873
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Infinite randomness expansion with a constant number of devicesPublished by Association for Computing Machinery (ACM) ,2014
- Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devicesPublished by Association for Computing Machinery (ACM) ,2014
- Security and composability of randomness expansion from Bell inequalitiesPhysical Review A, 2013
- Robust Randomness Amplifiers: Upper and Lower BoundsLecture Notes in Computer Science, 2013
- Robust self-testing of the singletJournal of Physics A: Mathematical and Theoretical, 2012
- Certifiable quantum dicePublished by Association for Computing Machinery (ACM) ,2012
- Trevisan's Extractor in the Presence of Quantum Side InformationSIAM Journal on Computing, 2012
- Private randomness expansion with untrusted devicesJournal of Physics A: Mathematical and Theoretical, 2011
- SECURITY OF QUANTUM KEY DISTRIBUTIONInternational Journal of Quantum Information, 2008
- Experimental consequences of objective local theoriesPhysical Review D, 1974