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

Two-Message Authenticated Key Exchange from Public-Key Encryption

You Lyu, Shengli Liu

Published Jan 1, 2024• 5 citations
Publisher
DOI
10.1007/978-3-031-50594-2_21

Related papers

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation

Hybrid deniable and short-key encryption protocols based on the authentication procedure

Tan Sy Ho, Alexander Andreevich Moldovyan, Moldovyan Nikolay Andreevich +5 more

To ensure resistance to attacks with coercion to disclose a secret key by an active adversary, the protocol of deniable encryption includes a procedure for mutual authentication of the sender and receiver of a message with their long-term public keys, which is combined with a hidden exchange of single-use public keys used to generate a single-use shared key, on which the secret message is encrypted. Longterm public keys are used to generate a shared secret key, on which a fake message is encrypted. The produced intermediate ciphertexts are converted into a single ciphertext, which is computationally indistinguishable from the ciphertext obtained by probabilistic encryption of a fake message. This approach allows us to build an encryption protocol that is resistant to bi-sided attacks with coercion, since the disclosure of users' private keys gives access only to the fake message and cannot be used to prove the possibility of alternative decryption of the ciphertext transmitted over a public communication channel. The authentication of the single-use public keys is also used to implement protocols for secure encryption using short shared keys.

International Conference on Advanced Computing and Applications (ACOMP)•Nov 1, 2020•1 citation

Compact and unforgeable key establishment over an ATM network

Yuliang Zheng, Hirotaka Imai

Authenticated session key establishment is a central issue in network security. This paper addresses the question of whether we can design a compact, efficient and authenticated key establishment protocol that has the following two properties: (1) each message exchanged between two participants can be transferred in a short packet such as an ATM cell whose payload has only 384 bits, and (2) messages that carry key materials are unforgeable and nonrepudiatable without the involvement of a trusted key distribution center. We discuss why the answer to this question is negative if one follows the currently standard approach to key establishment, namely employing secret/public key encryption and, possibly, digital signature. We then present a number of protocols that represent a positive answer to the question. Our protocols are all based on a cryptographic primitive called "signcryption" that fulfils both the functions of digital signature and public key encryption with a cost far smaller than that required by "digital signature followed by encryption".

IEEE Conference on Computer Communications (INFOCOM)•Nov 27, 2002•12 citations

Symmetric Public-Key Encryption

Zvi Galil, Stuart Haber, Moti M. Yung

Springer eBooks•Feb 28, 2007•29 citations

One-Round Protocols for Two-Party Authenticated Key Exchange

Ik Rae Jeong, Jonathan I. Katz, Dong Hoon Lee

Lecture notes in computer science•Jan 1, 2004•104 citations

Private and Mutual Authentication Protocols for Internet of Things

Lili Jiang, Hui Cui

The Internet of Things (IoT) consists of a range of devices that communicate with other devices that are surrounding them. Secure communications between IoT devices have been an essential requirement. However, most existing authentication protocols fail to provide privacy protection for devices such that sensitive information including device owner’s identity and device type can be leaked. In this paper, based on attribute-based encryption (ABE), we propose two private and mutual authentication protocols to protect the privacy of IoT devices. The first protocol is a three-message key exchange protocol, following the public-key encryption mode of the Internet Key Exchange (IKE). The second protocol is a one-round key exchange protocol, thereby providing simplicity and efficiency of messages communicated between the participants. Both of our protocols can be proved secure in the defined model. Finally, we implement the two protocols in an open source framework.

Mathematics•Apr 19, 2023•7 citations
To ensure resistance to attacks with coercion to disclose a secret key by an active adversary, the protocol of deniable encryption includes a procedure for mutual authentication of the sender and receiver of a message with their long-term public keys, which is combined with a hidden exchange of single-use public keys used to generate a single-use shared key, on which the secret message is encrypted. Longterm public keys are used to generate a shared secret key, on which a fake message is encrypted. The produced intermediate ciphertexts are converted into a single ciphertext, which is computationally indistinguishable from the ciphertext obtained by probabilistic encryption of a fake message. This approach allows us to build an encryption protocol that is resistant to bi-sided attacks with coercion, since the disclosure of users' private keys gives access only to the fake message and cannot be used to prove the possibility of alternative decryption of the ciphertext transmitted over a public communication channel. The authentication of the single-use public keys is also used to implement protocols for secure encryption using short shared keys.
Authenticated session key establishment is a central issue in network security. This paper addresses the question of whether we can design a compact, efficient and authenticated key establishment protocol that has the following two properties: (1) each message exchanged between two participants can be transferred in a short packet such as an ATM cell whose payload has only 384 bits, and (2) messages that carry key materials are unforgeable and nonrepudiatable without the involvement of a trusted key distribution center. We discuss why the answer to this question is negative if one follows the currently standard approach to key establishment, namely employing secret/public key encryption and, possibly, digital signature. We then present a number of protocols that represent a positive answer to the question. Our protocols are all based on a cryptographic primitive called "signcryption" that fulfils both the functions of digital signature and public key encryption with a cost far smaller than that required by "digital signature followed by encryption".
The Internet of Things (IoT) consists of a range of devices that communicate with other devices that are surrounding them. Secure communications between IoT devices have been an essential requirement. However, most existing authentication protocols fail to provide privacy protection for devices such that sensitive information including device owner’s identity and device type can be leaked. In this paper, based on attribute-based encryption (ABE), we propose two private and mutual authentication protocols to protect the privacy of IoT devices. The first protocol is a three-message key exchange protocol, following the public-key encryption mode of the Internet Key Exchange (IKE). The second protocol is a one-round key exchange protocol, thereby providing simplicity and efficiency of messages communicated between the participants. Both of our protocols can be proved secure in the defined model. Finally, we implement the two protocols in an open source framework.