Secure Identification and QKD in the Bounded-Quantum-Storage Model
From MaRDI portal
Abstract: We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w as possible, namely the adversary can exclude at most one possible password for each execution of the scheme. We propose a solution in the bounded-quantum-storage model, where U and S may exchange qubits, and a dishonest party is assumed to have limited quantum memory. No other restriction is posed upon the adversary. An improved version of the proposed identification scheme is also secure against a man-in-the-middle attack, but requires U and S to additionally share a high-entropy key k. However, security is still guaranteed if one party loses k to the attacker but notices the loss. In both versions of the scheme, the honest participants need no quantum memory, and noise and imperfect quantum sources can be tolerated. The schemes compose sequentially, and w and k can securely be re-used. A small modification to the identification scheme results in a quantum-key-distribution (QKD) scheme, secure in the bounded-quantum-storage model, with the same re-usability properties of the keys, and without assuming authenticated channels. This is in sharp contrast to known QKD schemes (with unbounded adversary) without authenticated channels, where authentication keys must be updated, and unsuccessful executions can cause the parties to run out of keys.
Recommendations
- Secure identification and QKD in the bounded-quantum-storage model
- Quantum identification protocol with technologically bounded parties
- Cryptography in the Bounded-Quantum-Storage Model
- Secure Authentication from a Weak Key, without Leaking Information
- Unconditionally-secure and reusable public-key authentication
Cited in
(18)- Quantum identification protocol with technologically bounded parties
- scientific article; zbMATH DE number 6492475 (Why is no real title available?)
- Multi-party quantum private comparison protocol with \(n\)-level entangled states
- scientific article; zbMATH DE number 1676638 (Why is no real title available?)
- Preface
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- Semi-quantum cryptography
- Preface
- Public-key cryptography based on bounded quantum reference frames
- Secure identification and QKD in the bounded-quantum-storage model
- Unconditionally-secure and reusable public-key authentication
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Quantum cryptography beyond quantum key distribution
- Quantum cryptography
- Memory-sample lower bounds for learning with classical-quantum hybrid memory
- Fully simulatable quantum-secure coin-flipping and applications
- An all-but-one entropic uncertainty relation, and application to password-based identification
- scientific article; zbMATH DE number 7071497 (Why is no real title available?)
This page was built for publication: Secure Identification and QKD in the Bounded-Quantum-Storage Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612558)
