CiteSeerX — Search Results — decisional diffie-hellman problem

Results 1 - 10 of 901

The Decisional Diffie-Hellman Problem and the Uniform Boundedness Theorem ∗

by Qi Cheng, Shigenori Uchiyama , 2003

"... In this paper, we propose an algorithm to solve the Decisional Diffie-Hellman problem over finite fields, whose time complexity depends on the effective bound in the Uniform Boundedness Theorem (UBT). We show that curves which are defined over a number field of small degree but have a large torsion ..."

Abstract - Add to MetaCart

In this paper, we propose an algorithm to solve the Decisional Diffie-Hellman problem over finite fields, whose time complexity depends on the effective bound in the Uniform Boundedness Theorem (UBT). We show that curves which are defined over a number field of small degree but have a large torsion

On the Decisional Diffie-Hellman Problem in genus 2

by Jordi Pujolàs Boix, Departament Matemàtica, Aplicada Iv, Jordi Pujolàs Boix

"... Memòria presentada per optar al grau de Doctor en Matemàtiques. Barcelona, juliol de 2006. Directors: Dra. Paz Morillo, Dr. Steven GalbraithResum En aquesta tesi tractem el problema Decisional de Diffie-Hellman en el grup de punts de la varietat Jacobiana de corbes supersingulars de gènere dos sobre ..."

Abstract - Add to MetaCart

Memòria presentada per optar al grau de Doctor en Matemàtiques. Barcelona, juliol de 2006. Directors: Dra. Paz Morillo, Dr. Steven GalbraithResum En aquesta tesi tractem el problema Decisional de Diffie-Hellman en el grup de punts de la varietat Jacobiana de corbes supersingulars de gènere dos

http://www.rhul.ac.uk/mathematics/techreports On the Decisional Diffie-Hellman Problem

by Jordi Pujolàs Boix, Jordi Pujolàs Boix, Departament Matemàtica, Aplicada Iv, Jordi Pujolàs Boix , 2009

Abstract - Add to MetaCart

Variations of diffie-hellman problem

by Feng Bao, Robert H. Deng, Huafei Zhu - In ICICS ’03, volume 2836 of LNCS , 2003

"... Abstract. This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and d ..."

Abstract - Cited by 38 (1 self) - Add to MetaCart

Abstract. This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem

A New Identification Scheme based on the Bilinear Diffie-Hellman Problem

by Myungsun Kim, Kwangjo Kim - In Proc. ACISP 2002, volume 2384 of LNCS , 2002

"... We construct an interactive identification scheme based on the bilinear Diffie-Hellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identity-variance provided that an algorithm of computing the Weil-pairing is feasible ..."

Abstract - Cited by 5 (1 self) - Add to MetaCart

field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. Finally, this scheme is compared with other identification schemes.

A New Identification Scheme based on the Gap Diffie-Hellman Problem

by Myungsun Kim, Kwangjo Kim , 2002

"... We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-H ..."

Abstract - Cited by 1 (0 self) - Add to MetaCart

We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman

Efficient signature schemes with tight reductions to the Diffie-Hellman problems

by Eu-jin Goh, Jonathan Katz, Nan Wang - Journal of Cryptology

"... We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. Security of our first scheme relies on the hardness of the computational Diffie-Hellman problem; security of our second scheme — which is more efficient ..."

Abstract - Cited by 11 (0 self) - Add to MetaCart

efficient than the first — is based on the hardness of the decisional Diffie-Hellman problem, a stronger assumption. Given current state of the art, it is as difficult to solve the Diffie-Hellman problems as it is to solve the discrete logarithm problem in many groups of cryptographic interest. Thus

Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme

by Alexandra Boldyreva - PROCEEDINGS OF PKC 2003, VOLUME 2567 OF LNCS , 2003

"... We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on t ..."

Abstract - Cited by 191 (0 self) - Add to MetaCart

We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based

Conjectured security of the ANSI-NIST Elliptic Curve RNG, Cryptology ePrint Archive, Report 2006/117

by Daniel R. L. Brown , 2006

"... An elliptic curve random number generator (ECRNG) has been proposed in ANSI and NIST draft standards. This paper proves that, if three conjectures are true, then the ECRNG is secure. The three conjectures are hardness of the elliptic curve decisional Diffie-Hellman problem and the hardness of two ne ..."

Abstract - Cited by 3 (0 self) - Add to MetaCart

An elliptic curve random number generator (ECRNG) has been proposed in ANSI and NIST draft standards. This paper proves that, if three conjectures are true, then the ECRNG is secure. The three conjectures are hardness of the elliptic curve decisional Diffie-Hellman problem and the hardness of two

A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. Cryptology ePrint Archive, Report 2007/048

by Daniel R. L. Brown, Kristian Gjøsteen , 2007

"... An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjectures are true, then the ECRNG is secure. The three conjectures are hardness of the elliptic curve decisional Diffie-Hellman ..."

Abstract - Cited by 6 (1 self) - Add to MetaCart

problem and the hardness of two newer problems, the x-logarithm problem and the truncated point problem. The x-logarithm problem is shown to be hard if the decisional Diffie-Hellman problem is hard, although the reduction is not tight. The truncated point problem is shown to be solvable when the minimum

Results 1 - 10 of 901

Tools