The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Private randomness expansion with untrusted devices
Open accessAbstract
Randomness is an important resource for many applications, from gambling to secure communication. However, guaranteeing that the output from a candidate random source could not have been predicted by an outside party is a challenging task, and many supposedly random sources used today provide no such guarantee. Quantum solutions to this problem exist, for example a device which internally sends a photon through a beam-splitter and observes on which side it emerges, but, presently, such solutions require the user to trust the internal workings of the device. Here we seek to go beyond this limitation by asking whether randomness can be generated using untrusted devices---even ones created by an adversarial agent---while providing a guarantee that no outside party (including the agent) can predict it. Since this is easily seen to be impossible unless the user has an initially private random string, the task we investigate here is private randomness expansion. We introduce a protocol for private randomness expansion with untrusted devices which is designed to take as input an initially private random string and produce as output a longer private random string. We point out that private randomness expansion protocols are generally vulnerable to attacks that can render the initial string partially insecure, even though that string is used only inside a secure laboratory; our protocol is designed to remove this previously unconsidered vulnerability by privacy amplification. We also discuss extensions of our protocol designed to generate an arbitrarily long random string from a finite initially private random string. The security of these protocols against the most general attacks is left as an open question.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Device-independent security of quantum cryptography against collective attacks
Acín, A., Brunner, N., Gisin, N., Massar, S., Pironio, S., & Scarani, V. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.230501 · Cited by 1,537
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Greenberger, D. M., Horne, M. A., & Zeilinger, A. (1989) · Bell’s Theorem, Quantum Theory and Conceptions of the Universe · doi:10.1007/978-94-017-0849-4_10 · Cited by 1,513
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
No Signaling and Quantum Key Distribution
Barrett, J., Hardy, L., & Kent, A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010503 · Cited by 918
Self-citation
Research works printed but not linked: 6
- Hänggi E Renner R Wolf S Gilbert H, 2010, Proc. 29th Annu. Int. Conf. on the Theory and Applications of Cryptographic Techniques, Eurocrypt’10, 216
- Bennett C H Brassard G, 1984, Proc. IEEE Int. Conf. on Computers, Systems and Signal Processing, 175
- Impagliazzo R, 1989, Proc. 21st Annu. ACM Symp. on Theory of Computing, 12
- Renner R, Theory of Cryptography, 407
- Tomamichel M Renner R Schaffner C Smith A, 2010, Proc. IEEE Int. Symp. on Information Theory, 2703
- Cirel'son B, 1993, Hadronic J. Suppl., 8, 329
Cited by
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., & Wehner, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.419 · Cited by 2,688
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Self-citationScarani, V. (2019) · doi:10.1093/oso/9780198788416.001.0001 · Cited by 605
Detection-Loophole-Free Test of Quantum Nonlocality, and Applications
Christensen, B. G., McCusker, K. T., Altepeter, J. B., Calkins, B., Gerrits, T., Lita, A. E., Miller, A., Shalm, L. K., Zhang, Y., Nam, S. W., et al. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.130406 · Cited by 477
Quantum random number generation
Ma, X., Yuan, X., Cao, Z., Qi, B., & Zhang, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.21 · Cited by 445
Metadata
- Authors
- Colbeck, R., & Kent, A.
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2011-02-10
- Volume
- 44
- Issue
- 9
- Pages
- 095305
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W2084499569
- Cited by
- 333
- References
- 26
- FWCI
- 19.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Private randomness expansion with untrusted devices. https://app.cochat.ai/papers/10.1088/1751-8113/44/9/095305
- The paper
- Colbeck, R., & Kent, A. (2011). Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and Theoretical. https://doi.org/10.1088/1751-8113/44/9/095305
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.