Results 181 to 190 of about 6,041 (213)

Decidability for Lightweight Diffie-Hellman Protocols

2014 IEEE 27th Computer Security Foundations Symposium, 2014
Many protocols use Diffie-Hellman key agreement, combined with certified long-term values or digital signatures for authentication. These protocols aim at security goals such as key secrecy, forward secrecy, resistance to key compromise attacks, and various flavors of authentication.
Daniel J. Dougherty, Joshua D. Guttman
openaire   +1 more source

A Note on Twin Diffie-Hellman Problem

2009 International Conference on Computational Intelligence and Security, 2009
Recently Cash, Kiltz and Shoup [5] proposed a new computational problem called twin Diffie-Hellman problem. This paper investigates properties of the trapdoor test introduced in [5]. Secondly this paper presents some new relations between the twin Diffie-Hellman problem and the Diffie-Hellman problem.
Mingqiang Wang, Leibo Li
openaire   +1 more source

The probability Distribution of the Diffie-Hellman Key

1993
The probability distribution of the key generated by the Diffie-Hellman Public Key-Distribution system is derived. For different prime factorizations of p−1, where p is the prime modulus of the Diffie-Hellman system, the probabilities of the most and the least likely Diffie-Hellman key are found.
Christian Waldvogel, James L. Massey
openaire   +1 more source

Secure Bilinear Diffie-Hellman Bits

2004
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been used for key exchange protocols.
Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski   +2 more
openaire   +2 more sources

The Diffie–Hellman Problem in Lie Algebras

2007
Cryptography in its present state relies increasingly on complex mathematical theories, e.g., elliptic curves, group theory, etc. We address in this article the problem of proxy signatures and we set this problem in the framework of Lie algebras. We show how to use a chosen maximal set of differentiable automorphisms in order to carry out the task of ...
openaire   +1 more source

A mechanical approach to derive identity-based protocols from Diffie–Hellman-based protocols

Information Sciences, 2014
Kim-Kwang Raymond Choo, Junghyun Nam, Dongho Won   +2 more
exaly  

Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem

Discrete Applied Mathematics, 2006
Eike Kiltz, Arne Winterhof
exaly  

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing, 1999
Ueli M Maurer
exaly  

Strong Diffie-Hellman-DSA Key Exchange

IEEE Communications Letters, 2007
Ik Rae Jeong, Dong Hoon Lee
exaly  

Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring

Information Processing Letters, 1999
Eli Biham, Dan Boneh, Ömer Reingold
exaly