Multi-linear mapping-based one-round multi-party key exchange protocol

Abstract

The invention provides a multi-linear mapping-based one-round multi-party key exchange protocol. The multi-linear mapping-based one-round multi-party key exchange protocol comprises the following steps: generating respective public parameters by each participant by using a new randomized initialization algorithm and issuing the public parameters; constructing multi-linear mapping according to the public parameters and a new randomization method and issuing the multi-linear mapping; generating a key of each participant according to the multi-linear mapping; and generating a shared key according to the key, so that each participant exchanges information according to the shared key. According to the invention, the multi-linear mapping is constructed based on the randomization method, and the key exchange protocol is generated based on the multi-linear mapping, so that the participants can exchange information safely, efficiently and safely.

Description

technical field [0001] The invention relates to the technical field of information security, and specifically relates to a multi-linear mapping-based round multi-party key exchange protocol, a non-transitory computer-readable storage medium and a computer device. Background technique [0002] Multilinear mapping is a generalization of cryptographic primitives and bilinear mapping. It can not only be used to construct non-interactive key exchange protocols, three-party Diffie-Hellman key exchange protocols and various public key encryption schemes, but also widely used in Evidence encryption (WE: Witness Encryption), indistinguishable fuzzer (IO: Indistinguishability Obfuscation) and function encryption (FE: Function Encryption), etc. As the range of applications of multilinear maps in cryptography continues to expand, the construction schemes that serve as the basis of applications will become more and more important. [0003] In the post-quantum era, since the discrete log...

AI Technical Summary

Problems solved by technology

[0003] In the post-quantum era, since the discrete logarithm problem or the large integer decomposition problem has a polynomial solution algorithm under quantum computing, the public key cryptosystem based on the traditional number theory problem (such as the discrete logarithm problem, the large integer decomposition problem, etc.) is easy. Suffering from quantum attacks, its security is seriously threatened. Research on new public key cryptosystems that resist quantum attacks (that is, achieve post-quantum security) has become a hot issue in the industry.

Images