Author pages are created from data sourced from our academic publisher partnerships and public sources.

- 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 DPA… Expand

Merkle-Damgård Revisited: How to Construct a Hash Function

- J. Coron, Yevgeniy Dodis, Cécile Malinaud, P. Puniya
- Computer Science
- CRYPTO
- 14 August 2005

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 a… Expand

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

- J. Coron, Avradip Mandal, D. Naccache, Mehdi Tibouchi
- Computer Science
- IACR Cryptol. ePrint Arch.
- 14 August 2011

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. This… Expand

Practical Multilinear Maps over the Integers

- J. Coron, T. Lepoint, Mehdi Tibouchi
- Computer Science, Mathematics
- CRYPTO
- 18 August 2013

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, Gentry… Expand

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

- J. Coron, D. Naccache, Mehdi Tibouchi
- Mathematics, Computer Science
- EUROCRYPT
- 15 April 2012

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). Our… Expand

Differential Power Analysis in the Presence of Hardware Countermeasures

- C. Clavier, J. Coron, N. Dabbous
- Computer Science
- CHES
- 17 August 2000

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 thwart… Expand

On the Exact Security of Full Domain Hash

- J. Coron
- Computer Science
- CRYPTO
- 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 oracle… Expand

Optimal Security Proofs for PSS and Other Signature Schemes

- J. Coron
- Computer Science
- EUROCRYPT
- 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 tightly… Expand

Scale-Invariant Fully Homomorphic Encryption over the Integers

- J. Coron, T. Lepoint, Mehdi Tibouchi
- Computer Science
- Public Key Cryptography
- 26 March 2014

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 a… Expand

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 algorithm… Expand