default search action
Pierrick Méaux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Pierrick Méaux, Dibyendu Roy:
Theoretical differential fault attacks on FLIP and FiLIP. Cryptogr. Commun. 16(4): 721-744 (2024) - [j13]Pierrick Méaux
, Jeongeun Park
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Commun. Cryptol. 1(1): 20 (2024) - [j12]Pierrick Méaux
On the cryptographic properties of weightwise affine and weightwise quadratic functions. Discret. Appl. Math. 355: 13-29 (2024) - [c16]François Gérard, Agnese Gini, Pierrick Méaux:
TooLIP: How to Find New Instances of FiLIP Cipher with Smaller Key Size and New Filters. AFRICACRYPT 2024: 21-45 - [c15]Lorenzo Grassi, Loïc Masure, Pierrick Méaux, Thorben Moos
Generalized Feistel Ciphers for Efficient Prime Field Masking. EUROCRYPT (3) 2024: 188-220 - [i30]Pierrick Méaux, Qingju Wang:
Extreme Algebraic Attacks. IACR Cryptol. ePrint Arch. 2024: 64 (2024) - [i29]Pierrick Méaux, Dibyendu Roy:
Theoretical differential fault attacks on FLIP and FiLIP. IACR Cryptol. ePrint Arch. 2024: 98 (2024) - [i28]Lorenzo Grassi, Loïc Masure, Pierrick Méaux, Thorben Moos, François-Xavier Standaert:
Generalized Feistel Ciphers for Efficient Prime Field Masking - Full Version. IACR Cryptol. ePrint Arch. 2024: 431 (2024) - [i27]Pierrick Méaux:
Weightwise (almost) perfectly balanced functions based on total orders. IACR Cryptol. ePrint Arch. 2024: 647 (2024) - [i26]Diego F. Aranha, Antonio Guimarães, Clément Hoffmann, Pierrick Méaux:
Secure and efficient transciphering for FHE-based MPC. IACR Cryptol. ePrint Arch. 2024: 1702 (2024) - 2023
- [j11]Aurélien Dupin, Pierrick Méaux
On the algebraic immunity - resiliency trade-off, implications for Goldreich's pseudorandom generator. Des. Codes Cryptogr. 91(9): 3035-3079 (2023) - [j10]R. Radheshwar
Differential Fault Attack on Rasta and $\text{FiLIP}_{\text{DSM}}$. IEEE Trans. Computers 72(8): 2418-2425 (2023) - [c14]Éric Sageloli, Pierre Pébereau, Pierrick Méaux, Céline Chevalier:
Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from Lattices. ACNS (1) 2023: 634-663 - [c13]Agnese Gini
Weightwise Perfectly Balanced Functions and Nonlinearity. C2SI 2023: 338-359 - [c12]Clément Hoffmann, Pierrick Méaux, Charles Momin, Yann Rotella, François-Xavier Standaert, Balazs Udvarhelyi:
Learning with Physical Rounding for Linear and Quadratic Leakage Functions. CRYPTO (3) 2023: 410-439 - [c11]Loïc Masure
Effective and Efficient Masking with Low Noise Using Small-Mersenne-Prime Ciphers. EUROCRYPT (4) 2023: 596-627 - [c10]Clément Hoffmann
The Patching Landscape of Elisabeth-4 and the Mixed Filter Permutator Paradigm. INDOCRYPT (1) 2023: 134-156 - [c9]Agnese Gini
On the Algebraic Immunity of Weightwise Perfectly Balanced Functions. LATINCRYPT 2023: 3-23 - [i25]R. Radheshwar, Meenakshi Kansal, Pierrick Méaux, Dibyendu Roy:
Differential Fault Attack on Rasta and FiLIP DSM. IACR Cryptol. ePrint Arch. 2023: 322 (2023) - [i24]Éric Sageloli, Pierre Pébereau, Pierrick Méaux, Céline Chevalier:
Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from Lattices. IACR Cryptol. ePrint Arch. 2023: 489 (2023) - [i23]Agnese Gini, Pierrick Méaux:
On the algebraic immunity of weightwise perfectly balanced functions. IACR Cryptol. ePrint Arch. 2023: 495 (2023) - [i22]Agnese Gini, Pierrick Méaux:
S0-equivalent classes, a new direction to find better weightwise perfectly balanced functions, and more. IACR Cryptol. ePrint Arch. 2023: 1101 (2023) - [i21]Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira:
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space. IACR Cryptol. ePrint Arch. 2023: 1531 (2023) - [i20]Pierrick Méaux, Yassine Ozaim:
On the cryptographic properties of weightwise affine and weightwise quadratic functions. IACR Cryptol. ePrint Arch. 2023: 1680 (2023) - [i19]Clément Hoffmann, Pierrick Méaux, François-Xavier Standaert:
The Patching Landscape of Elisabeth-4 and the Mixed Filter Permutator Paradigm. IACR Cryptol. ePrint Arch. 2023: 1895 (2023) - 2022
- [j9]Pierrick Méaux
On the algebraic immunity of direct sum constructions. Discret. Appl. Math. 320: 223-234 (2022) - [j8]Agnese Gini
On the weightwise nonlinearity of weightwise perfectly balanced functions. Discret. Appl. Math. 322: 320-341 (2022) - [j7]Davide Bellizia, Clément Hoffmann
When Bad News Become Good News Towards Usable Instances of Learning with Physical Errors. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4): 1-24 (2022) - [j6]Claude Carlet
A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions. IEEE Trans. Inf. Theory 68(5): 3404-3425 (2022) - [c8]Orel Cosseron
Towards Case-Optimized Hybrid Homomorphic Encryption - Featuring the Elisabeth Stream Cipher. ASIACRYPT (3) 2022: 32-67 - [c7]Agnese Gini
Weightwise Almost Perfectly Balanced Functions: Secondary Constructions for All n and Better Weightwise Nonlinearities. INDOCRYPT 2022: 492-514 - [i18]Orel Cosseron, Clément Hoffmann, Pierrick Méaux, François-Xavier Standaert:
Towards Globally Optimized Hybrid Homomorphic Encryption - Featuring the Elisabeth Stream Cipher. IACR Cryptol. ePrint Arch. 2022: 180 (2022) - [i17]Agnese Gini, Pierrick Méaux:
On the weightwise nonlinearity of weightwise perfecty balanced functions. IACR Cryptol. ePrint Arch. 2022: 408 (2022) - [i16]Loïc Masure, Pierrick Méaux, Thorben Moos, François-Xavier Standaert:
Effective and Efficient Masking with Low Noise using Small-Mersenne-Prime Ciphers. IACR Cryptol. ePrint Arch. 2022: 863 (2022) - [i15]Agnese Gini, Pierrick Méaux:
Weightwise almost perfectly balanced functions: secondary constructions for all n and better weightwise nonlinearities. IACR Cryptol. ePrint Arch. 2022: 1434 (2022) - [i14]Agnese Gini, Pierrick Méaux:
Weightwise perfectly balanced functions and nonlinearity. IACR Cryptol. ePrint Arch. 2022: 1777 (2022) - 2021
- [j5]Pierrick Méaux
On the fast algebraic immunity of threshold functions. Cryptogr. Commun. 13(5): 741-762 (2021) - [j4]Sébastien Duval
Exploring Crypto-Physical Dark Matter and Learning with Physical Rounding Towards Secure and Efficient Fresh Re-Keying. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1): 373-401 (2021) - [j3]Davide Bellizia
Learning Parity with Physical Noise: Imperfections, Reductions and FPGA Prototype. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3): 390-417 (2021) - [i13]Aurélien Dupin, Pierrick Méaux, Mélissa Rossi:
On the Algebraic Immunity - Resiliency trade-off, implications for Goldreich's Pseudorandom Generator. IACR Cryptol. ePrint Arch. 2021: 649 (2021) - [i12]Pierrick Méaux:
On the algebraic immunity of direct sum constructions. IACR Cryptol. ePrint Arch. 2021: 665 (2021) - [i11]Sébastien Duval, Pierrick Méaux, Charles Momin, François-Xavier Standaert:
Exploring Crypto-Physical Dark Matter and Learning with Physical Rounding Towards Secure and Efficient Fresh Re-Keying. IACR Cryptol. ePrint Arch. 2021: 950 (2021) - 2020
- [j2]Weijia Wang, Pierrick Méaux
Efficient and Private Computations with Code-Based Masking. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(2): 128-171 (2020) - [c6]Clément Hoffmann
Transciphering, Using FiLIP and TFHE for an Efficient Delegation of Computation. INDOCRYPT 2020: 39-61 - [i10]Pierrick Méaux:
On the Fast Algebraic Immunity of Threshold Functions. IACR Cryptol. ePrint Arch. 2020: 273 (2020) - [i9]Clément Hoffmann, Pierrick Méaux, Thomas Ricosset:
Transciphering, using FiLIP and TFHE for an efficient delegation of computation. IACR Cryptol. ePrint Arch. 2020: 1373 (2020) - [i8]Claude Carlet, Pierrick Méaux:
A complete study of two classes of Boolean functions for homomorphic-friendly stream ciphers. IACR Cryptol. ePrint Arch. 2020: 1562 (2020)
2010 – 2019
- 2019
- [c5]Pierrick Méaux, Claude Carlet, Anthony Journault, François-Xavier Standaert
Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. INDOCRYPT 2019: 68-91 - [c4]Pierrick Méaux:
On the Fast Algebraic Immunity of Majority Functions. LATINCRYPT 2019: 86-105 - [i7]Pierrick Méaux, Claude Carlet, Anthony Journault, François-Xavier Standaert:
Improved Filter Permutators: Combining Symmetric Encryption Design, Boolean Functions, Low Complexity Cryptography, and Homomorphic Encryption, for Private Delegation of Computations. IACR Cryptol. ePrint Arch. 2019: 483 (2019) - [i6]Pierrick Méaux:
On the Fast Algebraic Immunity of Majority Functions. IACR Cryptol. ePrint Arch. 2019: 999 (2019) - [i5]Claude Carlet, Pierrick Méaux:
Boolean functions for homomorphic-friendly stream ciphers. IACR Cryptol. ePrint Arch. 2019: 1446 (2019) - 2018
- [c3]Geoffroy Couteau
On the Concrete Security of Goldreich's Pseudorandom Generator. ASIACRYPT (2) 2018: 96-124 - [i4]Geoffroy Couteau, Aurélien Dupin, Pierrick Méaux, Mélissa Rossi, Yann Rotella:
On the Concrete Security of Goldreich's Pseudorandom Generator. IACR Cryptol. ePrint Arch. 2018: 1162 (2018) - 2017
- [b1]Pierrick Méaux
Hybrid fully homomorphic framework. (Chiffrement complètement homomorphe hybride). PSL Research University, France, 2017 - [j1]Claude Carlet, Pierrick Méaux
Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 2017(3): 192-227 (2017) - [i3]Claude Carlet, Pierrick Méaux, Yann Rotella:
Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Cryptol. ePrint Arch. 2017: 97 (2017) - 2016
- [c2]Pierrick Méaux, Anthony Journault, François-Xavier Standaert
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts. EUROCRYPT (1) 2016: 311-343 - [i2]Pierrick Méaux, Anthony Journault, François-Xavier Standaert, Claude Carlet:
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts. IACR Cryptol. ePrint Arch. 2016: 254 (2016) - 2015
- [c1]Romain Gay
Predicate Encryption for Multi-dimensional Range Queries from Lattices. Public Key Cryptography 2015: 752-776 - 2014
- [i1]Romain Gay, Pierrick Méaux, Hoeteck Wee:
Predicate Encryption for Multi-Dimensional Range Queries from Lattices. IACR Cryptol. ePrint Arch. 2014: 965 (2014)
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-11-11 21:30 CET 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: