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

Wireless Personal Communications

On the Security of an Efficient and Non-interactive Hierarchical Key Agreement Protocol

Guobin Zhu, Hu Xiong, Zhiguang Qin

Published Jul 22, 2013• 5 citations
Publisher
DOI
10.1007/s11277-013-1328-0

Related papers

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan +2 more

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

International Journal of Embedded Systems•Jan 1, 2019•0 citations

On the security of an efficient two-pass key agreement protocol

Yuh‐Min Tseng

Computer Standards & Interfaces•Dec 10, 2003•5 citations

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Yong Gan, Bingli Wang, Yuan Zhuang +2 more

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

International Journal of Embedded Systems•Jan 1, 2019•1 citation

Security Analysis and Applications of Standard Key Agreement Protocols

Soohyun Oh, Jin Kwak, Seungwoo Lee +1 more

Lecture notes in computer science•Jan 1, 2003•7 citations

A New Tree Quantum Key Agreement Protocol for Secure Multiparty Communication

Rima Djellab, Youssouf Achouri, Malak Emziane +1 more

The Tree Multiparty Quantum Key Agreement Protocol (TMQKAP) is introduced as a novel solution for secure quantum key agreement among multiple participants, specifically tailored for tree topologies. Based on the BB84 protocol, TMQKAP employs hierarchical tree structures and XOR operations to facilitate efficient and secure key generation. Key elements are exchanged among participants in an equitable manner, ensuring that each participant contributes equally to the generation of the shared key. The protocol demonstrates robust security, effectively defending against both external and internal attacks, and achieves a quantum efficiency of 1/2 (N −1), where N is the number of participants. Thorough security analysis and simulations show TMQKAP’s robustness against various attacks while maintaining high efficiency. Additionally, the protocol is readily implementable with current quantum technologies, utilizing single-photon transmission to facilitate secure key distribution.

Journal of Telecommunications and Information Technology•Nov 6, 2024•0 citations

On key agreement protocols based on tamper-proof hardware

Yuliang Zheng A

Information Processing Letters•Jan 1, 1995•7 citations
Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.
Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.
The Tree Multiparty Quantum Key Agreement Protocol (TMQKAP) is introduced as a novel solution for secure quantum key agreement among multiple participants, specifically tailored for tree topologies. Based on the BB84 protocol, TMQKAP employs hierarchical tree structures and XOR operations to facilitate efficient and secure key generation. Key elements are exchanged among participants in an equitable manner, ensuring that each participant contributes equally to the generation of the shared key. The protocol demonstrates robust security, effectively defending against both external and internal attacks, and achieves a quantum efficiency of 1/2 (N −1), where N is the number of participants. Thorough security analysis and simulations show TMQKAP’s robustness against various attacks while maintaining high efficiency. Additionally, the protocol is readily implementable with current quantum technologies, utilizing single-photon transmission to facilitate secure key distribution.