Results 1  10
of
2,109
Provably secure passwordauthenticated key exchange using DiffieHellman
, 2000
"... Abstract. When designing passwordauthenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who ob ..."
Abstract

Cited by 189 (12 self)
 Add to MetaCart
obtains this information may be able to run an offline dictionary attack to determine the correct password. We present a new protocol called PAK which is the first DiffieHellmanbased passwordauthenticated key exchange protocol to provide a formal proof of security (in the random oracle model) against
DHAES: An Encryption Scheme Based on the DiffieHellman Problem
, 1998
"... This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHAES has no ..."
Abstract

Cited by 59 (5 self)
 Add to MetaCart
This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHAES has
DHIES: An encryption scheme based on the DiffieHellman Problem
, 2001
"... This paper describes a DiffieHellman based encryption scheme, DHIES (formerly named DHES and DHAES), which is now in several (draft) standards. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under app ..."
Abstract
 Add to MetaCart
among them, and provide security lower bounds. Our proofs are in the standard model; no randomoracle assumption is required. Keywords: Cryptographic standards, DiffieHellman key exchange, ElGamal encryption, elliptic curve
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
A Pairwise Key PreDistribution Scheme for Wireless Sensor Networks
, 2003
"... this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resili ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network
Hardness Computing Bits of Secret Keys in DiffieHellman and Related Schemes
, 1996
"... We show that computing the most significant bits of the secret key in a DiffieHellman keyexchange protocol from the public keys of the participants is as hard as computing the secret key itself. This is done by studying the following hidden number problem: Given an oracle O ff;fi (x) that on input ..."
Abstract
 Add to MetaCart
We show that computing the most significant bits of the secret key in a DiffieHellman keyexchange protocol from the public keys of the participants is as hard as computing the secret key itself. This is done by studying the following hidden number problem: Given an oracle O ff;fi (x) that on input
Internet Key Exchange (IKEv2) Protocol
, 2003
"... This document is an InternetDraft and is subject to all provisions of Section 10 of RFC2026. InternetDrafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as InternetDrafts. Inter ..."
Abstract

Cited by 288 (1 self)
 Add to MetaCart
This document is an InternetDraft and is subject to all provisions of Section 10 of RFC2026. InternetDrafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as InternetDrafts. InternetDrafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use InternetDrafts as reference material or to cite them other than as "work in progress." The list of current InternetDrafts can be accessed at
Complexity Results for Security Protocols with DiffieHellman Exponentiation and Commuting Public Key Encryption
 In Paritosh K. Pandya and Jaikumar Radhakrishnan, editors, FSTTCS, volume 2914 of Lecture Notes in Computer Science
, 2003
"... We show that the insecurity problem for protocols with modular exponentiation and arbitrary products allowed in exponents is NPcomplete. This result is based on a protocol and intruder model which is powerful enough to uncover known attacks on the Authenticated Group DiffieHellman (AGDH.2) protoc ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We show that the insecurity problem for protocols with modular exponentiation and arbitrary products allowed in exponents is NPcomplete. This result is based on a protocol and intruder model which is powerful enough to uncover known attacks on the Authenticated Group DiffieHellman (AGDH.2
Submission to IEEE P1363a. DHAES: An Encryption Scheme Based on the DiffieHellman Problem
, 1998
"... Abstract This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHA ..."
Abstract
 Add to MetaCart
Abstract This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show
Results 1  10
of
2,109