• What's new
• Archive
• Paper awards
• Videos
• Authors
• Coauthors
• By year
• By venue
• All Committees
• Most Committees
• Report errors
• About

Pascal Paillier  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2018	Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression	jofc	885-916
2	2018	Fast Homomorphic Evaluation of Deep Discretized Neural Networks	crypto	483-512
3	2016	Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression	fse	online
4	2015	How to Compress Homomorphic Ciphertexts	eprint	113
5	2012	Generating Provable Primes Efficiently on Embedded Devices	pkc	online
6	2009	Fault Attacks on RSA Signatures with Partially Unknown Messages	ches	online
7	2008	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions	jofc	350-391
8	2006	Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption	asiacrypt	online
9	2006	Fast Generation of Prime Numbers on Portable Devices: An Update	ches	online
10	2006	Encoding-Free ElGamal Encryption Without Random Oracles	pkc	online
11	2005	Universally Convertible Directed Signatures	asiacrypt	online
12	2005	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log	asiacrypt	online
13	2005	On Second-Order Differential Power Analysis	ches	online
14	2005	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions	crypto	online
15	2005	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions	eprint	online
16	2004	How to Disembed a Program?	ches	online
17	2004	How to Disembed a Program?	eprint	online
18	2003	Faster Double-Size Modular Multiplication from Euclidean Multipliers	ches	214-227
19	2003	GCD-Free Algorithms for Computing Modular Inverses	ches	243-253
20	2003	Chemical Combinatorial Attacks on Keyboards	eprint	online
21	2002	Universal Padding Schemes for RSA	crypto	online
22	2002	Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages	pkc	17-33
23	2002	Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages	eprint	online
24	2002	Universal Padding Schemes for RSA	eprint	online
25	2000	Trapdooring Discrete Logarithms on Elliptic Curves over Rings	asiacrypt	573-584
26	2000	Efficient Generation of Prime Numbers	ches	340-354
27	2000	New Attacks on PKCS#1 v1.5 Encryption	eurocrypt	online
28	1999	Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries	asiacrypt	165-179
29	1999	Probing Attacks on Tamper-Resistant Devices	ches	303-315
30	1999	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes	eurocrypt	223-238
31	1999	A Trapdoor Permutation Equivalent to Factoring	pkc	219-222
32	1999	Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor	pkc	223-234
33	1999	Evaluating Differential Fault Analysis of Unknown Cryptosystems	pkc	235-244

Coauthors of Pascal Paillier

1. Michel Abdalla (3)
2. Mihir Bellare (3)
3. Florian Bourse (1)
4. Eric Brier (1)
5. Anne Canteaut (3)
6. Sergiu Carpov (3)
7. Dario Catalano (3)
8. Benoît Chevallier-Mames (4)
9. Christophe Clavier (1)
10. Jean-Sébastien Coron (6)
11. Benoit Feix (1)
12. Caroline Fontaine (3)
13. Helena Handschuh (3)
14. Antoine Joux (1)
15. Marc Joye (10)
16. Eike Kiltz (3)
17. Ilya Kizhvatov (1)
18. Tadayoshi Kohno (3)
19. Fabien Laguillaumie (1)
20. Tanja Lange (3)
21. Tancrède Lepoint (3)
22. John Malone-Lee (3)
23. Michele Minelli (1)
24. Matthias Minihold (1)
25. David Naccache (7)
26. María Naya-Plasencia (3)
27. Gregory Neven (3)
28. David Pointcheval (6)
29. Berry Schoenmakers (1)
30. Haixia Shi (3)
31. Renaud Sirdey (3)
32. Jacques Stern (1)
33. Loïc Thierry (1)
34. Christophe Tymen (2)
35. Serge Vaudenay (1)
36. Damien Vergnaud (2)
37. Jorge Luis Villar (1)