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

International Conference on Availability, Reliability and Security (ARES)

Non-Interactive Key Exchange from Identity-Based Encryption

Olivier Blazy, Céline Chevalier

Published Aug 13, 2018• 6 citations
Publisher

Abstract

Since the seminal work of Diffie and Hellman [19], Non-Interactive Key Exchange (NIKE) has become one of the fundamental problems of modern cryptography, but additional security requirements have led to elaborated ad-hoc constructions, which often lack simplicity in their design. In particular, Identity-Based NIKE is still a major problem with few available constructions, and those ad-hoc constructions do not give a lot of insight on what is required to be able to achieve such a NIKE scheme only based on the identity (and not relying on the public-key setting).

DOI
10.1145/3230833.3230864

Related papers

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem.

Hai Huang, Zhenfu Cao

•Jan 1, 2008•28 citations

Certificateless Non-interactive Key Exchange Protocol without Pairings

Yun Wei, Fushan Wei, Chuangui Ma

Non-interactive key exchange (NIKE) allows two parties to establish a shared key without communications. In ID-based non-interactive key exchange (ID-NIKE) protocols, private key generator (PKG) knows user's private key, so it can calculate the shared key between two participants, and most constructions of ID-NIKE need expensive pairing operation. To overcome these disadvantages, a security model of certificateless non-interactive key exchange (CL-NIKE) is proposed in this paper. And a scheme without pairings is also given. The proposed protocol is proved secure in the Random Oracle Model (ROM) based on the gap Diffie-Hellman (GDH) and computational Diffie-Hellman (CDH) problem. In the new protocol, key generation center (KGC) only knows user's partial key and is not able to calculate the shared key. Moreover, the new protocol is more efficient than the existing ID-NIKE schemes because it is pairing-free.

•Jan 1, 2014•2 citations

Provably Secure Non-interactive Key Exchange Protocol for Group-Oriented Applications in Scenarios with Low-Quality Networks

Rui Zhang, Lei Zhang

Non-interactive key exchange (NIKE) enables two or multiple parties (just knowing the public system parameters and each other's public key) to derive a (group) session key without the need for interaction. Recently, NIKE in multi-party settings has been attached importance. However, we note that most existing multi-party NIKE protocols, underlying costly cryptographic techniques (i.e., multilinear maps and indistinguishability obfuscation), lead to high computational costs once employed in practice. Therefore, it is a challenging task to achieve multi-party NIKE protocols by using more practical cryptographic primitives. In this paper, we propose a secure and efficient NIKE protocol for secure communications in dynamic groups, whose construction only bases on bilinear maps. This protocol allows multiple parties to negotiate asymmetric group keys (a public group encryption key and each party's decryption key) without any interaction among one another. Additionally, the protocol supports updating of group keys in an efficient and non-interactive way once any party outside a group or any group member joins or leaves the group. Further, any party called a sender (even outside a group) intending to connect with some or all of group members called receivers in a group, just needs to generate a ciphertext with constant size under the public group encryption key, and only the group member who is the real receiver can decrypt the ciphertext to obtain the session key. We prove our protocol captures the correctness and indistinguishability of session key under k-Bilinear Diffie-Hellman exponent (k-BDHE) assumption. Efficiency evaluation shows the efficiency of our protocol.

arXiv:2407.00073•Jun 21, 2024•0 citations

Non-committing Identity Based Encryption: Constructions and Applications

Rishab Goyal, Fuyuki Kitagawa, Venkata Koppula +3 more

Lecture notes in computer science•Jan 1, 2025•5 citations

Construction of IND-CPA Secure Isogeny-based Cryptosystem SiGamal and Unified Coordinate Formulas for Efficient Isogeny Computation

共起 守谷

Public key cryptography is crucial in current Internet technology.In practice, Rivest, Shamir, Adleman (RSA) cryptography based on Prime Factorization Problem, and Elliptic Curve cryptography based on Discrete Logarithm Problem are typically used.However, both these systems are broken in polynomial time using quantum computers.Therefore, new cryptosystems that are secure against adversaries using quantum computers (postquantum cryptography) should be developed.Isogeny-based cryptography exhibits considerable potential for use in post-quantum cryptography.It is based on Isogeny Problem that is a problem finding an isogeny from two elliptic curves.The greatness of isogeny-based cryptography is that the key length is short and hence compact secure communication is realizable.However, isogeny-based cryptography is yet to mature, and some problems remain.Although isogeny-based cryptography is considered one of the notable candidates for post-quantum cryptography, it has several problems due to its short history.In this thesis, we focus on two problems.The first one is the lack of studies on the security of isogenybased cryptosystems.Another one is that isogeny-based cryptosystems are less efficient than other candidates for post-quantum cryptography.Because of the insufficiency of studies about security, an IND-CPA secure isogeny-based public key encryption scheme without using random functions (idealized hash functions) is yet to be obtained.Some schemes have been proposed for isogeny-based public key encryption schemes; however, these schemes are only OW-CPA secure, which is the minimum security for public key encryption.Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) key exchange is an isogeny-based key exchange scheme based on group actions.Because this scheme is similar to Diffie-Hellman key exchange that has many applications, CSIDH is considered a useful scheme.CSIDH plays a crucial role in cryptography that uses group actions, and there are some applications of CSIDH for signatures and high-level cryptosystems.However, a simple public key encryption scheme based on CSIDH does not have IND-CPA security, whereas ElGamal encryption derived from Diffie-Hellman key exchange has IND-CPA security.This is because CSIDH has less mathematical structure than Diffie-Hellman, and a mathematically natural construction of key encryption based on CSIDH is yet to be obtained.In this thesis, we propose a novel public key encryption scheme, namely SiGamal.This scheme is constructed by adding auxiliary points to CSIDH key exchange.These auxiliary points extend a mathematical structure of CSIDH, and SiGamal is compatible with this extended mathematical structure.Therefore, SiGamal is a more natural ElGamal-like key encryption scheme based on CSIDH.Because SiGamal requires auxiliary points, it requires larger data than CSIDH and is less efficient.However, SiGamal has IND-CPA security without using hash functions under a new security assumption, namely the P-CSSDDH assumption.As an application of this scheme, we proposed Naor-Reingold type pseudo random function based on SiGamal.This pseudo random function (PRF) does not require hash functions, and it costs approximately 8T 3π times SiGamal, where T is the Hamming weight of the input of the PRF.Finally, experiments are conducted to verify the efficiency of SiGamal.In our experiments, the computational costs of a group action in SiGamal-512 with a 256-bit plaintext space are approximately 2.62 times that in CSIDH-512.The second problem of isogeny-based cryptography is that isogeny-based cryptosystems are more inefficient than other candidates of post-quantum cryptosystems.The inefficiency of isogeny-based cryptography could be attributed to computations of group ficients . . . . . . . . . . . .

•Mar 23, 2023•0 citations

Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions

David Galindo, Benoît Libert, Marc Fischlin +4 more

Lecture notes in computer science•Jan 1, 2010•32 citations
Since the seminal work of Diffie and Hellman [19], Non-Interactive Key Exchange (NIKE) has become one of the fundamental problems of modern cryptography, but additional security requirements have led to elaborated ad-hoc constructions, which often lack simplicity in their design. In particular, Identity-Based NIKE is still a major problem with few available constructions, and those ad-hoc constructions do not give a lot of insight on what is required to be able to achieve such a NIKE scheme only based on the identity (and not relying on the public-key setting).
Non-interactive key exchange (NIKE) allows two parties to establish a shared key without communications. In ID-based non-interactive key exchange (ID-NIKE) protocols, private key generator (PKG) knows user's private key, so it can calculate the shared key between two participants, and most constructions of ID-NIKE need expensive pairing operation. To overcome these disadvantages, a security model of certificateless non-interactive key exchange (CL-NIKE) is proposed in this paper. And a scheme without pairings is also given. The proposed protocol is proved secure in the Random Oracle Model (ROM) based on the gap Diffie-Hellman (GDH) and computational Diffie-Hellman (CDH) problem. In the new protocol, key generation center (KGC) only knows user's partial key and is not able to calculate the shared key. Moreover, the new protocol is more efficient than the existing ID-NIKE schemes because it is pairing-free.
Non-interactive key exchange (NIKE) enables two or multiple parties (just knowing the public system parameters and each other's public key) to derive a (group) session key without the need for interaction. Recently, NIKE in multi-party settings has been attached importance. However, we note that most existing multi-party NIKE protocols, underlying costly cryptographic techniques (i.e., multilinear maps and indistinguishability obfuscation), lead to high computational costs once employed in practice. Therefore, it is a challenging task to achieve multi-party NIKE protocols by using more practical cryptographic primitives. In this paper, we propose a secure and efficient NIKE protocol for secure communications in dynamic groups, whose construction only bases on bilinear maps. This protocol allows multiple parties to negotiate asymmetric group keys (a public group encryption key and each party's decryption key) without any interaction among one another. Additionally, the protocol supports updating of group keys in an efficient and non-interactive way once any party outside a group or any group member joins or leaves the group. Further, any party called a sender (even outside a group) intending to connect with some or all of group members called receivers in a group, just needs to generate a ciphertext with constant size under the public group encryption key, and only the group member who is the real receiver can decrypt the ciphertext to obtain the session key. We prove our protocol captures the correctness and indistinguishability of session key under k-Bilinear Diffie-Hellman exponent (k-BDHE) assumption. Efficiency evaluation shows the efficiency of our protocol.
Public key cryptography is crucial in current Internet technology.In practice, Rivest, Shamir, Adleman (RSA) cryptography based on Prime Factorization Problem, and Elliptic Curve cryptography based on Discrete Logarithm Problem are typically used.However, both these systems are broken in polynomial time using quantum computers.Therefore, new cryptosystems that are secure against adversaries using quantum computers (postquantum cryptography) should be developed.Isogeny-based cryptography exhibits considerable potential for use in post-quantum cryptography.It is based on Isogeny Problem that is a problem finding an isogeny from two elliptic curves.The greatness of isogeny-based cryptography is that the key length is short and hence compact secure communication is realizable.However, isogeny-based cryptography is yet to mature, and some problems remain.Although isogeny-based cryptography is considered one of the notable candidates for post-quantum cryptography, it has several problems due to its short history.In this thesis, we focus on two problems.The first one is the lack of studies on the security of isogenybased cryptosystems.Another one is that isogeny-based cryptosystems are less efficient than other candidates for post-quantum cryptography.Because of the insufficiency of studies about security, an IND-CPA secure isogeny-based public key encryption scheme without using random functions (idealized hash functions) is yet to be obtained.Some schemes have been proposed for isogeny-based public key encryption schemes; however, these schemes are only OW-CPA secure, which is the minimum security for public key encryption.Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) key exchange is an isogeny-based key exchange scheme based on group actions.Because this scheme is similar to Diffie-Hellman key exchange that has many applications, CSIDH is considered a useful scheme.CSIDH plays a crucial role in cryptography that uses group actions, and there are some applications of CSIDH for signatures and high-level cryptosystems.However, a simple public key encryption scheme based on CSIDH does not have IND-CPA security, whereas ElGamal encryption derived from Diffie-Hellman key exchange has IND-CPA security.This is because CSIDH has less mathematical structure than Diffie-Hellman, and a mathematically natural construction of key encryption based on CSIDH is yet to be obtained.In this thesis, we propose a novel public key encryption scheme, namely SiGamal.This scheme is constructed by adding auxiliary points to CSIDH key exchange.These auxiliary points extend a mathematical structure of CSIDH, and SiGamal is compatible with this extended mathematical structure.Therefore, SiGamal is a more natural ElGamal-like key encryption scheme based on CSIDH.Because SiGamal requires auxiliary points, it requires larger data than CSIDH and is less efficient.However, SiGamal has IND-CPA security without using hash functions under a new security assumption, namely the P-CSSDDH assumption.As an application of this scheme, we proposed Naor-Reingold type pseudo random function based on SiGamal.This pseudo random function (PRF) does not require hash functions, and it costs approximately 8T 3π times SiGamal, where T is the Hamming weight of the input of the PRF.Finally, experiments are conducted to verify the efficiency of SiGamal.In our experiments, the computational costs of a group action in SiGamal-512 with a 256-bit plaintext space are approximately 2.62 times that in CSIDH-512.The second problem of isogeny-based cryptography is that isogeny-based cryptosystems are more inefficient than other candidates of post-quantum cryptosystems.The inefficiency of isogeny-based cryptography could be attributed to computations of group ficients . . . . . . . . . . . .