Blind Signcryption Method in Lattice Public Key Cryptosystem

Abstract

A blind sign encryption method under lattice public key cryptosystem is characterized in that it consists of system initialization, user key generation, message owner blinded message, user signature and encryption, and verification steps. The invention learns from the blind signcryption and lattice encryption methods under the traditional cryptosystem, and constructs a lattice-based post-quantum blind signcryption method. Compared with the blind signcryption method under the assumption of finite field discrete logarithm and elliptic curve discrete logarithm, the blind signature method of , adds a certain blinding message μ in the signcryption scheme, which increases the blinding function. , which makes the signcryption anonymous, which effectively protects the privacy of the message owner, can resist quantum attacks and has higher computational efficiency, and can be used in the field of electronic signcryption technology.

Description

technical field [0001] The invention belongs to the technical field of network information security, and specifically relates to cryptography, a lattice public key cryptosystem or a blind signcryption method. Background technique [0002] Signcryption can perform both encryption and signing operations in one logical step at a much lower computational and communication cost than signing before encrypting. However, as a very important cryptographic primitive, the development of signcryption on lattices is relatively slow. [0003] In 1996, Ajtai found a connection between the worst-case and average-case complexity of some well-known lattice problems. Later, Ajtai and Dwork proposed a public key cryptosystem based on lattice theory, which has opened up a new field for public key cryptosystems since then. Public key cryptosystems based on lattice theory, such as GGH public key cryptosystem, NTRU public key cryptosystem and Regev public key cryptosystem, have been proposed succ...

AI Technical Summary

Problems solved by technology

In 2005, Yuan first proposed a provably secure identity-based blind signcryption using bilinear pairings, but this scheme uses too many bilinear pairing operations and has low computational efficiency.

In 2016, Tian et al. proposed the first identity-based partial blind signature scheme against quantum attacks on the lattice, but the scheme has a signature anomaly problem; even the signature generated by the interaction between the honest signer and the requester in the scheme may be unqualified signature

Currently there is no blind signcryption method under lattice public key cryptography

Images