Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Authenticated group key agreement and friends
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
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Use of Elliptic Curves in Cryptography
CRYPTO '85 Advances in Cryptology
Authenticated Multi-Party Key Agreement
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications 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
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Secrecy, authentication, and public key systems.
Secrecy, authentication, and public key systems.
Key agreement in ad hoc networks
Computer Communications
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present a multi-party key agreement protocol based on a novel authenticated two-party elliptic curve Diffie-Hellman (ECDH) key-exchange protocol for dynamic collaborative peer groups. The security of our two-party and multi-party key agreement protocols is based on the computational intractability of the elliptic curve discrete logarithm problem (ECDLP). The strength-per-key-bit is substantially greater in keys generated using ECDH than in keys generated using Diffie-Hellman (DH) key exchange. Thus, with much smaller parameters like the key size, ECDH keys provide equivalent security compared to DH keys. We show that the proposed protocols establish an authenticated, distributed, and contributory group secret key among a group of members. Our multi-party key agreement protocol supports group dynamics like member-join, member-leave, group-fusion, and group-fission securely. Further, it introduces array-based binary key-trees (ABKTs), which are balanced trees that bound the key-computation cost of handling member dynamics to O(log n), where n is the number of members in the group.