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

Pascal Paillier  Search web for home page

Program Committees

Publications

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