Asymmetrical Group Key Management Based on NTRU

Zhou Jian, Liyan Sun, Yue Wu

Published Mar 1, 2023• 0 citations

Abstract

Abstract Shared key protocol is an important research issue in distributed networks security. The most existing shared key protocols are based on the discrete logarithm or large number decomposition problem. Those protocols’ cost is related to the network scale, and has the problem of high computation cost and message overhead. To solve the question, this paper proposes a shared key agreement protocol based on the lattice key mechanism (sNTRU). All network members share the key material via public channel, after execution those members has a shared encryption key and a number of different decryption keys satisfying the key independence. Compared with the traditional shared key agreement protocol based on DLP or RSA problem, this scheme only needs one round of interaction, and it is more efficient in calculation cost. In security aspect, its security proof can be reduced to the shortest vector difficulty problem, and it can resist the chosen plaintext attack, forwards security and backwards security are guaranteed.

DOI: 10.21203/rs.3.rs-1466219/v1

Related papers

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Yong Gan, Bingli Wang, Yuan Zhuang +2 more

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

International Journal of Embedded SystemsJan 1, 20191 citation

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan +2 more

International Journal of Embedded SystemsJan 1, 20190 citations

Asymmetric Group Key Agreement Protocol from Short Signatures

Kunyu Shen, Lei Zhang, Rui Zhang +1 more

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.

IEEE International Conference on Computer and Communications (ICCC)Dec 9, 20223 citations

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Zhang Qikun, Yongjiao Li, Yong Gan +3 more

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.

IEEE AccessJan 1, 201927 citations

A New Secure Protocol for Authenticated Key Agreement

Hassan M. A. Elkamchouchi, Mohamed R. M. Rizk, Fatma Ahmed

Authenticated key agreement protocols have an important role in building secure communications between two or more parties over the open network. In this paper we propose an efficient and secure authenticated key agreement protocol based on RSA factoring and Discrete Logarithm Problem (DLP). We try to design strong protocol depends on the relation between two assumption (RSA factoring and DLP). We show that our protocol meets the security attributes and strong against most of potential attacks.

International Journal of Engineering and TechnologyJan 1, 20132 citations

NTRU-KE: A Lattice-based Public Key Exchange Protocol.

Xinyu Lei, Xiaofeng Liao

Abstract. Public key exchange protocol is identified as an important application in the field of public-key cryptography. Most of the existing public key exchange schemes are Diffie-Hellman (DH)-type, whose security is based on DH problems over different group-s. Note that there exists Shor’s polynomial-time algorithm to solve these DH problems when a quantum computer is available, we are therefore motivated to seek for a non-DH-type and quantum resistant key exchange protocol. To this end, we turn our attention to lattice-based cryptography. The higher methodology behind our roadmap is that in anal-ogy to the link between ElGamal, DSA, and DH, one should expect a NTRU lattice-based key exchange primitive in related to NTRU-ENCRYPT and NTRU-SIGN. However, this excepted key exchange protocol is not presented yet and still missing. In this paper, this missing key exchange protocol is found, hereafter referred to as NTRU-KE, which is stud-ied in aspects of security and key-mismatch failure. In comparison with ECDH (Elliptic Curve-based Diffie-Hellman), NTRU-KE features faster computation speed, resistance to quantum attack, and more communication overhead. Accordingly, we come to the conclu-sion that NTRU-KE is currently comparable with ECDH. However, decisive advantage of NTRU-KE will occur when quantum computers become a reality.

Jan 1, 201324 citations