Abstract
The quantum proxy signature is one of the most significant formalisms in quantum signatures. We put forward a quantum proxy signature scheme using quantum walk-based teleportation and quantum one-time pad CNOT (QOTP-CNOT) operation, which includes four phases, i.e., initializing phase, authorizing phase, signing phase and verifying phase. The QOTP-CNOT is achieved by attaching the CNOT operation upon the QOTP and it is applied to produce the proxy signature state. The quantum walk-based teleportation is employed to transfer the encrypted message copy derived from the binary random sequence from the proxy signer to the verifier, in which the required entangled states do not need to be prepared ahead and they can be automatically generated during quantum walks. Security analysis demonstrates that the presented proxy signature scheme has impossibility of denial from the proxy and original signers, impossibility of forgery from the original signatory and the verifier, and impossibility of repudiation from the verifier. Notably, the discussion shows the complexity of the presented algorithm and that the scheme can be applied in many real scenarios, such as electronic payment and electronic commerce.
Highlights
IntroductionTo satisfy the special requirements for diverse application scenarios, many ramifications of classical signature have occurred
Digital signature has been prevalent in past decades and applied in lots of scenes, such as electronic payment, electronic commerce and electronic government affairs, with strict demands for security.To satisfy the special requirements for diverse application scenarios, many ramifications of classical signature have occurred
We presented a quantum proxy signature scheme with quantum one-time pad (QOTP)-CNOT operation and quantum walk-based teleportation by making full use of quantum walks on circles
Summary
To satisfy the special requirements for diverse application scenarios, many ramifications of classical signature have occurred. The most concerning issue is the security of the classical signature scheme, which depends on computational complexity of some intractable problems involving the factorization of large numbers and the discrete logarithm. These problems can be efficiently solved by quantum algorithms with the development of quantum computation. The former can be solved in polynomial time by Shor’s quantum prime factorization algorithm [1].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
