Research ArticleOpen AccessGoogle Scholar indexed

Quantum Group Signature Scheme Based on Chinese Remainder Theorem

¹ School of Information Science & Engineering, Central South University, Changsha, China
² School of Information Science & Engineering, Central South University, Changsha, China
³ School of Information Science & Engineering, Central South University, Changsha, China
⁴ School of Information Science & Engineering, Central South University, Changsha, China
⁵ School of Information Science & Engineering, Central South University, Changsha, China
⁶ Institute of Information and Communication, Chonbuk National University, Chonju, Korea

Journal of Software Engineering and Applications·Volume 06 (2013)·Pages 16–20·Published 30 May 2013·DOI10.4236/jsea.2013.65B004

Abstract

A novel quantum group signature scheme is proposed based on Chinese Remainder Theorem (CRT), in order to improve the security of quantum signature. The generation and verification of the signature can be successfully conducted only if all the participants cooperate with each other and with the message owner's and the arbitrator's help. The quantum parallel algorithm is applied to efficiently compare the restored quantum message to the original quantum message. All the operations in signing and verifying phase can be executed in quantum circuits. It has a wide application to E-payment system, Online contract, Online notarization and etc.

KeywordsQuantum SignatureGroup SignatureChinese Remainder Theorem

S. William, “Cryptography and Network Security, Prin-ciples and Practice,” 2nd Edition,Prentice Hall, New Jersey, 2003.
D. Chaum and E. V. Heyst, “Group Signatures,” Lecture Notes in Computer Science , Vol. 547, 1991, pp. 257-265. doi:10.1007/3-540-46416-6_22
J. Camenisch and M. Stadler, “Efficient Group Signature Schemes for Large Groups,” Berlin, Springer 1296, 1997, pp. 410-424.
E. Bresson and J. Stem, “Efficient Revo-cation in Group Signature,” Proceeding of PKC01 LNCS 1992 , Berlin, Springer, 2001, pp. 190-206.
G. Ate-niese, J. Camenisch and M. Joye, “A Practical and Provably Secure Coalition-resistant Group Signature Scheme,” Advances in Cryptology-Crypto2000 LNCS1880 , 2000, pp. 255-270.
N. Gisin, G. Ribordy, W. Tittel and H. Zbinden, “Quantum Cryptography,” Reviews of Modern Physics , Vol. 74, No. 145, 2002. doi:10.1103/RevM5odPhys.74.14
C. H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” Proceeding of IEEE International Conference on Computers Systems , 1984, pp. 175-179.
A. K. Ekert, “Quantum Cryptography Based on Bells Theorem,” Physical Review Letters , Vol. 67, 1991, pp. 661-663. doi:10.1103/PhysRevLett.67.661
N. R Zhou, L. J Wang, L. H Gong, X. W. Zuo and Y. Liu, “Quantum Deterministic Key Distribution Protocols Based on Teleportation and Entanglement Swapping,” Optics Communication , Vol. 284, 2011, pp. 4836-4842.
C. H. Bennett, “Quantum Cryptography Using any Two Nonorthogonal States,” Physical Review .
R. Cleve, D.Gottesman and H. K. Lo, “How to Share a Quantum Secret,” Physical Review Letters , Vol. 83, 1999, pp. 648-651. doi:10.1103/PhysRevLett.83.648
M. Hillery, V. Buzek and A. Berthiaume, “Quantum Secret Sharing,” Physics Review A , Vol. 59, 1999, pp. 1829-1834. doi:10.1103/PhysRevA.59.1829
A. Karlsson, M. Koashi and N. Imoto, “Quantum Entanglement for Secret Sharing and Secret Splitting,” Physical Review A , Vol. 59, 1999, pp. 162-168. doi:10.1103/PhysRevA.59.162
G. L. Long and X. S. Liu, “Theoretically Efficient High-capacity Quan-tum-key-distribution Scheme,” Physical Review A , Vol. 65, 2002, pp 1-3.
G. H. Zeng and C. H. Keitel, “Arbitrated Quantum Signature Scheme,” Physical Review A , Vol. 65, 2002, pp. 1-6.

Menu

Menu

Menu

Quantum Group Signature Scheme Based on Chinese Remainder Theorem

Abstract

References (35)