• Publications
  • Influence
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
  • J. Coron
  • Computer Science
  • CHES
  • 12 August 1999
Differential Power Analysis, first introduced by Kocher et al. in [14], is a powerful technique allowing to recover secret smart card information by monitoring power signals. In [14] a specific DPAExpand
  • 949
  • 151
Merkle-Damgård Revisited: How to Construct a Hash Function
The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The compression function is usually designed from scratch or made out of aExpand
  • 475
  • 46
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
At Eurocrypt 2010 van Dijk et al. described a fully homomorphic encryption scheme over the integers. The main appeal of this scheme (compared to Gentry's) is its conceptual simplicity. ThisExpand
  • 394
  • 39
Practical Multilinear Maps over the Integers
Extending bilinear elliptic curve pairings to multilinear maps is a long-standing open problem. The first plausible construction of such multilinear maps has recently been described by Garg, GentryExpand
  • 380
  • 27
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan's (DGHV) fully homomorphic scheme over the integers from O(λ7) to O(λ5). OurExpand
  • 234
  • 27
Differential Power Analysis in the Presence of Hardware Countermeasures
The silicon industry has lately been focusing on side channel attacks, that is attacks that exploit information that leaks from the physical devices. Although different countermeasures to thwartExpand
  • 428
  • 24
On the Exact Security of Full Domain Hash
  • J. Coron
  • Computer Science
  • 20 August 2000
The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secure in the random oracleExpand
  • 398
  • 23
Optimal Security Proofs for PSS and Other Signature Schemes
  • J. Coron
  • Computer Science
  • 2 May 2002
The Probabilistic Signature Scheme (PSS) designed by Bellare and Rogaway is a signature scheme provably secure against chosen message attacks in the random oracle model, whose security can be tightlyExpand
  • 200
  • 19
Scale-Invariant Fully Homomorphic Encryption over the Integers
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption scheme based on the LWE problem, in which the same modulus is used throughout the evaluation process, instead of aExpand
  • 138
  • 17
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time O(20.337n) and memory O(20.256n), thereby improving a 30-year old algorithmExpand
  • 72
  • 15