Results 1  10
of
2,976,378
Strongly secure authenticated key exchange protocol based on computational DiffieHellman problem. Cryptology ePrint Archive, Report 2008/500, 2008. Available from: http://eprint.iacr.org/2008/500
"... Abstract. Currently, there are a lot of authenticated key exchange (AKE) protocols in literature. However, the security proofs of this kind of protocols have been established to be a nontrivial task. The main issue is that without static private key it is difficult for simulator to fully support th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
the SessionKeyReveal and EphemeralKeyReveal queries. Some proposals which have been proven secure either just hold in relatively weak models which do not fully support abovementioned two queries or make use of the stronger gap assumption. In this paper, using a new technique named twin DiffieHellman problem
Variations of diffiehellman problem
 In ICICS ’03, volume 2836 of LNCS
, 2003
"... Abstract. This paper studies various computational and decisional DiffieHellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational DiffieHellman problem: square DiffieHellman problem, inverse DiffieHellman problem and d ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
Abstract. This paper studies various computational and decisional DiffieHellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational DiffieHellman problem: square DiffieHellman problem, inverse DiffieHellman problem
The Decision DiffieHellman Problem
, 1998
"... The Decision DiffieHellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this are ..."
Abstract

Cited by 241 (6 self)
 Add to MetaCart
The Decision DiffieHellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
A New Identification Scheme based on the Bilinear DiffieHellman Problem
 In Proc. ACISP 2002, volume 2384 of LNCS
, 2002
"... We construct an interactive identification scheme based on the bilinear DiffieHellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identityvariance provided that an algorithm of computing the Weilpairing is feasible ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We construct an interactive identification scheme based on the bilinear DiffieHellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identityvariance provided that an algorithm of computing the Weil
DiffieHellman
, 2010
"... ◮ Asymmetric or publickey cryptography ◮ Originally attributed to Diffie and Hellman in 1975, but later discovered in British classified work of James Ellis in 1971 ◮ Basic idea involves altering traditional symmetry of cryptographic protocols to convey additional info in a public key. The message ..."
Abstract
 Add to MetaCart
◮ Asymmetric or publickey cryptography ◮ Originally attributed to Diffie and Hellman in 1975, but later discovered in British classified work of James Ellis in 1971 ◮ Basic idea involves altering traditional symmetry of cryptographic protocols to convey additional info in a public key. The message
A New Identification Scheme based on the Gap DiffieHellman Problem
, 2002
"... We introduce a new identification scheme based on the Gap DiffieHellman problem. Our identification scheme makes use of the fact that the computational DiffieHellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional DiffieH ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a new identification scheme based on the Gap DiffieHellman problem. Our identification scheme makes use of the fact that the computational DiffieHellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional DiffieHellman
The equivalence of the computational Diffie–Hellman and discrete logarithm problems in certain groups
, 2012
"... Whether the discrete logarithm problem can be reduced to the Diffie–Hellman problem is a celebrated open question. The security of Diffie–Hellman key exchange and other cryptographic protocols rests on the assumed difficulty of the computational Diffie–Hellman problem; such a reduction would show th ..."
Abstract
 Add to MetaCart
Whether the discrete logarithm problem can be reduced to the Diffie–Hellman problem is a celebrated open question. The security of Diffie–Hellman key exchange and other cryptographic protocols rests on the assumed difficulty of the computational Diffie–Hellman problem; such a reduction would show
Timing Attacks on Implementations of DiffieHellman, RSA, DSS, and Other Systems
, 1996
"... By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known cip ..."
Abstract

Cited by 644 (3 self)
 Add to MetaCart
By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known
Results 1  10
of
2,976,378