2001
DOI: 10.1007/3-540-45353-9_12
|View full text |Cite
|
Sign up to set email alerts
|

The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES

Abstract: Abstract. This paper provides security analysis for the public-key encryption scheme DHIES (formerly named DHES and DHAES), which was proposed in [7] and is now in several draft standards. 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 chosen-ciphertext attacks. In this paper we find natural assumptions under which DHIES achi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
381
0
1

Year Published

2005
2005
2022
2022

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 332 publications
(387 citation statements)
references
References 16 publications
5
381
0
1
Order By: Relevance
“…The definition of time-complexity that we use henceforth is the usual one, which includes the maximum of all execution times in the experiments defining the security plus the code size [1]. Note that the advantage of an adversary that simply guesses the bit b is 0 in the above definition due to the rescaling of the probabilities.…”
Section: Security Definitionsmentioning
confidence: 99%
See 1 more Smart Citation
“…The definition of time-complexity that we use henceforth is the usual one, which includes the maximum of all execution times in the experiments defining the security plus the code size [1]. Note that the advantage of an adversary that simply guesses the bit b is 0 in the above definition due to the rescaling of the probabilities.…”
Section: Security Definitionsmentioning
confidence: 99%
“…It is easy to see that, in this case, A ftg cannot gain any information about the hidden bit b used to answer its single Test query. Therefore, the probability that A ror outputs 1 is exactly 1 2 . Now consider the case in which its Test oracle returns the actual sessions keys.…”
Section: B Relations Between Notionsmentioning
confidence: 99%
“…Respectively, they are ECIES (Elliptic Curve Integrated Encryption Scheme) based on the work of Abdalla, Bellare, and Rogaway [7,8], PSEC (Provably Secure Elliptic Curve encryption) based on the work of Fujisaki and Okamoto [22] and ACE (Advanced Cryptographic Engine) based on the work of Cramer and Shoup [21,20]. Recently a new submission of the ElGamal-based KEM scheme in the ECC setting [24] has been adopted by ISO/IEC and an amendment of ISO/IEC 18033-2 specifying this new scheme is in progress.…”
Section: Asymmetric Encryptionmentioning
confidence: 99%
“…Theorem 41 Let Π be the core of the ISO 9798-2.4 protocol implemented with a strongly unforgeable MAC algorithm 1 …”
Section: Matching Conversations ⇒ Acceptancementioning
confidence: 99%