Jean-Sébastien Coron

Artificial Intelligence · 2000–2014

A researcher in the Science corpus: 8 papers; trusts 16 researchers and is trusted by 58 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 59 citations into it; #2,536 of 35,345 by trust here, #5,187 by citations
• Computational Theory and Mathematics — 23 citations into it; #1,203 of 12,182 by trust here, #1,083 by citations
• Computer Vision and Pattern Recognition — 20 citations into it
• Privacy & Security — 19 citations into it; #479 of 709 by trust here, #642 by citations
• Information Systems — 15 citations into it; #332 of 8,771 by trust here, #1,625 by citations
• Mathematical Optimization — 5 citations into it

Whom Jean-Sébastien Coron trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Craig Gentry
2. Zvika Brakerski
3. Pascal Paillier
4. Mihir Bellare
5. Vinod Vaikuntanathan
6. R. Rivest
7. Shafi Goldwasser
8. Shai Halevi
9. Phong Q. Nguyen
10. Marten van Dijk

Who trusts Jean-Sébastien Coron overall

1. Dan Boneh
2. Erdinç Öztürk
3. Yarkin Doröz
4. Ciara Moore
5. Xiaolin Cao
6. Craig Gentry
7. Josef Kittler
8. Abbas Acar
9. Hovav Shacham
10. Tatsuaki Okamoto

Papers from Jean-Sébastien Coron's perspective

Ordered by how strongly the researchers Jean-Sébastien Coron trusts endorse each paper. Same corpus, a different order for every researcher.

1. Random oracles are practical: a paradigm for designing efficient protocols
2. A method for obtaining digital signatures and public-key cryptosystems
3. New Directions in Cryptography
4. A fully homomorphic encryption scheme
5. Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
6. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
7. Fully homomorphic encryption using ideal lattices
8. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
9. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
10. On lattices, learning with errors, random linear codes, and cryptography

Their papers

• Practical Multilinear Maps over the Integers (2013) — 435 citations
• On the Exact Security of Full Domain Hash (2000) — 443 citations
• Scale-Invariant Fully Homomorphic Encryption over the Integers (2014) — 199 citations
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys (2011) — 487 citations
• Batch Fully Homomorphic Encryption over the Integers (2013) — 376 citations
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (2012) — 299 citations
• Merkle-Damgård Revisited: How to Construct a Hash Function (2005) — 603 citations
• Differential Power Analysis in the Presence of Hardware Countermeasures (2000) — 481 citations