Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Non-interactive Key Exchange: New Notions, New Constructions, and Forward Security

Suvradip Chakraborty, Dennis Hofheinz, Roman Langrehr

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-91823-0_7

Related papers

Forward Secure Non-Interactive Key Exchange

David Pointcheval, Olivier Sanders

Lecture notes in computer science•Jan 1, 2014•21 citations

Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction

Suvradip Chakraborty, Goutam Paul, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2015•0 citations

On Tightly Secure Non-Interactive Key Exchange

Julia Hesse, Dennis Hofheinz, Lisa Kohl

Lecture notes in computer science•Jan 1, 2018•31 citations

Extensional schemes of multipartite non-interactive key exchange from multilinear maps and their applications

Huiwen Jia, Yupu Hu

The question of generalising the celebrated 2-party non-interactive key exchange (NIKE), Diffie-Hellman protocol, to a multipartite setting was left as an important open problem. In 2003, Boneh and Silverberg put forward a theoretical construction of multipartite NIKE protocol from a new notion called multilinear maps. In their protocol, however, the number of users N and the multilinearity k are related by N = k + 1, resulting in the system initialising another multilinear map when the number of users who want to exchange a session key changes. In this paper, we describe two extensional schemes of multipartite NIKE, which enables any less than or equal to N users derive a common shared key from an (N – 1)-multilinear map. In addition, using our extensional schemes, we show a concrete scenario: the establishment of any discussion group in a user group and its privacy version. Furthermore, we analyse its security.

International Journal of High Performance Computing and Networking•Jan 1, 2018•0 citations

Forward Secure Non-Interactive Key Exchange from Indistinguishability Obfuscation

Young Kyung Lee, Dong Hoon Lee

Recently, an efficient obfuscator of indistinguishability obfuscation was constructed by Grag et al, and it is considered as a powerful cryptographic primitive. In this paper, we propose forward secure non-interactive key exchange from indistinguishability obfuscation. A non-interactive key exchange provides an efficiency of overall system, because there are no interactions between users for key exchange. Forward security is important security requirement, because it mitigates damage when user's private key is revealed. In 2014, Pointcheval and Sanders proposed the first forward secure non- interactive key exchange scheme from multilinear map. In their scheme, there is a lifetime of a system and the lifetime is divided into time period. A user updates its private key according to time period, so the scheme has limits in the number of updates of private key. To make it free from limits of the number of updates, we design forward secure non-interactive key exchange scheme from indistinguishability obfuscation. In our scheme, there is no limits in the number of updates of private key.

International Conference on IT Convergence and Security (ICITCS)•Aug 1, 2015•0 citations

Fine-Grained Non-interactive Key Exchange without Idealized Assumptions, and Lower Bounds

Yuyu Wang, C.-J. Su, Jiaxin Pan +1 more

Journal of Cryptology•Nov 9, 2026•0 citations
The question of generalising the celebrated 2-party non-interactive key exchange (NIKE), Diffie-Hellman protocol, to a multipartite setting was left as an important open problem. In 2003, Boneh and Silverberg put forward a theoretical construction of multipartite NIKE protocol from a new notion called multilinear maps. In their protocol, however, the number of users N and the multilinearity k are related by N = k + 1, resulting in the system initialising another multilinear map when the number of users who want to exchange a session key changes. In this paper, we describe two extensional schemes of multipartite NIKE, which enables any less than or equal to N users derive a common shared key from an (N – 1)-multilinear map. In addition, using our extensional schemes, we show a concrete scenario: the establishment of any discussion group in a user group and its privacy version. Furthermore, we analyse its security.
Recently, an efficient obfuscator of indistinguishability obfuscation was constructed by Grag et al, and it is considered as a powerful cryptographic primitive. In this paper, we propose forward secure non-interactive key exchange from indistinguishability obfuscation. A non-interactive key exchange provides an efficiency of overall system, because there are no interactions between users for key exchange. Forward security is important security requirement, because it mitigates damage when user's private key is revealed. In 2014, Pointcheval and Sanders proposed the first forward secure non- interactive key exchange scheme from multilinear map. In their scheme, there is a lifetime of a system and the lifetime is divided into time period. A user updates its private key according to time period, so the scheme has limits in the number of updates of private key. To make it free from limits of the number of updates, we design forward secure non-interactive key exchange scheme from indistinguishability obfuscation. In our scheme, there is no limits in the number of updates of private key.