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

Computer Networks

Asymmetric group key agreement protocol for open networks and its application to broadcast encryption

Lei Zhang, Qianhong Wu, Bo Qin, Josep Domingo‐Ferrer, Úrsula González-Nicolás

Published Jun 29, 2011• 25 citations
Publisher
DOI
10.1016/j.comnet.2011.06.016

Related papers

An authenticated asymmetric group key agreement based on attribute encryption

Qikun Zhang, Yong Gan, Lu Liu +3 more

Journal of Network and Computer Applications•Aug 31, 2018•59 citations

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol

Lei Zhang, Qianhong Wu, Bo Qin +1 more

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

A Strongly Secure and Efficient Certificateless Authenticated Asymmetric Group Key Agreement Protocol

Haiyan Sun

International Journal of Performability Engineering•Jan 1, 2018•5 citations

An Extended Identity Based Authenticated Asymmetric Group Key Agreement Protocol.

Reddi Siva Ranjani, D. Lalitha Bhaskari, P. S. Avadhani

International journal of network security•Jan 1, 2015•17 citations

Provably secure one-round identity-based authenticated asymmetric group key agreement protocol

Lei Zhang, Qianhong Wu, Bo Qin +1 more

Information Sciences•May 25, 2011•61 citations

Dynamic Authenticated Asymmetric Group Key Agreement With Sender Non-Repudiation and Privacy for Group-Oriented Applications

Rui Zhang, Lei Zhang, Kim‐Kwang Raymond Choo +1 more

Group-oriented applications generally support communications for multiple entities (e.g., users and/or devices) through open networks. Typical requirements of group communications include secrecy, authentication, sender non-repudiation, and sender privacy. However, conventional approaches such as group key agreement and broadcast encryption are generally not designed to achieve all these requirements simultaneously or efficiently. In this article, we propose a one-round dynamic authenticated asymmetric group key agreement with sender non-repudiation and privacy (DAAGKAwSNP) protocol. A key building block of our DAAGKAwSNP protocol is our proposed batch multi-signature scheme with strong unforgeability. We prove that the DAAGKAwSNP protocol achieves secrecy under chosen ciphertext attacks – CCA, assuming the intractability of the computational Diffie-Hellman and k-Bilinear Diffie-Hellman exponent problem. We also evaluate DAAGKAwSNP’s performance to demonstrate its utility.

IEEE Transactions on Dependable and Secure Computing•Dec 28, 2021•39 citations
Group-oriented applications generally support communications for multiple entities (e.g., users and/or devices) through open networks. Typical requirements of group communications include secrecy, authentication, sender non-repudiation, and sender privacy. However, conventional approaches such as group key agreement and broadcast encryption are generally not designed to achieve all these requirements simultaneously or efficiently. In this article, we propose a one-round dynamic authenticated asymmetric group key agreement with sender non-repudiation and privacy (DAAGKAwSNP) protocol. A key building block of our DAAGKAwSNP protocol is our proposed batch multi-signature scheme with strong unforgeability. We prove that the DAAGKAwSNP protocol achieves secrecy under chosen ciphertext attacks – CCA, assuming the intractability of the computational Diffie-Hellman and k-Bilinear Diffie-Hellman exponent problem. We also evaluate DAAGKAwSNP’s performance to demonstrate its utility.