An arbitrated quantum message signature scheme

Authors:
Xin Lü;Deng-Guo Feng
Affiliations:
State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences), Beijing, P.R. China;State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences), Beijing, P.R. China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 6
Cited 1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Review
Unconditional security in quantum cryptography

Journal of the ACM (JACM)
Quantum computation and quantum information

Quantum computation and quantum information
Authentication of Quantum Messages

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Cryptography 2000±10

Informatics - 10 Years Back. 10 Years Ahead.
Conjugate coding

ACM SIGACT News - A special issue on cryptography

Attack and improvements of fair quantum blind signature schemes

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital signature is an important task in modern cryptography, which concerns about authenticity, integrity and non-repudiation of data on communication channel. In this paper, an arbitrated quantum digital signature scheme is proposed, in which the receiver verifies the signature with the help of an arbitrator. The most important property of the proposed scheme is that it can sign unknown quantum states. The security of the protocol relies on the quantum one-time-pad and the Greenberger-Horne-Zeilinger (GHZ) triplet particles distributed among communication entities. Security analysis shows that the proposed quantum signature is a secure scheme.