• What's new
• Archive
• Best Papers
• Videos
• Authors
• Coauthors
• By year
• By conference
• All Committees
• Most Committees
• Report errors
• Maps
• About

Jean-Sébastien Coron  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2012	Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers	eurocrypt	446-464
2	2011	Fully Homomorphic Encryption over the Integers with Shorter Public Keys	crypto	483
3	2011	Improved Generic Algorithms for Hard Knapsacks	eurocrypt	364
4	2011	Cryptanalysis of the RSA Subgroup from TCC 2005	pkc	147
5	2010	A Domain Extender for the Ideal Cipher	tcc	273-289
6	2010	Efficient Indifferentiable Hashing into Ordinary Elliptic Curves	crypto	237-254
7	2010	Analysis and Improvement of the Random Delay Countermeasure of CHES 2009	ches	95-109
8	2010	On The Broadcast and Validity-Checking Security of PKCS \#1 v1.5 Encryption	eprint	online
9	2009	Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures	crypto	428-444
10	2009	PSS Is Secure against Random Fault Attacks	asiacrypt	653-666
11	2009	Fault Attacks on RSA Signatures with Partially Unknown Messages	ches	444-456
12	2009	An Efficient Method for Random Delay Generation in Embedded Software	ches	156-170
13	2008	The Random Oracle Model and the Ideal Cipher Model are Equivalent	eprint	online
14	2008	Cryptanalysis of ISO/IEC 9796-1	jofc	27-51
15	2008	The Random Oracle Model and the Ideal Cipher Model Are Equivalent	crypto	1-20
16	2008	Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform	ches	1-14
17	2007	Side Channel Cryptanalysis of a Higher Order Masking Scheme	ches	28-44
18	2007	On the Implementation of a Fast Prime Generation Algorithm	ches	443-449
19	2007	Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach	crypto	379-394
20	2007	Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring	jofc	39-50
21	2005	From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited	pkc	online
22	2005	A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis	ches	online
23	2005	Merkle-Damgård Revisited: How to Construct a Hash Function	crypto	430-448
24	2005	Secure Delegation of Elliptic-Curve Pairing	eprint	online
25	2004	Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem	pkc	online
26	2004	Finding Small Roots of Bivariate Integer Polynomial Equations Revisited	eurocrypt	online
27	2004	Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring	eprint	online
28	2004	Cryptanalysis of a Provably Secure Cryptographic Hash Function	eprint	online
29	2004	Externalized Fingerprint Matching	eprint	online
30	2003	Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption	asiacrypt	online
31	2003	A New Algorithm for Switching from Arithmetic to Boolean Masking	ches	89-97
32	2003	Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem	eprint	online
33	2003	Cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem	eprint	online
34	2002	Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages	eprint	online
35	2002	Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages	pkc	17-33
36	2002	Universal Padding Schemes for RSA	eprint	online
37	2002	Optimal Security Proofs for PSS and Other Signature Schemes	eurocrypt	online
38	2002	Security Proof for Partial-Domain Hash Signature Schemes	crypto	online
39	2002	Universal Padding Schemes for RSA	crypto	online
40	2001	Cryptanalysis of RSA Signatures with Fixed-Pattern Padding	crypto	433-439
41	2001	Optimal security proofs for PSS and other signature schemes	eprint	online
42	2000	From Fixed-Length to Arbitrary-Length RSA Padding Schemes	asiacrypt	90-96
43	2000	New Attacks on PKCS#1 v1.5 Encryption	eurocrypt	369-381
44	2000	Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme	eurocrypt	91-101
45	2000	Differential Power Analysis in the Presence of Hardware Countermeasures	ches	252-263
46	2000	On Boolean and Arithmetic Masking against Differential Power Analysis	ches	231-237
47	2000	On the Exact Security of Full Domain Hash	crypto	229-235
48	1999	ECC: Do We Need to Count?	asiacrypt	122-134
49	1999	On the Security of Random Sources	pkc	29-42
50	1999	On the Security of RSA Screening	pkc	197-203
51	1999	Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems	ches	292-302
52	1999	On the Security of RSA Padding	crypto	1-18