DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem (1998) [42 citations — 4 self]
http://www.ussrback.com/cryptopapers/1998/www-cse.
http://grouper.ieee.org/groups/1363/contributions/
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Michel Abdalla and Mihir Bellare and Phillip Rogaway},
title = {DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem},
year = {1998}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
This paper describes a Diffie-Hellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHAES has not only the "basic" property of secure encryption (namely privacy under a chosen-plaintext attack) but also achieves privacy under both non-adaptive and adaptive chosen-ciphertext attacks. (And hence it also achieves non-malleability.) DHAES is built in a generic way from lower-level primitives: a symmetric encryption scheme, a message authentication code, group operations in an arbitrary group, and a cryptographic hash function. In particular, the underlying group may be an elliptic-curve group or the multiplicative group of integers modulo a prime number. The proofs of security are based on appropriate assumptions about the hardness of the Diffie-Hellman problem and the assumption that the underly...
Citations
No citations identified.
