论文信息 - Short Exponent Diffie-Hellman Problems

Short Exponent Diffie-Hellman Problems

In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We first prove that the decisional version of this problem is as hard as two well known hard problems, the standard decisional Diffie-Hellman problem (DDH) and the short exponent discrete logarithm problem. It implies that we can improve the efficiency of ElGamal scheme and Cramer-Shoup scheme under the two widely accepted assumptions. We next derive a similar result for the computational version of this problem.

Takeshi Koshiba | Kaoru Kurosawa

[1] Rosario Gennaro,et al. An Improved Pseudo-random Generator Based on Discrete Log , 2000, CRYPTO.

[2] Avi Wigderson,et al. The Discrete Logarithm Hides O(log n) Bits , 1988, SIAM J. Comput..

[3] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[4] Paul C. van Oorschot,et al. On Diffie-Hellman Key Agreement with Short Exponents , 1996, EUROCRYPT.

[5] René Peralta,et al. Simultaneous Security of Bits in the Discrete Log , 1985, EUROCRYPT.

[6] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.

[7] Claus-Peter Schnorr. Security of Allmost ALL Discrete Log Bits , 1998, Electron. Colloquium Comput. Complex..

[8] Kaoru Kurosawa,et al. How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer , 2004, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[9] Sarvar Patel,et al. An Efficient Discrete Log Pseudo Random Generator , 1998, CRYPTO.

[10] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.