Design And Implementation Of Efficient Ring Signature Scheme On Lattice

With the continuous development of network information technology,digital signature technology is considered as an important core technology to complete secure transactions on the Internet,and it is widely applied to all areas of people’s lives.Among them,ring signature,one of many digital signature schemes,is widely used in anonymous transactions,anonymous voting,anonymous reporting,block chains and other scenarios because of its unconditional anonymity and unforgetability.Due to the rapid development of quantum computer technology,the security of traditional ring signature schemes is based on the difficult assumptions of large integer decomposition,discrete logarithm and bilinear pairing theory.Under the difficult assumption,the security of traditional ring signature schemes can not be guaranteed in quantum computers and can be broken by quantum computers in polynomial time.This brings new challenges to the design of ring signature schemes.Therefore,it is imperative to design ring signature schemes that can withstand quantum attacks.The ring signature scheme based on lattice not only solves the above problems,but also mainly involves linear and modular operations.Compared with the traditional ring signature scheme based on the number theory assumption,the ring signature scheme based on lattice is faster.It is an alternative to the quantum traditional cryptography scheme in the future.The ring signature scheme on the design lattice is favored by cryptographers.Nowadays,although some ring signature schemes based on lattice are designed,there are many problems in most of them,such as too long key length,low computational efficiency and high computational complexity.In order to overcome the shortcomings of lattice ring signature scheme,the following research is done:(1)To solve the problems of generating validation keys and signature keys excessively long and the security of the scheme cannot resist quantum attack in the ring signature scheme based on the mathematical assumption,a ring signature scheme based on programmable hash functions on the lattice is designed.The verification keys as well as the signature keys are computed using the G-trapdoor matrix function in the design of the scheme,and the programmable features of random presyncope can be simulated using the on lattice programmable hash function proposed in the Zhang’s scheme,which is applied in the construction process of the ring signature scheme to obtain shorter signatures and keys and demonstrate that the scheme satisfies under the standard model(Existentially Unforgeable under Adaptive Chosen Message Attacks,EUF-CMA)security.(2)In order to solve the problem that the key length is too long in the scheme of ring signature on the lattice and the length of the key increases linearly with the increase of the number of members in the ring,an efficient ring signature scheme is proposed.By using the special algebra structure of ideal lattice and MP12 trapdoor derivation technology,the signature key generated is relatively short and the verification key is a small constant.The signature length is composed of a single lattice vector,reducing the complexity of operation,improving the efficiency of operation,and proves that the scheme is anonymous and forgeable under the standard model.(3)A ring signature scheme based on lattice is designed to solve the problems of driver identity exposure and message interception and tampering in(Vehicular Ad Hoc Networks,VANETs)system.The scheme uses the special structure on ideal lattice and MP12 trapdoor derivation algorithm,which not only meets the protection of driver’s identity information in vehicle networking,but also ensures that messages can not be forged in the process of transmission.