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

Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement

Stanisław Jarecki, Jihye Kim, Gene Tsudik

Published Jan 1, 2006• 39 citations
Publisher
DOI
10.1007/11967668_19

Related papers

Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange

Stanisław Jarecki, Jihye Kim, Gene Tsudik

Lecture notes in computer science•Apr 4, 2008•49 citations

Affiliation-Hiding Key Exchange with Untrusted Group Authorities

Mark Manulis, Bertram Poettering, Gene Tsudik

Lecture notes in computer science•Jan 1, 2010•16 citations

Group Secret Handshakes or Affiliation-Hiding Authenticated Group Key Agreement

Stanisław Jarecki, Jihye Kim, Gene Tsudik

Abstract. Privacy concerns in many aspects of electronic communication trigger the need to re-examine – with privacy in mind – familiar security services, such as authentication and key agreement. An Affiliation-Hiding Group Key Agreement (AH-AGKA) protocol (also known as Group Secret Handshake) allows a set of participants, each with a certificate issued by the same authority, to establish a common authenticated secret key. In contrast to standard AGKA protocols, an AH-AGKA protocol has the following privacy feature: If Alice, who is a member of a group G, participates in an AH-AGKA protocol, none of the other protocol participants learn whether Alice is a member of G, unless these participants are themselves members of group G. Such protocols are useful in suspicious settings where a set of members of a (perhaps secret) group need to authenticate each other and agree on a common secret key, without revealing their affiliations to outsiders. In this paper we strengthen the prior definition of AH-AGKA so that the security and privacy properties are maintained under any composition of protocol instances. We also construct two novel AH-AGKA protocols secure in this new and stronger model under the RSA and Gap Diffie-Hellman assumptions, respectively. Each protocol involves only two communication rounds and few exponentiations per player (e.g., no bilinear map operations). Interestingly, these costs are essentially the same as those of the underlying (unauthenticated) group key agreement protocol. Finally, our protocols, unlike prior results, retain their security and privacy properties without the use of one-time certificates.

•Jan 1, 2007•0 citations

Secret Key Sharing Based On Authenticated Group Key Transfer Protocol

Anna Suganthi.S, Rajini Girinath D

•Jan 1, 2015•0 citations

One-Round Affiliation-Hiding Authenticated Asymmetric Group Key Agreement with Semi-trusted Group Authority

Chang Liang Xu, Liehuang Zhu, Zhoujun Li +1 more

Affiliation-Hiding Authenticated Asymmetric Group Key Agreement (AH-AAGKA) protocol can be utilized by the members of a group to authenticate each other secretly. The participants affiliated to the group can execute the AH-AAGKA protocol to establish a common encryption key. Any legitimate participant can compute its own decryption key corresponding to the encryption key. Particularly, every legitimate player's affiliation information is only revealed to other legitimate players. In this paper, we present a one-round AH-AAGKA protocol. Compared with previous work, in our protocol, Group Authority (GA) does not need to be fully trusted (we call it semi-trusted). Therefore, GA cannot impersonate any honest user to execute the protocol. Meanwhile, GA can trace group members through analyzing the communication flows. Our protocol holds the affiliation-hiding property and detectability. Additionally, our scheme exhibits Perfect Forward Secrecy for both GA and outside attackers.

The Computer Journal•Oct 6, 2014•6 citations

Authenticated Group Key Agreement Protocol Without Pairing

Gaurav Sharma, Rajeev Anand Sahu, Veronika Kuchta +2 more

Lecture notes in computer science•Jan 1, 2018•5 citations
Abstract. Privacy concerns in many aspects of electronic communication trigger the need to re-examine – with privacy in mind – familiar security services, such as authentication and key agreement. An Affiliation-Hiding Group Key Agreement (AH-AGKA) protocol (also known as Group Secret Handshake) allows a set of participants, each with a certificate issued by the same authority, to establish a common authenticated secret key. In contrast to standard AGKA protocols, an AH-AGKA protocol has the following privacy feature: If Alice, who is a member of a group G, participates in an AH-AGKA protocol, none of the other protocol participants learn whether Alice is a member of G, unless these participants are themselves members of group G. Such protocols are useful in suspicious settings where a set of members of a (perhaps secret) group need to authenticate each other and agree on a common secret key, without revealing their affiliations to outsiders. In this paper we strengthen the prior definition of AH-AGKA so that the security and privacy properties are maintained under any composition of protocol instances. We also construct two novel AH-AGKA protocols secure in this new and stronger model under the RSA and Gap Diffie-Hellman assumptions, respectively. Each protocol involves only two communication rounds and few exponentiations per player (e.g., no bilinear map operations). Interestingly, these costs are essentially the same as those of the underlying (unauthenticated) group key agreement protocol. Finally, our protocols, unlike prior results, retain their security and privacy properties without the use of one-time certificates.
Affiliation-Hiding Authenticated Asymmetric Group Key Agreement (AH-AAGKA) protocol can be utilized by the members of a group to authenticate each other secretly. The participants affiliated to the group can execute the AH-AAGKA protocol to establish a common encryption key. Any legitimate participant can compute its own decryption key corresponding to the encryption key. Particularly, every legitimate player's affiliation information is only revealed to other legitimate players. In this paper, we present a one-round AH-AAGKA protocol. Compared with previous work, in our protocol, Group Authority (GA) does not need to be fully trusted (we call it semi-trusted). Therefore, GA cannot impersonate any honest user to execute the protocol. Meanwhile, GA can trace group members through analyzing the communication flows. Our protocol holds the affiliation-hiding property and detectability. Additionally, our scheme exhibits Perfect Forward Secrecy for both GA and outside attackers.