Practical and provably-secure multicasting over high-delay networks

Authors:
Junghyun Nam;Hyunjue Kim;Seungjoo Kim;Dongho Won;Hyungkyu Yang
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon-si, Gyeonggi-do, Korea;Department of Computer Engineering, Kangnam University, Yongin-si, Gyeonggi-do, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 13
Cited 1

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Communication complexity of group key distribution

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Simple and fault-tolerant key agreement for dynamic collaborative groups

Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups

IEEE Transactions on Parallel and Distributed Systems
Provably authenticated group Diffie-Hellman key exchange

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Communication-Efficient Group Key Agreement

IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Round-Optimal Contributory Conference Key Agreement

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An Integrated Solution for Secure Group Communication in Wide-Area Networks

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
On the performance of group key agreement protocols

ACM Transactions on Information and System Security (TISSEC)
Authenticated key exchange secure against dictionary attacks

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Secure and efficient ID-based group key agreement fitted for Pay-TV

PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.