Pascal Paillier

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

VLDB 2026 Research / reviewers in the wild / expert

dblp:32/167 · DBLP profile ↗

← Back

31ranked-venue papers

6as first author

1since 2021 · last 2025

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 31 · 6 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security 21 papers		Cryptographic primitives and cryptanalysis · 91% Hardware security and side channels · 8% Systems and software security · 1%
Artificial intelligence 1 paper		Deep learning architectures and training · 100%

Topics — the 30 heaviest of 33, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis stream cipher	1.2	2	2025	Transistor: a TFHE-Friendly Stream Cipher · CRYPTO (5) 2025 Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression · J. Cryptol. 2018
Cryptographic primitives and cryptanalysis › homomorphic encryption fully homomorphic encryption	0.6	2	2025	Fast Homomorphic Evaluation of Deep Discretized Neural Networks · CRYPTO (3) 2018 Transistor: a TFHE-Friendly Stream Cipher · CRYPTO (5) 2025
Cryptographic primitives and cryptanalysis homomorphic encryption	0.4	2	2018	Fast Homomorphic Evaluation of Deep Discretized Neural Networks · CRYPTO (3) 2018 Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression · J. Cryptol. 2018
Cryptographic primitives and cryptanalysis › public-key cryptography public-key encryption	0.1	4	2006	Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006 Universal Padding Schemes for RSA · CRYPTO 2002 Public-Key Cryptosystems Based on Composite Degree Residuosity Classes · EUROCRYPT 1999
Cryptographic primitives and cryptanalysis searchable encryption	0.1	2	2008	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · J. Cryptol. 2008 Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · CRYPTO 2005
Cryptographic primitives and cryptanalysis › public-key cryptography digital signatures	0.1	2	2005	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log · ASIACRYPT 2005 Universally Convertible Directed Signatures · ASIACRYPT 2005
Machine learning › Deep learning architectures and training neural network inference	0.1	1	2018	Fast Homomorphic Evaluation of Deep Discretized Neural Networks · CRYPTO (3) 2018
Cryptographic primitives and cryptanalysis ciphertext compression	0.1	1	2018	Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression · J. Cryptol. 2018
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption › identity-based encryption anonymous identity-based encryption	0.1	2	2008	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · J. Cryptol. 2008 Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · CRYPTO 2005
Hardware security and side channels fault attacks	0.1	1	2009	Fault Attacks on RSA Signatures with Partially Unknown Messages · CHES 2009
Cryptographic primitives and cryptanalysis › computational number theory prime number generation	0.1	2	2006	Fast Generation of Prime Numbers on Portable Devices: An Update · CHES 2006 Efficient Generation of Prime Numbers · CHES 2000
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption chosen-ciphertext security	0.1	2	2006	Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006 Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries · ASIACRYPT 1999
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption identity-based encryption	0.1	1	2008	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · J. Cryptol. 2008
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption factoring-based encryption	0.1	1	2006	Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006
Cryptographic primitives and cryptanalysis cryptographic assumptions	0.1	1	2005	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log · ASIACRYPT 2005
Hardware security and side channels › side-channel attack › power analysis differential power analysis	0.1	1	2005	On Second-Order Differential Power Analysis · CHES 2005
Cryptographic primitives and cryptanalysis discrete logarithm	0.1	1	2005	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log · ASIACRYPT 2005
Cryptographic primitives and cryptanalysis encryption	0.1	1	2005	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions · CRYPTO 2005
Hardware security and side channels › side-channel attack › power analysis second-order power analysis	0.1	1	2005	On Second-Order Differential Power Analysis · CHES 2005
Hardware security and side channels side-channel attack	0.1	1	2005	On Second-Order Differential Power Analysis · CHES 2005
Systems and software security software protection	0.0	1	2004	How to Disembed a Program? · CHES 2004
Cryptographic primitives and cryptanalysis › number theory modular arithmetic	0.0	1	2003	Faster Double-Size Modular Multiplication from Euclidean Multipliers · CHES 2003
Cryptographic primitives and cryptanalysis › finite field arithmetic modular inversion	0.0	1	2003	GCD-Free Algorithms for Computing Modular Inverses · CHES 2003
Cryptographic primitives and cryptanalysis › public-key cryptography modular multiplication	0.0	1	2003	Faster Double-Size Modular Multiplication from Euclidean Multipliers · CHES 2003
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption padding scheme	0.0	1	2002	Universal Padding Schemes for RSA · CRYPTO 2002
Cryptographic primitives and cryptanalysis › public-key cryptography RSA	0.0	1	2002	Universal Padding Schemes for RSA · CRYPTO 2002
Cryptographic primitives and cryptanalysis › public-key cryptography elliptic curve cryptography	0.0	1	2000	Trapdooring Discrete Logarithms on Elliptic Curves over Rings · ASIACRYPT 2000
Hardware security and side channels physical attacks	0.0	1	1999	Probing Attacks on Tamper-Resistant Devices · CHES 1999
Hardware security and side channels › physical attacks probing attack	0.0	1	1999	Probing Attacks on Tamper-Resistant Devices · CHES 1999
Compilers and program optimization program transformation	0.0	1	2004	How to Disembed a Program? · CHES 2004

Methods — techniques the papers use, named apart from their topics

TFHE · 0.9fault attack · 0.1searchable encryption · 0.1anonymous IBE · 0.1padding oracle · 0.0bleichenbacher attack · 0.0physical attack · 0.0

Year	Publication	Venue	Position
2025	Transistor: a TFHE-Friendly Stream Cipher Jules Baudrin, Sonia Belaïd, Nicolas Bon 0001, Christina Boura, Anne Canteaut, Gaëtan Leurent, Pascal Paillier, Léo Perrin, Matthieu Rivain, Yann Rotella, Samuel Tap	CRYPTO (5)	7
2018	Fast Homomorphic Evaluation of Deep Discretized Neural Networks Florian Bourse, Michele Minelli, Matthias Minihold, Pascal Paillier	CRYPTO (3)	4
2018	Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, Pascal Paillier, Renaud Sirdey	J. Cryptol.	6
2016	Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, Pascal Paillier, Renaud Sirdey	FSE	6
2013	White-Box Security Notions for Symmetric Encryption Schemes Cécile Delerablée, Tancrède Lepoint, Pascal Paillier, Matthieu Rivain	Selected Areas in Cryptography	3
2009	Fault Attacks on RSA Signatures with Partially Unknown Messages Jean-Sébastien Coron, Antoine Joux, Ilya Kizhvatov, David Naccache, Pascal Paillier	CHES	5
2008	How to Use Merkle-Damgård - On the Security Relations between Signature Schemes and Their Inner Hash Functions Emmanuel Bresson, Benoît Chevallier-Mames, Christophe Clavier, Aline Gouget, Pascal Paillier, Thomas Peyrin	ProvSec	5
2008	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange 0001, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi	J. Cryptol.	9
2007	Impossibility Proofs for RSA Signatures in the Standard Model Pascal Paillier	CT-RSA	1
2007	Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys Cécile Delerablée, Pascal Paillier, David Pointcheval	Pairing	2
2007	Decryptable Searchable Encryption Thomas Fuhr 0001, Pascal Paillier	ProvSec	2
2006	Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption Pascal Paillier, Jorge Luis Villar	ASIACRYPT	1
2006	Fast Generation of Prime Numbers on Portable Devices: An Update Marc Joye, Pascal Paillier	CHES	2
2005	Universally Convertible Directed Signatures Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud	ASIACRYPT	2
2005	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log Pascal Paillier, Damien Vergnaud	ASIACRYPT	1
2005	On Second-Order Differential Power Analysis Marc Joye, Pascal Paillier, Berry Schoenmakers	CHES	2
2005	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange 0001, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi	CRYPTO	9
2004	How to Disembed a Program? Benoît Chevallier-Mames, David Naccache, Pascal Paillier, David Pointcheval	CHES	3
2003	Faster Double-Size Modular Multiplication from Euclidean Multipliers Benoît Chevallier-Mames, Marc Joye, Pascal Paillier	CHES	3
2003	GCD-Free Algorithms for Computing Modular Inverses Marc Joye, Pascal Paillier	CHES	2
2002	Provably Secure Chipcard Personalization, or, How to Fool Malicious Insiders Helena Handschuh, David Naccache, Pascal Paillier, Christophe Tymen	CARDIS	3
2002	Universal Padding Schemes for RSA Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier	CRYPTO	4
2002	GEM: A Generic Chosen-Ciphertext Secure Encryption Method Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen	CT-RSA	4
2000	Trapdooring Discrete Logarithms on Elliptic Curves over Rings Pascal Paillier	ASIACRYPT	1
2000	Efficient Generation of Prime Numbers Marc Joye, Pascal Paillier, Serge Vaudenay	CHES	2
2000	New Attacks on PKCS#1 v1.5 Encryption Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier	EUROCRYPT	4
1999	Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries Pascal Paillier, David Pointcheval	ASIACRYPT	1
1999	Probing Attacks on Tamper-Resistant Devices Helena Handschuh, Pascal Paillier, Jacques Stern	CHES	2
1999	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes Pascal Paillier	EUROCRYPT	1
1998	Reducing the Collision Probability of Alleged Comp128 Helena Handschuh, Pascal Paillier	CARDIS	2
1998	Smart Card Crypto-Coprocessors for Public-Key Cryptography Helena Handschuh, Pascal Paillier	CARDIS	2