Reading PAGE
Peer Evaluation activity
| Trusted by | 1 |
| Views | 9 |
Total impact ?
Send a 
Michel has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
DHIES: An encryption scheme based on the Diffie-Hellman Problem
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : DHIES: An encryption scheme based on the Diffie-Hellman Problem
Author(s) : Michel Abdalla, Mihir Bellare, and Phillip Rogaway
Subject : unspecified
Area : Computer Science
Language : English
Url : http://www-cse.ucsd.edu/users/mihir/papers/dhaes.ps
Doi : 10.1.1.62.344
Author(s) : Michel Abdalla, Mihir Bellare, and Phillip Rogaway
Abstract : This paper describes a Diffie-Hellman based encryption scheme, DHIES (formerly named DHES and DHAES), which is now in several (draft) standards. 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. DHIES is a Diffie-Hellman based scheme that combines a symmetric encryption method, a message authentication code, and a hash function, in addition to number-theoretic operations, in a way which is intended to provide security against chosenciphertext attacks. The proofs of security are based on the assumption that the underlying symmetric primitives are secure and on appropriate assumptions about the Diffie-Hellman problem. The latter are interesting variants of the customary assumptions on the Diffie-Hellman problem, and we investigate relationships among them, and provide security lower bounds. Our proofs are in the standard model; no random-oracle assumption is required.
Keywords : Cryptographic standards, Diffie-Hellman key exchange, ElGamal encryption, elliptic curve cryptosystems, generic model, provable security.Subject : unspecified
Area : Computer Science
Language : English
| Affiliations : | École normale supérieure |
Doi : 10.1.1.62.344
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Michel's Peer Evaluation activity
| Trusted by | 1 |
- FPeer Evaluation, Publisher, Peer Evaluation.
| Views | 9 |
- 3Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions.
- 3Strong Password-Based Authentication in TLS using the Three-Party Group Diffie-Hellman Protocol
- 1A New Forward-Secure Digital Signature Scheme
- 1Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys
- 1DHIES: An encryption scheme based on the Diffie-Hellman Problem
Michel has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email