Hamilton quantum arbitration signature and verification method based on quantum blind calculation

Abstract

The invention discloses a Hamilton quantum arbitration signature and verification method based on quantum blind calculation, which comprises the following steps that a third communicator distributes aHamilton model to a first communicator and a second communicator; the first communicator prepares to-be-signed information represented by n quantum bit strings; the first communicator conducts quantum blind calculation on the to-be-signed information to obtain a measurement base; the first communicator signs the to-be-signed information by utilizing the Hamilton model; the second communicator conducts un-signing by utilizing the Hamilton model to obtain a verification quantum bit string; the third communicator verifies whether the first communicator is legal or not by verifying whether the to-be-signed information and the verification quantum bit string are the same or not; if legal, the second communicator uses the measurement base to measure the verification quantum bit string so as toobtain a measurement result; and the third communicator controls whether the measurement result is transposed or not according to the stored control parameters to obtain binary mode payment information. According to the Hamilton quantum arbitration signature and verification method based on quantum blind, the safety of the signature verification process is improved, and a verifier verifies the signature without the need for restoring the original information.

Description

technical field [0001] The invention belongs to the technical field of information signature and quantum authentication, in particular to a Hamiltonian quantum arbitration signature based on quantum blind calculation and a verification method. Background technique [0002] Information signature is not only an important means to realize information protection, but also one of the core technologies of information security, which is now applicable to various fields such as life, military affairs, and government affairs. However, with the wide application of signature technology in these fields and the continuous improvement of people's security awareness, ordinary digital signatures can no longer meet people's growing security needs. Traditional signatures use the complexity of algorithm calculations to ensure their security. With the continuous improvement of computing power, the security of traditional signatures will face a huge test. Quantum signatures use the physical cha...

AI Technical Summary

Problems solved by technology

However, existing quantum signature technologies have some defects in common, such as: (1) because they are particularly dependent on computational complexity, they are vulnerable to computing power; (2) they are extremely vulnerable to sudden errors in quantum computers Influence; (3) The verifier must restore the original information when verifying the authenticity of the signature information for the second time, and compare it with the original information received before to confirm the authenticity of the signature information

[0004] Aiming at the problem in the prior art that the verifier must recover the original information when verifying the authenticity of the signature information twice and the requirement of signature anti-eavesdropping, the purpose of the present invention is to propose a Hamiltonian quantum algorithm based on quantum blind computing. Arbitration signature and verification method solves this problem and improves the anti-eavesdropping performance of the signature scheme

Images