Quantum public-key signature scheme based on asymmetric quantum encryption with trapdoor information
- PDF / 1,019,008 Bytes
- 15 Pages / 439.37 x 666.142 pts Page_size
- 62 Downloads / 233 Views
Quantum public‑key signature scheme based on asymmetric quantum encryption with trapdoor information Xiangjun Xin1 · Qinglan Yang2 · Fagen Li3 Received: 5 December 2019 / Accepted: 20 June 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Based on the quantum asymmetric encryption with trapdoor information, a quantum public-key signature scheme is proposed. In our scheme, the signer signs a message with his/her private key, while the verifier verifies the quantum signature with the corresponding quantum public key. The signer’s private key and public key are asymmetric, and the signing algorithm and verifying algorithm are asymmetric as well. The security of the private key depends on the unconditionally secure deterministic quantum communication protocol rather than the classical one-way function. All the algorithms in our scheme are public. Hence, our scheme obeys Kerckhoffs’s principle. Our scheme is secure against forgery, repudiation, and eavesdropping attacks. On the other hand, in our scheme, the verifier need not perform any quantum swap test. The signer’s key pair can be reused due to the secrecy property of the private key. Compared with similar schemes, ours is relatively more secure and efficient. Keywords Quantum signature · Public key · Trapdoor · Kerckhoffs’s principle
1 Introduction In 1976, the concept of public-key digital signature was introduced [1]. In a publickey digital signature scheme, the signer signs a message with his/her private key, and the verifier verifies the signed message with the corresponding public key. By * Xiangjun Xin [email protected] 1
School of Mathematics and Information Science, Zhengzhou University of Light Industry, Zhengzhou 450002, China
2
Library, Zhengzhou University of Light Industry, Zhengzhou 450002, China
3
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
13
Vol.:(0123456789)
233
Page 2 of 15
X. Xin et al.
verifying the validity of the signature, the verifier can authenticate the message sources and check the integrity of the received messages. Digital signature schemes have important application value in e-commerce and information security. In the past decade, many classical digital signature schemes have been proposed. In general, the security of the conventional digital signature schemes relies on some unproved mathematical problems such as factoring and discrete logarithm. However, Shor et al. demonstrated that all of these mathematical problems can be solved by the polynomial quantum algorithms [2–4]. This means that most of the classical digital signature schemes may be vulnerable to quantum adversary. In 2001, Gottesman and Chuang presented the first quantum public-key digital signature scheme [5], which can be proved to be unconditional secure against the forger with unlimited computing sources. However, their quantum public-key digital signature was impracticable, since the signer’s public key can only be used once time
Data Loading...
