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

One-Round Attribute-Based Key Exchange in the Multi-party Setting

Yangguang Tian, Guomin Yang, Yi Mu, Kaitai Liang, Yong Hong Yu

Published Jan 1, 2016• 5 citations
Publisher
DOI
10.1007/978-3-319-47422-9_13

Related papers

Two-Party Round-Optimal Session-Policy Attribute-Based Authenticated Key Exchange without Random Oracles

Kazuki Yoneyama

Lecture notes in computer science•Jan 1, 2012•3 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•106 citations

Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange.

Suvradip Chakraborty, Srinivasan Raghuraman, Chandrasekharan Pandu Rangan

•Jan 1, 2015•0 citations

One-round and authenticated three-party multiple key exchange protocol from parings.

Feng Liu

•Jan 1, 2010•2 citations

One-Round Attribute-Based Key Exchange in the Multi-Party Setting

Yangguang Tian, Guomin Yang, Yi Mu +3 more

Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.

International Journal of Foundations of Computer Science•Sep 1, 2017•1 citation

Attribute-Based Authenticated Key Exchange

M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto

Lecture notes in computer science•Jan 1, 2010•56 citations
Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.