ArticlePublisher preview available

Secure quantum signature scheme without entangled state

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

The security of most quantum signatures cannot be proved with security model under chosen-message attack. No formal proof can prove that their security is fully dependent on the basic quantum theory. Based on the orthogonal quantum state and key-controlled quantum hash function, an arbitrated quantum signature is proposed. In this scheme, the signatory produces the quantum signature by quantum-encrypting the output of key-controlled quantum hash function. The signature verification is performed by decrypting the signed message and comparing the decrypted message with the output of the key-controlled quantum hash function. The security of the proposed scheme depends on the indistinguishability of the unknown quantum sequence. Its unforgeability can be formally proved with security model under chosen-message attack. Therefore, its security can be supported by the formal proof. On the other hand, in the proposed scheme, no entangled state is used. It also has better qubit efficiency as well.
Quantum Information Processing (2024) 23:49
https://doi.org/10.1007/s11128-024-04257-5
Secure quantum signature scheme without entangled state
Tianyuan Zhang1·Xiangjun Xin1·Lei Sun2·Chaoyang Li1·Fagen Li3
Received: 26 June 2023 / Accepted: 1 January 2024 / Published online: 6 February 2024
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024
Abstract
The security of most quantum signatures cannot be proved with security model under
chosen-message attack. No formal proof can prove that their security is fully dependent
on the basic quantum theory. Based on the orthogonal quantum state and key-controlled
quantum hash function, an arbitrated quantum signature is proposed. In this scheme,
the signatory produces the quantum signature by quantum-encrypting the output of
key-controlled quantum hash function. The signature verification is performed by
decrypting the signed message and comparing the decrypted message with the output
of the key-controlled quantum hash function. The security of the proposed scheme
depends on the indistinguishability of the unknown quantum sequence. Its unforge-
ability can be formally proved with security model under chosen-message attack.
Therefore, its security can be supported by the formal proof. On the other hand, in the
proposed scheme, no entangled state is used. It also has better qubit efficiency as well.
Keywords Quantum signature ·Security ·Security model ·Chosen-message attack ·
Unforgeability ·Eavesdropping
1 Introduction
With the gradual advancement of digitalization in today’s life, more and more messages
need to be authenticated. That is, the receiver has to figure out the source of messages
and checks whether they have been disturbed or eavesdropped or neither. To ensure the
confidentiality and integrity of a message, Diffie et al. presented the theory of digital
signature [1]. The signature generation process is essentially that the signer encrypts
BXiangjun Xin
xin_xiang_jun@126.com
1College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002,
China
2School of Mathematics and Physics, Yancheng Institute of Technology, Yancheng 224051, China
3School of Computer Science and Engineering, University of Electronic Science and Technology of
China, Chengdu 611731, China
123
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
... This is the author's version which has not been fully edited and content may change prior to final publication. Our solution employs the QKD protocol [58] to guarantee the unconditional security of the secret keys a and b during system initialization. Assume a and b possess a uniform distribution. ...
Article
Full-text available
The metaverse has profoundly altered the conventional online landscape and has attracted significant interest from researchers and industry professionals. As the metaverse changes quickly, it needs strong and safe cryptographic solutions to make sure that transactions are fair and safe in its highly connected world. This paper presents a novel blockchain-assisted fair exchange signature protocol leveraging quantum key distribution (QKD) to ensure security against both classical and quantum adversaries. The suggested protocol combines blockchain technology with quantum key distribution to create an exchange framework that can’t be changed, is clear, and can’t be tampered with. It also uses quantum mechanics to create keys that are always safe. By incorporating a fair exchange mechanism, the protocol guarantees that either both parties fulfill their obligations or neither party benefits, addressing trust issues in decentralized metaverse transactions. Furthermore, we provide a detailed analysis of the protocol’s security, efficiency, and scalability, highlighting its resistance to quantum attacks and its suitability for real-time applications in the metaverse. Simulation results demonstrate that the protocol significantly enhances exchange fairness, minimizes latency, and ensures robust authentication, making it a promising candidate for securing transactions in next-generation digital ecosystems. Web 3.0 technologies provide a resolution by facilitating a decentralized metaverse ecology. The suggested protocol utilizes quantum fundamentals to facilitate safe communication, while the incorporation of quantum cryptography with Web 3.0 improves the efficiency, security, and authenticity of metaverse environments. We test the proposed quantum signature scheme both theoretically and practically using QuantumSim simulations, demonstrating strong signature performance in comparison to other schemes. The results indicate a computational cost of 0.815ms, and communication costs of 1312 bits, demonstrating the protocol’s resilience and performance by conducting a thorough safety and efficiency analysis and demonstrating compliance with essential security features, including unforgeability, undeniability, verifiability, and traceability.
Article
Full-text available
Although the researchers have proposed many arbitrator quantum signature (AQS) for various applications in practice, the security proof of most AQSs was not strictly presented. Many results have shown that the AQS schemes without strict security proof may be broken by various measurement and forgery attacks. Therefore, a secure AQS should strictly put its security on the quantum theorems and principles. Based on the non-orthogonal entangled-triple sequence, an AQS with provable security is proposed. First, the theoretical security proof of our AQS is presented. Second, we prove the non-cloning theorem for the entangled-triple sequence. Third, by using the non-cloning property of the entangled-triple particle, we prove the new AQS signature cannot be forged. At last, the non-repudiation of the proposed AQS is analyzed. We showed that if an adversary can break the signature, his/her actions will violate some quantum principles. The security proof of the proposed signature scheme also shows the idea of provable security for a quantum signature. On the other hand, in the proposed scheme, the partners need not perform the probabilistic quantum state comparison test. It has better qubit efficiency. Therefore, compared with the other similar schemes, ours has the better merits in security and efficiency.
Article
Full-text available
Recently, Zhao et al. proposed a semi-quantum bi-signature (SQBS) scheme based on W states with two quantum signers and just one classical verifier. In this study, we highlight three security issues with Zhao et al.’s SQBS scheme. In Zhao et al.’s SQBS protocol, an insider attacker can perform an impersonation attack in the verification phase and an impersonation attack in the signature phase to capture the private key. In addition, an eavesdropper can perform a man-in-the-middle attack to obtain all of the signer’s secret information. All of the above three attacks can pass the eavesdropping check. Without considering these security issues, the SQBS protocol could fail to ensure the signer’s secret information.
Article
Full-text available
Recently, Zheng et al. presented a novel signature protocol with arbitrator based on XOR encryption and GHZ state. Unfortunately, their protocol lacks security. Firstly, a quantum adversary can forge their signature based on the received information. On the other hand, their protocol is vulnerable for the adversary’s repudiation attack. Then, we bring about improvements on its security, efficiency and practicality. The improved protocol not only prevents the security defects of the old protocol, but also has better computation efficiency. On the other hand, our protocol is mainly used to sign the classical messages, which are widely used in the current network.
Article
Full-text available
Recently, Jiang et al. proposed a novel quantum multi-signature protocol based on locally indistinguishable orthogonal product states. Unfortunately, their protocol cannot resist against the forgery attack and disavowal attack. We investigate the security of Jiang et al.’s quantum multi-signature protocol and demonstrate the signature receiver’s forgery attack. What is more, the signature receiver can extend the forgery attack such that anyone can generate the forgery. On the other hand, their protocol is insecure against the signers’ disavowal attack, too. Then, an improved quantum multi-signature protocol is proposed. In the improved protocol, all the signers share the private keys with the signature receiver and the arbitrator. To generate a quantum multi-signature, all the signers perform the unitary operations controlled by the private keys and the message. The improved protocol overcomes all the security drawbacks of Jiang et al.’s quantum multi-signature. What is more, the arbitrator Trent can be semi-trusted, because he cannot forge any quantum signature of the signers, although Trent shares the private keys with all the signers. At the same time, the new protocol has the same quantum efficiency as that of Jiang et al.’s protocol.
Article
Full-text available
Quantum secure communication network is in the stage of rapid construction. As classical networks, we researchers also need to develop different practical quantum protocols for different application scenarios in quantum communication network. However, complex quantum operations and expensive quantum resource preparation seriously hinder the practical development of quantum communication networks. A variety of quantum signature protocols play an important role in quantum communications; however, these protocols also face the same problems described above. In this paper, we propose a semi-quantum proxy signature scheme with quantum walk-based teleportation to solve these problems. Proxy signer TP as the quantum participant and original signer Alice is the classical participant. We introduce quantum walk teleportation to generate quantum entanglement resource naturally in signature phase, which seems more in line with the reality of quantum communication networks. Security analysis show that this scheme meets all the security requirement of quantum proxy signature protocol, and the qubit efficiency analysis also proves this protocol has better practical value.
Article
Full-text available
A digital signature with designated verifier (SWDV) makes that only the designated verifier can verify its validity. It can be used to protect the privacy and economic interest of the signer. So, the SWDV schemes have many applications in e-voting, auction and some other fields. To make the SWDV secure against the quantum forger, a quantum signature with designated verifier signature (QSWDV) scheme is proposed. Our QSWDV is robust due to its strong security against forgery attack, inter-resending attacks, impersonation attacks and Trojan horse attacks. Its properties such as non-transferability and hiding source can be guaranteed by the signature simulation of the designated verifier. What is more, our scheme can be proved to be information-theoretically secure, which can guarantee the secrecy of the signer’s private key and the unforgeability of the QSWDV. In the proposed QSWDV scheme, the partners neither need use quantum one-way function nor need perform quantum state comparisons, which can reduce the complexity and improve the efficiency the QSWDV scheme.
Article
Full-text available
This paper provides a new (second) way, which is completely different from Shor’s algorithm, to show the optimistic potential of a D-Wave quantum computer for deciphering RSA and successfully factoring all integers within 10000. Our method significantly reduced the local field coefficient h and coupling term coefficient J by more than 33% and 26%, respectively, of those of Ising model, which can further improve the stability of qubit chains and improve the upper bound of integer factorization. In addition, our results obtained the best index (20-bit integer (1028171)) of quantum computing for deciphering RSA via the quantum computing software environment provided by D-Wave. Furthermore, Shor’s algorithm requires approximately 40 qubits to factor the integer 1028171, which is far beyond the capacity of universal quantum computers. Thus, post quantum cryptography should further consider the potential of the D-Wave quantum computer for deciphering the RSA cryptosystem in future.
Article
We propose a semi-quantum blind digital signature protocol which can communicate between the classical party and quantum party. And our scheme is guaranteed by GHZ state and semi-quantum key distribution. The application of semi-quantum conception can reduce the computational burden of the communicants. In addition, in order to improving the security of communications between classical and quantum party, we propose a new method to detect eavesdropping. Through the security analysis, we confirm that our protocol is secure and simple to implement with practical existing quantum hardware devices.
Article
Quantum signature is a branch of quantum cryptography that draws on the design ideas of classic digital signatures, and uses the basic principles of quantum mechanics to achieve the integrity, authenticity and nonrepudiation of quantum information. Among them, arbitration quantum signature (AQS) plays a very important role. In this paper, we proposed an AQS protocol based on XOR encryption. Unlike other protocols, a quantum one-time pad encryption method or chain-type CNOT encryption method is abandoned. The proposed protocol is designed based on the three-particle GHZ state combined with the idea of classical XOR encryption, with CNOT operations used to encrypt quantum messages and quantum signatures. A security analysis of the proposed protocol reveals that the proposed protocol can satisfy the AQS requirements of unforgeability and nonrepudiation.