Continuous-variable quantum digital signatures over insecure channels
- 25 March 2019
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 99 (3) , 032341
Abstract
Digital signatures ensure the integrity of a classical message and the authenticity of its sender. Despite their far-reaching use in modern communication, currently used signature schemes rely on computational assumptions and will be rendered insecure by a quantum computer. We present a quantum digital signatures (QDS) scheme whose security is instead based on the impossibility of perfectly and deterministically distinguishing between quantum states. Our continuous-variable (CV) scheme relies on phase measurement of a distributed alphabet of coherent states and allows for secure message authentication against a quantum adversary performing collective beamsplitter and entangling-cloner attacks. Crucially, in the CV setting we allow for an eavesdropper on the quantum channels and yet retain shorter signature lengths than previous protocols with no eavesdropper. This opens up the possibility to implement CV QDS alongside existing CV quantum key distribution platforms with minimal modification.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Gaussian quantum informationReviews of Modern Physics, 2012
- Experimental demonstration of quantum digital signatures using phase-encoded coherent states of lightNature Communications, 2012
- Asymptotic security of binary modulated continuous-variable quantum key distribution under collective attacksPhysical Review A, 2009
- Unconditional Optimality of Gaussian Attacks against Continuous-Variable Quantum Key DistributionPhysical Review Letters, 2006
- Optimality of Gaussian Attacks in Continuous-Variable Quantum CryptographyPhysical Review Letters, 2006
- Experimentally realizable quantum comparison of coherent states and its applicationsPhysical Review A, 2006
- Quantum key distribution using gaussian-modulated coherent statesNature, 2003
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963