Cryptography from Noisy Storage

Abstract

We show how to implement cryptographic primitives based on the realistic assumption that quantum storage of qubits is noisy. We thereby consider individual-storage attacks, i.e. the dishonest party attempts to store each incoming qubit separately. Our model is similar to the model of bounded-quantum storage, however, we consider an explicit noise model inspired by present-day technology. To illustrate the power of this new model, we show that a protocol for oblivious transfer (OT) is secure for any amount of quantum-storage noise, as long as honest players can perform perfect quantum operations. Our model also allows the security of protocols that cope with noise in the operations of the honest players and achieve more advanced tasks such as secure identification.

13 pages RevTex, 2 figures. v2: more comments on implementation dependent attacks, v3: published version (minor changes)

References in corpus (6)

• Quantum Cryptography
• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Insecurity of Quantum Secure Computations
• Reversible state transfer between light and a single trapped atom
• Security of quantum bit string commitment depends on the information measure

Cited by in corpus (76)

• The Security of Practical Quantum Key Distribution
• Advances in Quantum Cryptography
• Secure quantum key distribution with realistic devices
• The operational meaning of min- and max-entropy
• Entropic Uncertainty Relations and their Applications
• Security in Quantum Cryptography
• Entropic uncertainty relations - A survey
• A Link Layer Protocol for Quantum Networks
• Quantum Cryptography Beyond Quantum Key Distribution
• Experimental demonstration of Gaussian protocols for one-sided device-independent quantum key distribution
• Quantum Communication Using Semiconductor Quantum Dots
• Quantum dots for photonic quantum information technology
• Unconditional security from noisy quantum storage
• Universal Uncertainty Relations
• A lower bound on the dimension of a quantum system given measured data
• Designing a Quantum Network Protocol
• Universal Blind Quantum Computing with Weak Coherent Pulses
• Entanglement sampling and applications
• A strong converse for classical channel coding using entangled inputs
• Entanglement Cost of Quantum Channels
• Experimental implementation of bit commitment in the noisy-storage model
• An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
• Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment
• Experimental plug&play quantum coin flipping
• Sampling of min-entropy relative to quantum knowledge
• A min-entropy uncertainty relation for finite size cryptography
• Device-independent quantum key distribution secure against adversaries with no long-term quantum memory
• Entropic uncertainty from effective anti-commutators
• Implementation of two-party protocols in the noisy-storage model
• Practical relativistic bit commitment
• Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model
• Secure bit commitment from relativistic constraints
• Device-independent two-party cryptography secure against sequential attacks
• Continuous-Variable Protocol for Oblivious Transfer in the Noisy-Storage Model
• 24-Hour Relativistic Bit Commitment
• Quantum to Classical Randomness Extractors
• Device-independence for two-party cryptography and position verification
• Arbitrarily long relativistic bit commitment
• Noise and measurement errors in a practical two-state quantum bit commitment protocol
• A device-independent protocol for XOR oblivious transfer
• Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• Using post-measurement information in state discrimination
• Continuous-variable quantum communication
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Optimal realistic attacks in continuous-variable quantum key distribution
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Quantum cryptography beyond key distribution: theory and experiment
• A transform of complementary aspects with applications to entropic uncertainty relations
• Oblivious transfer based on quantum state computational distinguishability
• Achieving the physical limits of the bounded-storage model
• Building one-time memories from isolated qubits
• Strong connections between quantum encodings, non-locality and quantum cryptography
• Entanglement witness and entropy uncertainty of open Quantum systems under Zeno effect
• Hiding Ignorance Using High Dimensions
• Single-shot security for one-time memories in the isolated qubits model
• Security of two-state and four-state practical quantum bit-commitment protocols
• Oblivious transfer based on single-qubit rotations
• Towards Quantum One-Time Memories from Stateless Hardware
• Improved Loss-Tolerant Quantum Coin Flipping
• Error-tolerant oblivious transfer in the noisy-storage model
• Practical quantum oblivious transfer with a single photon
• Uncertainty relations for multiple measurements with applications
• Hacking coherent-one-way quantum key distribution with present-day technology
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Robust Cryptography in the Noisy-Quantum-Storage Model
• Erasable Bit Commitment from Temporary Quantum Trust
• Cryptographic Protocols under Quantum Attacks
• Quantum One-Time Memories from Stateless Hardware
• Quantum-secure multiparty deep learning
• Experimental investigation of majorization uncertainty relations in the high-dimensional systems
• Optimal bounds for semi-honest quantum oblivious transfer
• Hybrid Quantum Cryptography from Communication Complexity
• Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
• Experimental testing of entropic uncertainty relations with multiple measurements in pure diamond
• Quantum oblivious transfer: a short review