On the Exact Security of Full Domain Hash

By Jean-Sébastien Coron. Annual International Cryptology Conference, 2000

443 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/085b9a272ba75f19255cafce058e5fe8c496b51d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Identity-Based Encryption from the Weil Pairing (2001, methodology): “The analysis used in the proof of Lemma 4.2 uses a similar technique to Coron’s analysis of the Full Domain Hash signature scheme [9].”
Short Signatures from the Weil Pairing (2001, background): “[16℄ J.-S. Coron.”
Compact Proofs of Retrievability (2008, methodology): “Our techniques are similar to those used by Coron [8] for tight proofs of signature schemes.”
Toward Hierarchical Identity-Based Encryption (2002, methodology): “We do so in a manner similar to that used in the analysis of the Boneh-Franklin scheme [1], which is itself partly based on a technique of Coron [5].”
Advances in Cryptology – CRYPTO 2004 (2004, methodology): “implemented by using windowing techniques, as described in [15].”
A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data (2013, methodology): “The same analysis as that of Coron [9] shows that Pr[¬E] = 1/e(qenc + 1), where e is the base for the natural logarithm.”
Trapdoors for hard lattices and new cryptographic constructions (2008, methodology): “This stands in constrast to the best known reductions for FDH using trapdoor permutations: for trapdoor permutations treated as a black-box, the reduction must lose a factor of Qhash [23]; for RSA and claw-free permutations, the known reductions still lose a factor of Qsign [19, 23]).”
Sequential Aggregate Signatures from Trapdoor Permutations (2004, background): “The following theorem, due to Coron, shows the security of full-domain signatures under the adaptive chosen message attack in the random oracle model.”
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003, background): “This scheme is proven to meet the standard security notion for digital signatures of [18] in the random oracle model assuming that RSA is one-way [8, 13], but this result will not help us here.”
Public Key Encryption with Keyword Search (2004, background): “We first argue as in [6] that both events E1 and E2 occur with sufficiently high probability.”
Provably authenticated group Diffie-Hellman key exchange (2001, methodology): “The idea is to use a technique similar to the one used by Coron [16] and to use the random self-reducibility of G-DDHΓ to generate many instances D′ from D such that all the D′ lie in the”
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes (2001, methodology): “The success probability is exactly the same as for the full-domain hash technique [10]”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, methodology): “Security in the random oracle model is shown using a similar argument to Coron’s analysis [15] of the Full Domain Hash [5].”
Formal certification of code-based cryptographic proofs (2009, background): “Our next objective is to formalize Coron’s proof [16], which improves the conventional bound of FDH given above by eliminating the dependency on qhash.”