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

The Journal of Supercomputing

Deniability and forward secrecy of one-round authenticated key exchange

Haibo Tian, Xiaofeng Chen, Willy Susilo

Published Jun 11, 2013• 6 citations
Publisher
DOI
10.1007/s11227-013-0968-x

Related papers

One-Round Authenticated Key Exchange with Strong Forward Secrecy in the Standard Model against Constrained Adversary

Kazuki Yoneyama

Lecture notes in computer science•Jan 1, 2012•10 citations

On Forward Secrecy in One-Round Key Exchange

Colin Boyd, Juan González Nieto

Lecture notes in computer science•Jan 1, 2011•35 citations

Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security

Hai Huang

Lecture notes in computer science•Jan 1, 2011•11 citations

A Composable Authentication Key Exchange Scheme with Post-Quantum Forward Secrecy

Ming Chen

Journal of Computer Research and Development•Oct 1, 2020•1 citation

One-Round Deniable Key Exchange with Perfect Forward Security.

Weiqiang Wen, Libin Wang, Min Xie

In response to the need for secure one-round authenticated key exchange protocols providing both perfect forward secrecy and full deniability, we put forward a new paradigm for constructing protocols from a Diffie-Hellman type protocol plus a non-interactive designated verifier proof of knowledge (DV-PoK) scheme. We define the notion of DV-PoK which is a variant of non-interactive zero-knowledge proof of knowledge, and provide an efficient DVPoK scheme as a central technical building block of our protocol. The DV-PoK scheme possesses nice properties such as unforgeability and symmetry which help our protocol to achieve perfect forward secrecy and full deniability respectively. Moreover, the security properties are formally proved in the Canetti-Krawczyk model under the Gap Diffie-Hellman assumption. In sum, our protocol offers a remarkable combination of salient security properties and efficiency, and the notion of DV-PoK is of independent interests.

•Jan 1, 2014•3 citations

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

Tribid Debbarma, Anupam Jamatia, Kunal Chakma

Lecture Notes on Software Engineering•Nov 13, 2014•0 citations
In response to the need for secure one-round authenticated key exchange protocols providing both perfect forward secrecy and full deniability, we put forward a new paradigm for constructing protocols from a Diffie-Hellman type protocol plus a non-interactive designated verifier proof of knowledge (DV-PoK) scheme. We define the notion of DV-PoK which is a variant of non-interactive zero-knowledge proof of knowledge, and provide an efficient DVPoK scheme as a central technical building block of our protocol. The DV-PoK scheme possesses nice properties such as unforgeability and symmetry which help our protocol to achieve perfect forward secrecy and full deniability respectively. Moreover, the security properties are formally proved in the Canetti-Krawczyk model under the Gap Diffie-Hellman assumption. In sum, our protocol offers a remarkable combination of salient security properties and efficiency, and the notion of DV-PoK is of independent interests.