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

Anonymity-Based Authenticated Key Agreement with Full Binding Property

Jung Yeon Hwang, Sungwook Eom, Ku-Young Chang, Pil Joong Lee, DaeHun Nyang

Published Jan 1, 2012• 10 citations
Publisher
DOI
10.1007/978-3-642-35416-8_13

Related papers

A lightweight authentication and key agreement protocol preserving user anonymity

Morteza Nikooghadam, Reza Jahantigh, Hamed Arshad

Multimedia Tools and Applications•Jul 15, 2016•67 citations

Provably secure anonymous authenticated key agreement protocols with enhanced security models

Xie Qing, Tan X, Hu B +4 more

Science•Jan 1, 2018•4 citations

Anonymity-based authenticated key agreement with full binding property

Jung Yeon Hwang, Sungwook Eom, Ku-Young Chang +2 more

In this paper, we consider some aspects of binding properties that bind an anonymous user with messages. According to whether all the messages or some part of the messages are bound with an anonymous user, the protocol is said to satisfy the full binding property or the partial binding property, respectively. We propose methods to combine binding properties and anonymity-based authenticated key agreement protocols. Our protocol with the full binding property guarantees that while no participant's identity is revealed, a participant completes a key agreement protocol confirming that all the received messages came from the other participant. Our main idea is to use an anonymous signature scheme with a signer-controlled yet partially enforced linkability. Our protocols can be modified to provide additional properties, such as revocable anonymity. We formally prove that the constructed protocols are secure.

Journal of Communications and Networks•Apr 1, 2016•6 citations

Simple and Provably Secure Anonymous Authenticated Key Exchange with a Binding Property

Kyungho Son, Dong‐Guk Han, Dongho Won

In this work we propose a two-party anonymous authenticated key exchange protocol that provides a communication binding property. The proposed protocol makes use of a compact structure to ensure key exchange and anonymity by adopting an anonymous implicit proof on the possession of a credential. We formally prove that the proposed protocol achieves anonymity, AKE-security, and a communication binding property. The protocol yields short communication messages and runs in two rounds. We show that our protocol is efficient via a comparison analysis with best-known anonymous authenticated key exchange protocols.

IEICE Transactions on Communications•Jan 1, 2015•2 citations

Efficient Identity-Based and Authenticated Key Agreement Protocol

Yongge Wang

Lecture notes in computer science•Jan 1, 2013•90 citations

An Enhancement of Authenticated Key Agreement Protocol

L. Seung-Yeon, Yu-Nam Kim, Huh E.N

Proceedings of the Korean Information Science Society Conference•Jan 1, 2005•0 citations
In this paper, we consider some aspects of binding properties that bind an anonymous user with messages. According to whether all the messages or some part of the messages are bound with an anonymous user, the protocol is said to satisfy the full binding property or the partial binding property, respectively. We propose methods to combine binding properties and anonymity-based authenticated key agreement protocols. Our protocol with the full binding property guarantees that while no participant's identity is revealed, a participant completes a key agreement protocol confirming that all the received messages came from the other participant. Our main idea is to use an anonymous signature scheme with a signer-controlled yet partially enforced linkability. Our protocols can be modified to provide additional properties, such as revocable anonymity. We formally prove that the constructed protocols are secure.
In this work we propose a two-party anonymous authenticated key exchange protocol that provides a communication binding property. The proposed protocol makes use of a compact structure to ensure key exchange and anonymity by adopting an anonymous implicit proof on the possession of a credential. We formally prove that the proposed protocol achieves anonymity, AKE-security, and a communication binding property. The protocol yields short communication messages and runs in two rounds. We show that our protocol is efficient via a comparison analysis with best-known anonymous authenticated key exchange protocols.