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

Secure and Efficient ID-Based Group Key Agreement Fitted for Pay-TV

Hyunjue Kim, Junghyun Nam, Seungjoo Kim, Dongho Won

Published Jan 1, 2005• 8 citations
Publisher
DOI
10.1007/11582267_11

Related papers

Efficient ID-based Group Key Agreement with Bilinear Maps

Kyu Young Choi, Jung Yeon Hwang, Dong Hoon Lee

Lecture notes in computer science•Jan 1, 2004•137 citations

Efficient ID-Based Authenticated Group Key Agreement from Bilinear Pairings

Lan Feng Zhou, Willy Susilo, Yi Mu

Lecture notes in computer science•Jan 1, 2006•17 citations

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

TELKOMNIKA Indonesian Journal of Electrical Engineering•Oct 1, 2014•0 citations

Security of an Efficient ID-Based Authenticated Key Agreement Protocol from Pairings

Shengbao Wang, Zhenfu Cao, Haiyong Bao

Lecture notes in computer science•Jan 1, 2005•14 citations

Secure One-to-Group Communications Escrow-Free ID-Based Asymmetric Group Key Agreement

Lei Zhang, Qianhong Wu, Josep Domingo‐Ferrer +3 more

Lecture notes in computer science•Jan 1, 2014•6 citations

Two-round ID-based Group Key Agreement Fitted for Pay-TV System

Hyunjue Kim, Nam Junghyun, Kim Seungjoo +1 more

A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.

Information Security and Cryptology•Jan 1, 2005•0 citations
A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.