Results 1 - 10 of 1,606

REUSING STATIC KEYS IN KEY AGREEMENT PROTOCOLS

by Sanjit Chatterjee, Alfred Menezes, Berkant Ustaoglu
"... Abstract. Contrary to conventional cryptographic wisdom, the NIST SP 800-56A standard explicitly allows the use of a static key pair in more than one of the key establishment protocols described in the standard. In this paper, we give examples of key establishment protocols that are individually sec ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
secure, but which are insecure when static key pairs are reused in two of the protocols. We also propose an enhancement of the extended Canetti-Krawczyk security model and definition for the situation where static public keys are reused in two or more key agreement protocols. 1.

Secret Key Agreement by Public Discussion From Common Information

by Ueli M. Maurer - IEEE Transactions on Information Theory , 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract - Cited by 434 (18 self) - Add to MetaCart
) are derived for the case where X = [X 1 ; : : : ; XN ], Y = [Y 1 ; : : : ; YN ] and Z = [Z 1 ; : : : ; ZN ] result from N independent executions of a random experiment generating X i ; Y i and Z i , for i = 1; : : : ; N . In particular it is shown that such secret key agreement is possible for a scenario

Key Agreement Protocols and their Security Analysis

by Simon Blake-Wilson , Don Johnson, Alfred Menezes , 1997
"... This paper proposes new protocols for two goals: authenticated key agreement and authenticated key agreement with key confirmation in the asymmetric (public-key) setting. A formal ..."
Abstract - Cited by 166 (6 self) - Add to MetaCart
This paper proposes new protocols for two goals: authenticated key agreement and authenticated key agreement with key confirmation in the asymmetric (public-key) setting. A formal

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
key agreement (AKA) operations such as member addition, member deletion and group fusion. We discuss all group key agreement operations and present a concrete protocol suite, CLIQUES, which offers complete key agreement services. CLIQUES is based on multi-party extensions of the well-known Diffie

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

Key Agreement using Statically Keyed Authenticators

by Colin Boyd, Wenbo Mao, Kenneth G. Paterson - Applied Cryptography and Network Security – ACNS 2004, Lecture Notes in Computer Science , 2004
"... A family of authenticators based on static shared keys is identified and proven secure. The authenticators can be used in a variety of settings, including identity-based ones. Application of the authenticators to Di#e-Hellman variants in appropriate groups leads to authenticated key agreement pr ..."
Abstract - Cited by 31 (4 self) - Add to MetaCart
A family of authenticators based on static shared keys is identified and proven secure. The authenticators can be used in a variety of settings, including identity-based ones. Application of the authenticators to Di#e-Hellman variants in appropriate groups leads to authenticated key agreement

ON REUSING EPHEMERAL KEYS IN DIFFIE-HELLMAN KEY AGREEMENT PROTOCOLS

by Alfred Menezes, Berkant Ustaoglu
"... Abstract. A party may choose to reuse ephemeral public keys in a Diffie-Hellman key agreement protocol in order to reduce its computational workload or to mitigate against denial-of-service attacks. In this note we highlight the danger of reusing ephemeral keys if domain parameters are not appropria ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Abstract. A party may choose to reuse ephemeral public keys in a Diffie-Hellman key agreement protocol in order to reduce its computational workload or to mitigate against denial-of-service attacks. In this note we highlight the danger of reusing ephemeral keys if domain parameters

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

Generalized privacy amplification

by Charles H. Bennett, Gilles Brassard, Claude Crkpeau, Ueli M. Maurer, Senior Member - IEEE Transactions on Information Theory , 1995
"... Abstract- This paper provides a general treatment of pri-vacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distill a secret key from a common random variable about which ..."
Abstract - Cited by 325 (19 self) - Add to MetaCart
which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper’s information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield

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
Results 1 - 10 of 1,606