Cryptography In the Bounded Quantum-Storage Model
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory, whereas an adversarial player needs quantum memory of size at least n/2 in order to break the protocol, where n is the number of qubits transmitted. This is in sharp contrast to the classical bounded-memory model, where we can only tolerate adversaries with memory of size quadratic in honest players' memory size. Our protocols are efficient, non-interactive and can be implemented using today's technology. On the technical side, a new entropic uncertainty relation involving min-entropy is established.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
The Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Cited by
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
Security of quantum key distribution
Renner, R. (2005) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005115027 · Cited by 263
Quantum computing on encrypted data
Fisher, K. A. G., Broadbent, A., Shalm, L. K., Yan, Z., Lavoie, J., Prevedel, R., Jennewein, T., & Resch, K. J. (2014) · Nature Communications · doi:10.1038/ncomms4074 · Cited by 157
The Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Metadata
- Authors
- Damgard, I. B., Fehr, S., Salvail, L., & Schaffner, C.
- Venue
- 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
- Publisher
- IEEE
- Published
- 2005-11-15
- Pages
- 449-458
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2560971747
- Cited by
- 120
- References
- 7
- FWCI
- 6.68
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Cryptography In the Bounded Quantum-Storage Model. https://app.cochat.ai/papers/10.1109/sfcs.2005.30
- The paper
- Damgard, I. B., Fehr, S., Salvail, L., & Schaffner, C. (2005). Cryptography In the Bounded Quantum-Storage Model. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). https://doi.org/10.1109/sfcs.2005.30
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.