Constructing UC secure and constant-round group key exchange protocols via secret sharing

Authors:
Chunjie Cao;Chao Yang;Jianfeng Ma;Sangjae Moon
Affiliations:
Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China and Research Institute of China Electronic Technology Corporation (CETC), Jiaxing, Zhejiang, China;Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China;Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China;Mobile Network Security Technology Research Center, Kyungpook National University, Daeyu, South Korea
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2008

Citing 27
Cited 0

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
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

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
Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
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
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Universally Composable Notions of Key Exchange and Secure Channels

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
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
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tree-based group key agreement

ACM Transactions on Information and System Security (TISSEC)
Attack on an ID-based authenticated group key agreement scheme from PKC 2004

Information Processing Letters
Modeling insider attacks on group key-exchange protocols

Proceedings of the 12th ACM conference on Computer and communications security
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Password-Based group key exchange in a constant number of rounds

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
New multiparty authentication services and key agreement protocols

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (UC) framework. The resultant protocol focuses on round efficiency and three rounds of communication are required. The protocol allows the batch verification of messages signed by all other group participants. Moreover, compared with other identity-based protocols, the key generation center (KGC) in our protocol is not always online.