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 on Software Engineering

An Authenticated Key Exchange with Perfect Forward Secrecy for Two Message Diffie-Hellman Type Protocols

Tribid Debbarma, Anupam Jamatia, Kunal Chakma

Published Nov 13, 2014• 0 citations
Publisher
DOI
10.7763/lnse.2015.v3.213

Related papers

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

Hai Huang, Zhenfu Cao

•Jan 1, 2008•28 citations

One-round strongly secure key exchange with perfect forward secrecy and deniability

Cas J. F. Cremers, Michèle Feltz

Traditionally, secure one-round key exchange protocols in the PKI setting have either achieved perfect forward secrecy, or forms of deniability, but not both. On the one hand, achieving perfect forward secrecy against active attackers seems to require some form of authentication of the messages, as in signed Diffie-Hellman style protocols, that subsequently sacrifice deniability. On the other hand, using implicit authentication along the lines of MQV and descendants sacrifices perfect forward secrecy in one round and achieves only weak perfect forward secrecy instead. We show that by reintroducing signatures, it is possible to satisfy both a strong key-exchange security notion as well as a strong form of deniability, in one-round key exchange protocols. Our security notion for key exchange is stronger than, e. g., the extended CK model, and captures perfect forward secrecy. Our notion of deniability, which we call peer-and-time deniability, is stronger than that offered by, e. g., the SIGMA protocol. We propose a concrete protocol and prove that it satisfies our definition of key-exchange security in the random oracle model as well as peer-and-time deniability. The protocol combines a signed-Diffie-Hellman message exchange with an MQV-style key computation, and offers a remarkable combination of advanced security properties and efficiency

•Jun 1, 2011•35 citations

Signed Diffie-Hellman Key Exchange with Tight Security

Jiaxin Pan, Chen Qian, Magnus Ringerud

Lecture notes in computer science•Jan 1, 2021•12 citations

Implementing Diffie-Hellman key exchange using quantum EPR pairs

Sayonnha Mandal, Abhishek Parakh

This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 21, 2015•7 citations

An authenticated Diffie-Hellman key agreement protocol secure against active attacks

Shoichi Hirose, Susumu Yoshida

Lecture notes in computer science•Jan 1, 1998•18 citations

Towards modelling perfect forward secrecy in two‐message authenticated key exchange under ephemeral‐key revelation

Zheng Yang, Wu Yang, Lingyun Zhu +1 more

Abstract We examine the recently introduced CF and CF‐perfect forward secrecy (PFS) models for two‐message authenticated key exchange (TMAKE) by Cremers et al., where the difference between CF and CF‐PFS model is that the CF formulates the weak PFS (wPFS), whereas the CF‐PFS formulates the PFS. The CF model is claimed by Cremers et al. to be strictly stronger the previous extended Canetti‐Krawczyk (eCK) model. However, we notice that the implication relations among CF, CF‐PFS, eCK and eCK‐PFS model have not been completely studied. Based on TMAKE, we particularly show that CF model and eCK model imply each other under random oracle model. Moreover, we provide a new result on the generic security strengthening transformation (compiler) for building CF‐PFS‐secure TMAKE protocols. In contrast to a previous work, we show that it is possible to apply the transformation to all CF‐secure AKE protocols including all eCK‐secure TMAKE protocols in the random oracle model, without restricting to a small specific class of Diffie–Hellman key based protocols. Copyright © 2015 John Wiley & Sons, Ltd.

Security and Communication Networks•May 19, 2015•4 citations
Traditionally, secure one-round key exchange protocols in the PKI setting have either achieved perfect forward secrecy, or forms of deniability, but not both. On the one hand, achieving perfect forward secrecy against active attackers seems to require some form of authentication of the messages, as in signed Diffie-Hellman style protocols, that subsequently sacrifice deniability. On the other hand, using implicit authentication along the lines of MQV and descendants sacrifices perfect forward secrecy in one round and achieves only weak perfect forward secrecy instead. We show that by reintroducing signatures, it is possible to satisfy both a strong key-exchange security notion as well as a strong form of deniability, in one-round key exchange protocols. Our security notion for key exchange is stronger than, e. g., the extended CK model, and captures perfect forward secrecy. Our notion of deniability, which we call peer-and-time deniability, is stronger than that offered by, e. g., the SIGMA protocol. We propose a concrete protocol and prove that it satisfies our definition of key-exchange security in the random oracle model as well as peer-and-time deniability. The protocol combines a signed-Diffie-Hellman message exchange with an MQV-style key computation, and offers a remarkable combination of advanced security properties and efficiency
This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.
Abstract We examine the recently introduced CF and CF‐perfect forward secrecy (PFS) models for two‐message authenticated key exchange (TMAKE) by Cremers et al., where the difference between CF and CF‐PFS model is that the CF formulates the weak PFS (wPFS), whereas the CF‐PFS formulates the PFS. The CF model is claimed by Cremers et al. to be strictly stronger the previous extended Canetti‐Krawczyk (eCK) model. However, we notice that the implication relations among CF, CF‐PFS, eCK and eCK‐PFS model have not been completely studied. Based on TMAKE, we particularly show that CF model and eCK model imply each other under random oracle model. Moreover, we provide a new result on the generic security strengthening transformation (compiler) for building CF‐PFS‐secure TMAKE protocols. In contrast to a previous work, we show that it is possible to apply the transformation to all CF‐secure AKE protocols including all eCK‐secure TMAKE protocols in the random oracle model, without restricting to a small specific class of Diffie–Hellman key based protocols. Copyright © 2015 John Wiley & Sons, Ltd.