default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Chevallier-Mames
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Andrei Stoian, Jordan Fréry, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames:
Deep Neural Networks for Encrypted Inference with TFHE. CSCML 2023: 493-500- [c17]Jordan Fréry, Andrei Stoian, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames, Arthur Meyre:
Privacy-Preserving Tree-Based Inference with TFHE. MSPN 2023: 139-156 - [i13]Andrei Stoian, Jordan Fréry, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames:
Deep Neural Networks for Encrypted Inference with TFHE. CoRR abs/2302.10906 (2023) - [i12]Jordan Fréry, Andrei Stoian, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames, Arthur Meyre:
Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption. CoRR abs/2303.01254 (2023) - [i11]Andrei Stoian, Jordan Fréry, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames:
Deep Neural Networks for Encrypted Inference with TFHE. IACR Cryptol. ePrint Arch. 2023: 257 (2023) - [i10]Jordan Fréry, Andrei Stoian, Roman Bredehoft, Luis Montero, Celia Kherfallah, Benoît Chevallier-Mames, Arthur Meyre:
Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 258 (2023) - 2022
- [c16]Benoît Chevallier-Mames:
A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption. CT-RSA 2022: 26-48 - [i9]Benoît Chevallier-Mames:
A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2022: 1480 (2022)
2010 – 2019
- 2010
- [c15]Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott:
Secure Delegation of Elliptic-Curve Pairing. CARDIS 2010: 24-35 - [c14]Benoît Chevallier-Mames, Pierre-Alain Fouque
, David Pointcheval, Julien Stern, Jacques Traoré:
On Some Incompatible Properties of Voting Schemes. Towards Trustworthy Elections 2010: 191-199
2000 – 2009
- 2009
- [c13]Benoît Chevallier-Mames, Marc Joye:
Chosen-Ciphertext Secure RSA-Type Cryptosystems. ProvSec 2009: 32-46 - [i8]Emmanuel Bresson, Anne Canteaut, Benoît Chevallier-Mames, Christophe Clavier, Thomas Fuhr, Aline Gouget, Thomas Icart, Jean-François Misarsky, María Naya-Plasencia, Pascal Paillier, Thomas Pornin, Jean-René Reinhard, Céline Thuillet, Marion Videau:
Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers. IACR Cryptol. ePrint Arch. 2009: 199 (2009) - [i7]Benoît Chevallier-Mames, Marc Joye:
Chosen-Ciphertext Secure RSA-type Cryptosystems. IACR Cryptol. ePrint Arch. 2009: 377 (2009) - 2008
- [c12]Emmanuel Bresson, Benoît Chevallier-Mames, Christophe Clavier, Aline Gouget, Pascal Paillier, Thomas Peyrin:
How to Use Merkle-Damgård - On the Security Relations between Signature Schemes and Their Inner Hash Functions. ProvSec 2008: 241-253 - [c11]Benoît Chevallier-Mames, David Naccache, Jacques Stern:
Linear Bandwidth Naccache-Stern Encryption. SCN 2008: 327-339 - [i6]Benoît Chevallier-Mames, David Naccache, Jacques Stern:
Linear Bandwidth Naccache-Stern Encryption. IACR Cryptol. ePrint Arch. 2008: 119 (2008) - 2007
- [c10]Benoît Chevallier-Mames, Marc Joye:
A Practical and Tightly Secure Signature Scheme Without Hash Function. CT-RSA 2007: 339-356 - [c9]Guilhem Castagnos, Benoît Chevallier-Mames:
Towards a DL-Based Additively Homomorphic Encryption Scheme. ISC 2007: 362-375 - 2006
- [c8]Eric Brier, Benoît Chevallier-Mames, Mathieu Ciet, Christophe Clavier:
Why One Should Also Secure RSA Public Key Elements. CHES 2006: 324-338 - [c7]Benoît Chevallier-Mames, Pascal Paillier, David Pointcheval:
Encoding-Free ElGamal Encryption Without Random Oracles. Public Key Cryptography 2006: 91-104 - 2005
- [c6]Benoît Chevallier-Mames, Duong Hieu Phan, David Pointcheval:
Optimal Asymmetric Encryption and Signature Paddings. ACNS 2005: 254-268 - [c5]Benoît Chevallier-Mames:
New Signature Schemes with Coupons and Tight Reduction. ACNS 2005: 513-528 - [c4]Benoît Chevallier-Mames:
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction. CRYPTO 2005: 511-526 - [i5]Benoît Chevallier-Mames:
An Efficient CDH-based Signature Scheme With a Tight Security Reduction. IACR Cryptol. ePrint Arch. 2005: 35 (2005) - [i4]Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott:
Secure Delegation of Elliptic-Curve Pairing. IACR Cryptol. ePrint Arch. 2005: 150 (2005) - [i3]Nuttapong Attrapadung, Benoît Chevallier-Mames, Jun Furukawa, Takeshi Gomi, Goichiro Hanaoka, Hideki Imai, Rui Zhang:
Efficient Identity-Based Encryption with Tight Security Reduction. IACR Cryptol. ePrint Arch. 2005: 320 (2005) - 2004
- [j1]Benoît Chevallier-Mames, Mathieu Ciet, Marc Joye:
Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity. IEEE Trans. Computers 53(6): 760-768 (2004) - [c3]Benoît Chevallier-Mames, David Naccache, Pascal Paillier, David Pointcheval:
How to Disembed a Program? CHES 2004: 441-454 - [c2]Benoît Chevallier-Mames:
Self-Randomized Exponentiation Algorithms. CT-RSA 2004: 236-249 - [i2]Benoît Chevallier-Mames, David Naccache, Pascal Paillier, David Pointcheval:
How to Disembed a Program? IACR Cryptol. ePrint Arch. 2004: 138 (2004) - 2003
- [c1]Benoît Chevallier-Mames, Marc Joye, Pascal Paillier:
Faster Double-Size Modular Multiplication from Euclidean Multipliers. CHES 2003: 214-227 - [i1]Benoît Chevallier-Mames, Mathieu Ciet, Marc Joye:
Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity. IACR Cryptol. ePrint Arch. 2003: 237 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
