How to construct random functions
Journal of the ACM (JACM)
Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
On the cryptographic applications of random functions
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
A Secure Fault-Tolerant Conference-Key Agreement Protocol
IEEE Transactions on Computers
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
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
Identity Based Authenticated Group Key Agreement Protocol
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Attack on an ID-based authenticated group key agreement scheme from PKC 2004
Information Processing Letters
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Group key management is one of the basic building blocks in securing group communication. A number of solutions to group key exchange have been proposed, but most of them are not scalable and require a number of rounds linear in the number of group members. We formally present a constant-round Identity-based protocol with forward secrecy for group key exchange, which is provably secure in the security model introduced by Bresson et al. Our protocol focuses on round efficiency and the number of communication round is only two. And, the protocol provides a batch verification technique, which simultaneously verifies the validity of messages from other group participants and greatly improves computational efficiency. Moreover, in our protocol, it is no necessary of always-online key generation center during the execution of the protocol compared to other Identity-based protocols.