Simple quantum password checking
arXiv:1501.02622 · doi:10.1103/PhysRevA.91.062310
Abstract
We present a quantum password checking protocol where secrecy is protected by the laws of quantum mechanics. The passwords are encoded in quantum systems that can be compared but have a dimension too small to allow reading the encoded bits. We study the protocol under different replay attacks and show it is robust even for poorly chosen passwords.
arXiv comment5 pages. Comments welcome
References in corpus (17)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Random Numbers Certified by Bell's Theorem
- Quantum fingerprinting
- Authentication of Quantum Messages
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- Quantum identification system
- Applications of single-qubit rotations in quantum public-key cryptography
- Optimal lower bounds for quantum automata and random access codes
- A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
- Quantum Key Distribution and Quantum Authentication Based on Entangled State
- Coin Tossing is Strictly Weaker Than Bit Commitment
- Extremal equation for optimal completely-positive maps
- Hiding Single Photons With Spread Spectrum Technology
- Deterministic quantum-public-key encryption: forward search attack and randomization
- Quantum secure identification using entanglement and catalysis
- Detecting drift of quantum sources: not the de Finetti theorem
- Experimental demonstration of a time-domain multidimensional quantum channel