Faster Double-Size Modular Multiplication from Euclidean Multipliers. - Benoît Chevallier-Mames; Marc Joye; Pascal Paillier (CHES, 2003)

Self-Randomized Exponentiation Algorithms. - Benoît Chevallier-Mames (CT-RSA, 2004)

How to Disembed a Program? - Benoît Chevallier-Mames; David Naccache; Pascal Paillier; David Pointcheval (IACR Cryptol. ePrint Arch., 2004)

Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity. - Benoît Chevallier-Mames; Mathieu Ciet; Marc Joye (IEEE Trans. Computers, 2004)

New Signature Schemes with Coupons and Tight Reduction. - Benoît Chevallier-Mames (ACNS, 2005)

Optimal Asymmetric Encryption and Signature Paddings. - Benoît Chevallier-Mames; Duong Hieu Phan; David Pointcheval (ACNS, 2005)

Efficient Identity-Based Encryption with Tight Security Reduction. - Nuttapong Attrapadung; Benoît Chevallier-Mames; Jun Furukawa 001; Takeshi Gomi; Goichiro Hanaoka; Hideki Imai; Rui Zhang 002 (IACR Cryptol. ePrint Arch., 2005)

An Efficient CDH-based Signature Scheme With a Tight Security Reduction. - Benoît Chevallier-Mames (IACR Cryptol. ePrint Arch., 2005)

Secure Delegation of Elliptic-Curve Pairing. - Benoît Chevallier-Mames; Jean-Sébastien Coron; Noel McCullagh; David Naccache; Michael Scott (IACR Cryptol. ePrint Arch., 2005)

Why One Should Also Secure RSA Public Key Elements. - Eric Brier; Benoît Chevallier-Mames; Mathieu Ciet; Christophe Clavier (CHES, 2006)

Encoding-Free ElGamal Encryption Without Random Oracles. - Benoît Chevallier-Mames; Pascal Paillier; David Pointcheval (Public Key Cryptography, 2006)

A Practical and Tightly Secure Signature Scheme Without Hash Function. - Benoît Chevallier-Mames; Marc Joye (CT-RSA, 2007)

Towards a DL-Based Additively Homomorphic Encryption Scheme. - Guilhem Castagnos; Benoît Chevallier-Mames (ISC, 2007)

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, 2008)

Linear Bandwidth Naccache-Stern Encryption. - Benoît Chevallier-Mames; David Naccache; Jacques Stern (IACR Cryptol. ePrint Arch., 2008)

Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers. - Emmanuel Bresson; Anne Canteaut; Benoît Chevallier-Mames; Christophe Clavier; Thomas Fuhr 001; Aline Gouget; Thomas Icart; Jean-François Misarsky; María Naya-Plasencia; Pascal Paillier; Thomas Pornin; Jean-René Reinhard; et al. (IACR Cryptol. ePrint Arch., 2009)

Chosen-Ciphertext Secure RSA-type Cryptosystems. - Benoît Chevallier-Mames; Marc Joye (IACR Cryptol. ePrint Arch., 2009)

On Some Incompatible Properties of Voting Schemes. - Benoît Chevallier-Mames; Pierre-Alain Fouque; David Pointcheval; Julien Stern; Jacques Traoré (Towards Trustworthy Elections, 2010)

A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption. - Benoît Chevallier-Mames (IACR Cryptol. ePrint Arch., 2022)

Privacy-Preserving Tree-Based Inference with TFHE. - Jordan Fréry; Andrei Stoian; Roman Bredehoft; Luis Montero; Celia Kherfallah; Benoît Chevallier-Mames; Arthur Meyre (MSPN, 2023)

Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption. - Jordan Fréry; Andrei Stoian; Roman Bredehoft; Luis Montero; Celia Kherfallah; Benoît Chevallier-Mames; Arthur Meyre (IACR Cryptol. ePrint Arch., 2023)

Deep Neural Networks for Encrypted Inference with TFHE. - Andrei Stoian; Jordan Fréry; Roman Bredehoft; Luis Montero; Celia Kherfallah; Benoît Chevallier-Mames (IACR Cryptol. ePrint Arch., 2023)