Results 1 - 10 of 679

Efficient Authenticated Key Agreement Protocol for Dynamic Groups

by Kui Ren, Hyunrok Lee, Kwangjo Kim, Taewhan Yoo
"... Abstract. Group key management presents a fundamental challenge in secure dynamic group communications. In this paper, we propose an efficient group authenticated key agreement protocol (EGAKA), which is designed to be fully distributed and fault-tolerant, provides efficient dynamic group membership ..."
Abstract - Add to MetaCart
Abstract. Group key management presents a fundamental challenge in secure dynamic group communications. In this paper, we propose an efficient group authenticated key agreement protocol (EGAKA), which is designed to be fully distributed and fault-tolerant, provides efficient dynamic group

An Efficient Protocol for Authenticated Key Agreement

by Laurie Law, Alfred Menezes, Minghua Qu, Jerry Solinas, Scott Vanstone - Designs, Codes and Cryptography , 1998
"... This paper proposes a new and efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups. Two modification ..."
Abstract - Cited by 161 (4 self) - Add to MetaCart
This paper proposes a new and efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups. Two

New Multiparty Authentication Services and Key Agreement Protocols

by Giuseppe Ateniese, Michael Steiner, Gene Tsudik - IEEE Journal on Selected Areas in Communications , 2000
"... Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing applications and replicated servers are just a few examples. Given the openness of today's networks, communication among peers (group members) must be secure and, at the same t ..."
Abstract - Cited by 133 (4 self) - Add to MetaCart
time, efficient. 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. It begins by considering 2-party authenticated key agreement and extends the results to Group

Authenticated Group Key Agreement and Friends

by Giuseppe Ateniese, Michael Steiner, Gene Tsudik , 1998
"... Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This ..."
Abstract - Cited by 97 (6 self) - Add to MetaCart
. 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. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellman key

Key Agreement in Dynamic Peer Groups

by Michael Steiner, Gene Tsudik, Michael Waidner - IEEE Transactions on Parallel and Distributed Systems , 2000
"... As a result of the increased popularity of grouporiented applications and protocols, group communication occurs in many different settings: from network multicasting to application layer tele- and video-conferencing. Regardless of the application environment, security services are necessary to provi ..."
Abstract - Cited by 213 (18 self) - Add to MetaCart
to provide communication privacy and integrity. This paper considers the problem of key agreementindynamic peer groups. (Key agreement, especially in a group setting, is the steeping stone for all other security services.) Dynamic peer groups require not only initial key agreement (IKA) but also auxiliary

Group Key Agreement Protocols with Implicit Key Authentication

by Jisoo Kim, Reader Hans-peter, Bischof Date , 2005
"... There have been numerous studies performed on secure group communication over unsecured channels such as the Internet and ad-hoc network. Most of the results are focused on cryptographic methods to share secret keys within the group. In the real world, however, we cannot establish an application for ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
as peer group communication. In the classical design of group key protocols, each peer should be authenticated by a separate and centralized authentication server (e.g. Kerberos). Although many practical protocols present efficient ways for authentication, we are still facing the necessity of optimization

Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups

by Li Zhou, Chinya V. Ravishankar
"... Abstract. We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key is updated, in a tree-based method, it suffices to send the update to a small subset of the group, instead of ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key is updated, in a tree-based method, it suffices to send the update to a small subset of the group, instead

CLIQUES: A New Approach to Group Key Agreement

by M. Steiner, G. Tsudik, M. Waidner, Michael Steiner, Gene Tsudik, Michael Waidner , 1998
"... This paper considers the problem of key agreement in a group setting with highlydynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well-known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocol are secure, eff ..."
Abstract - Cited by 154 (16 self) - Add to MetaCart
This paper considers the problem of key agreement in a group setting with highlydynamic group member population. A protocol suite, called CLIQUES, is developed by extending the well-known Diffie-Hellman key agreement method to support dynamic group operations. Constituent protocol are secure

Communication-efficient group key agreement

by Yongdae Kim, Adrian Perrig, Gene Tsudik , 2001
"... Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overhead and the number of protocol rounds is of secondary concern. The dramatic increase in computation power that we witnes ..."
Abstract - Cited by 69 (10 self) - Add to MetaCart
. The goal of this work is to construct a new protocol that trades off computation with communication efficiency. We resurrect a key agreement protocol previously proposed by Steer et al. We extend it to handle dynamic groups and network failures such as network partitions and merges. The resulting protocol

Scalable Protocols for Authenticated Group Key Exchange

by Jonathan Katz, Moti Yung - Advances in Cryptology — Crypto 2003, LNCS
"... We consider the problem of authenticated group key exchange among n parties communicating over an insecure public network. A number of solutions to this problem have been proposed; however, all prior provably-secure solutions do not scale well and, in particular, require O(n) rounds. Our main contri ..."
Abstract - Cited by 134 (2 self) - Add to MetaCart
, Canetti, and Krawczyk), we first present an efficient compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round
Results 1 - 10 of 679