An arbitrated quantum signature scheme with fast signing and verifying
- 261 Downloads
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.
KeywordsArbitrated quantum signature (AQS) Quantum one-time pad (QOTP) Decoy state
This work is supported by NSFC (Grant Nos. 61272057, 61202434, 61170270, 61100203, 61003286, 61121061), NCET (Grant No. NCET-10-0260), Beijing Natural Science Foundation (Grant Nos. 4112040, 4122054), the Fundamental Research Funds for the Central Universities (Grant No. 2012RC0612, 2011YB01).
- 1.Gottesman, D., Chuang, I.L.: Quantum digital signatures. e-print arXiv:quant-ph/0105032Google Scholar
- 2.Barnum, H., Crépeau, C., Gottesman, D., et al.: Authentication of quantum messages. In: Proceedings of the 43rd Annual IEEE Symposium on the Foundations of Computer Science, 449. IEEE Computer Society Press, Washington, DC (2002) e-print arXiv:quant-ph/0205128Google Scholar
- 17.Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, p. 175. IEEE, New York (1984)Google Scholar