Key Agreement in Dynamic Peer Groups

@article{Steiner2000KeyAI,
  title={Key Agreement in Dynamic Peer Groups},
  author={Michael Steiner and Gene Tsudik and Michael Waidner},
  journal={IEEE Trans. Parallel Distributed Syst.},
  year={2000},
  volume={11},
  pages={769-780}
}
As a result of the increased popularity of group-oriented applications and protocols, group communication occurs in many different settings: from network multicasting to application layer tele- and videoconferencing. Regardless of the application environment, security services are necessary to provide communication privacy and integrity. This paper considers the problem of key agreement in dynamic peer groups. (Key agreement, especially in a group setting, is the stepping stone for all other… Expand
Secure group key agreement
TLDR
By providing the first formal model for group key establishment and investigating carefully the underlying cryptographic assumptions as well as their relations, this thesis formally prove the security of a subset of the protocols based on theSecurity of the Decisional Diffie-Hellman assumption. Expand
Key Agreement for Large-Scale Dynamic Peer Group
TLDR
A new group key agreement protocol, composed of a basic protocol and a dynamic protocol, for large-scale dynamic peer groups, believed to be more efficient than those groupKey agreement protocols built on two-party Diffie- Hellman key agreement Protocol. Expand
Authenticated key agreement in dynamic peer groups
  • X. Yi
  • Computer Science
  • Theor. Comput. Sci.
  • 2004
TLDR
A new authenticated key agreement protocol, composed of a basic protocol and a dynamic protocol, for dynamic peer groups, that offers explicit group key authentication and prevents from both passive and active attacks is proposed. Expand
An interval based contributory key agreement
  • M. Rajaram, T. Suresh
  • Computer Science
  • 2010 International Conference on Wireless Communication and Sensor Computing (ICWCSC)
  • 2010
TLDR
This paper presents an authenticated distributed collaborative key agreement for dynamic peer groups where instead of performing individual rekeying an interval-based approach is used and the Queue-batch algorithm used for re keying substantially reduces the computation and communication cost. Expand
Scalable and fault-tolerant key agreement protocol for dynamic groups
TLDR
This paper proposes a novel framework based on extension of the Diffie-Hellman key exchange protocol that is superior in complexity in both communication and computation overheads required to generate the session key. Expand
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
TLDR
A new key agreement protocol based on identities of mobile users, composed of a basic protocol and a dynamic protocol, for dynamic peer groups, which has security features, such as implicit group key authentication, key confirmation, forward secrecy, key independence, and etc. Expand
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
  • R. Tso, X. Yi, E. Okamoto
  • Computer Science
  • The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)
  • 2007
TLDR
A new key agreement protocol based on identities of mobile users, composed of a basic protocol and a dynamic protocol, for dynamic peer groups, which has security features, such as implicit group key authentication, key confirmation, forward secrecy, key independence, and etc. Expand
An Efficient Transmission over CooperativeGroups Using Hybrid Scheme
TLDR
This paper proposed Hybrid of Group key agreement and public key broadcast encryption to Effective and Secure transmission of data to the remote cooperative groups and provides fully secure data transmission and easy to join a new member in the existing system. Expand
Efficient Authenticated Key Agreement Protocol for Dynamic Groups
TLDR
An efficient group authenticated key agreement protocol (EGAKA) is proposed, which is designed to be fully distributed and fault-tolerant, provides efficient dynamic group membership management, mutual authentication among group members and is secure against both passive and active attacks. Expand
Group Rekeying Scheme for Dynamic Peer Group Security in Collaborative Networks
TLDR
An efficient group key management scheme, in which most group members process one way hash functions and only a few members perform Diffie-Hellman operations, which achieves a new performance minimum while guaranteeing the same level of security as other approaches. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 128 REFERENCES
Authenticated group key agreement and friends
TLDR
This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on e cient and provably secure key authentication, key con rmation and integrity. Expand
New multiparty authentication services and key agreement protocols
TLDR
This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation, and integrity. Expand
Secure group communications using key graphs
TLDR
It is shown that the group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves, and the average measured processing time per join/leave increases linearly with the logarithm of group size. Expand
Secure group communications using key graphs
TLDR
It is shown that the group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves, and the average measured processing time per join/leave increases linearly with the logarithm of group size. Expand
The VersaKey framework: versatile group key management
TLDR
This paper proposes a framework of new approaches for achieving scalable security in IP multicasting, and presents a novel concurrency-enabling scheme, which was devised for fully distributed key management. Expand
Secure group communication in asynchronous networks with failures: integration and experiments
  • J. Stanton, Y. Amir, +6 authors G. Tsudik
  • Computer Science
  • Proceedings 20th IEEE International Conference on Distributed Computing Systems
  • 2000
TLDR
This work leverages the strong properties provided by the Spread group communication system, such as message ordering, clean failure semantics and a membership service to create a secure group communications layer and an API that provide the application programmer with both standard group communication services and flexible security services. Expand
An Identity-Based Key-Exchange Protocol
TLDR
An identity-based approach to the distribution of cryptographic keys is proposed, which is simple and applicable to networks of arbitrary size and can, furthermore, be extended at will. Expand
CLIQUES: a new approach to group key agreement
  • M. Steiner, G. Tsudik, M. Waidner
  • Computer Science
  • Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)
  • 1998
TLDR
A protocol suite, called CLIQUES, is developed by extending the well known Diffie-Hellman key agreement method to support dynamic group operations to solve the problem of key agreement in a group setting with highly dynamic group member population. Expand
Key Management for Multicast: Issues and Architectures
TLDR
This report identifies a technique which allows for secure compromise recovery, while also being robust against collusion of excluded users, and minimizes the number of transmissions required to rekey the multicast group and it imposes minimal storage requirements on the multicasts group. Expand
Diffie-Hellman key distribution extended to group communication
TLDR
This paper considers a class of protocols that are natural extensions of DiffieHellman to the n-party case and argues that these protocols are optimal with respect to certain aspects of protocol complexity. Expand
...
1
2
3
4
5
...