Access the full text.
Sign up today, get DeepDyve free for 14 days.
JW Choi, KY Chang, D Hong (2011)
Security problem on arbitrated quantum signature schemesPhys. Rev. A, 84
XF Zou, DW Qiu (2010)
Security analysis and improvements of arbitrated quantum signature schemesPhys. Rev. A, 82
Q Li, CQ Li, ZH Wen (2013)
On the security of arbitrated quantum signature schemesJ. Phys. A Math. Theor., 46
WY Hwang (2003)
Quantum key distribution with high loss: toward global secure communicationPhys. Rev. Lett., 91
DW Leung (2002)
Quantum vernam cipherQuantum Inf. Comput., 2
GH Zeng, CH Keitel (2002)
Arbitrated quantum-signature schemePhys. Rev. A, 65
GH Zeng (2008)
Reply to Comment on “Arbitrated quantum-signature scheme”Phys. Rev. A, 78
HK Lo, HF Chau (1999)
Unconditional security of quantum key distribution over arbitrarily long distancesScience, 283
Q Li, CQ Li, DY Long (2013)
Efficient arbitrated quantum signature and its proof of securityQuantum Inf. Process., 12
Q Li, WH Chan, DY Long (2009)
Arbitrated quantum signature scheme using Bell statesPhys. Rev. A, 79
KJ Zhang, SJ Qin, Y Sun (2013)
Reexamination of arbitrated quantum signature: the impossible and the possibleQuantum Inf. Process., 12
MA Nielsen, IL Chuang (2008)
Quantum Computation and Quantum Information
KJ Zhang, WW Zhang, D Li (2013)
Improving the security of arbitrated quantum signature against the forgery attackQuantum Inf. Process., 12
PW Shor, J Preskill (2000)
Simple proof of security of the BB84 quantum key distribution protocolPhys. Rev. Lett., 85
T Hwang, YP Luo, SK Chong (2012)
Comment on “Security analysis and improvements of arbitrated quantum signature schemes”Phys. Rev. A, 85
Q Li, RG Du, DY Long, CJ Wang, WH Chan (2009)
Entanglement enhances the security of arbitrated quantum signatureInt. J. Quantum Inf., 7
H Buhrman, R Cleve, J Watrous (2001)
Quantum fingerprintingPhys. Rev. Lett., 87
CH Bennett (1992)
Quantum cryptography using any two nonorthogonal statesPhys. Rev. Lett., 68
A Banerjee, A Pathak (2012)
Maximally efficient protocols for direct secure quantum communicationPhys. Lett. A, 376
Marcos Curty, Norbert Ltkenhaus (2008)
Comment on “Arbitrated quantum-signature scheme”Phys. Rev. A, 77
F Gao, SJ Qin, FZ Guo (2011)
Cryptanalysis of the arbitrated quantum signature protocolsPhys. Rev. A, 84
Existing arbitrated quantum signature (AQS) schemes are almost all based on the Leung quantum one-time pad (L-QOTP) algorithm. In these schemes, the receiver can achieve an existential forgery of the sender’s signatures under the known message attack, and the sender can successfully disavow any of her/his signatures by a simple attack. In this paper, a solution of solving the problems is given, through designing a new QOTP algorithm relying largely on inserting decoy states into fixed insertion positions. Furthermore, we present an AQS scheme with fast signing and verifying, which is based on the new QOTP algorithm. It is just using single particle states and is unconditional secure. To fulfill the functions of AQS schemes, our scheme needs a significantly lower computational costs than that required by other AQS schemes based on the L-QOTP algorithm.
Quantum Information Processing – Springer Journals
Published: Nov 7, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.