CryptoDB
The Static Diffie-Hellman Problem
| Authors: | |
|---|---|
| Download: | |
| Abstract: | The static Diffie-Hellman problem (SDHP) is the special case of the classic Diffie-Hellman problem where one of the public keys is fixed. We establish that the SDHP is almost as hard as the associated discrete logarithm problem. We do this by giving a reduction that shows that if the SDHP can be solved then the associated private key can be found. The reduction also establishes that certain systems have less security than anticipated. The systems affected are based on static Diffie-Hellman key agreement and do not use a key derivation function. This includes some cryptographic protocols: basic ElGamal encryption; Chaum and van Antwerpen's undeniable signature scheme; and Ford and Kaliski's key retrieval scheme, which is currently being standardized in IEEE P1363.2. |
BibTeX
@misc{eprint-2004-12272,
title={The Static Diffie-Hellman Problem},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Static Diffie-Hellman, ElGamal Encryption, Ford-Kaliski Key Retrieval, Provable Security},
url={http://eprint.iacr.org/2004/306},
note={Submitted to Eurocrypt 2005 (preliminary version) dbrown@certicom.com 12958 received 15 Nov 2004, last revised 24 Jun 2005},
author={Daniel R. L. Brown and Robert P. Gallant},
year=2004
}