default search action
Thomas Espitau
Person information
- affiliation: PQShield SAS, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. J. Cryptol. 37(1): 5 (2024) - [c25]Thomas Espitau, Shuichi Katsumata, Kaoru Takemure:
Two-Round Threshold Signature from Algebraic One-More Learning with Errors. CRYPTO (7) 2024: 387-424 - [c24]Thomas Espitau, Guilhem Niot, Thomas Prest:
Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices. CRYPTO (7) 2024: 425-458 - [c23]Muhammed F. Esgin, Thomas Espitau, Guilhem Niot
, Thomas Prest, Amin Sakzad, Ron Steinfeld:
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. EUROCRYPT (6) 2024: 316-345 - [c22]Xiuhan Lin
Cryptanalysis of the Peregrine Lattice-Based Signature Scheme. Public Key Cryptography (1) 2024: 387-412 - [i34]Muhammed F. Esgin, Thomas Espitau, Guilhem Niot
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. IACR Cryptol. ePrint Arch. 2024: 401 (2024) - [i33]Thomas Espitau, Shuichi Katsumata, Kaoru Takemure:
Two-Round Threshold Signature from Algebraic One-More Learning with Errors. IACR Cryptol. ePrint Arch. 2024: 496 (2024) - [i32]Thomas Espitau, Guilhem Niot, Thomas Prest:
Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices. IACR Cryptol. ePrint Arch. 2024: 959 (2024) - [i31]Thomas Espitau, Heorhii Pliatsok:
On hermitian decomposition lattices and the module-LIP problem in rank 2. IACR Cryptol. ePrint Arch. 2024: 1148 (2024) - 2023
- [c21]Thomas Espitau
Antrag: Annular NTRU Trapdoor Generation - Making Mitaka as Secure as Falcon. ASIACRYPT (7) 2023: 3-36 - [c20]Thomas Espitau
On Gaussian Sampling, Smoothing Parameter and Application to Signatures. ASIACRYPT (7) 2023: 65-97 - [c19]Léo Ducas
Finding Short Integer Solutions When the Modulus Is Small. CRYPTO (3) 2023: 150-176 - [i30]Divesh Aggarwal, Thomas Espitau, Spencer Peters, Noah Stephens-Davidowitz:
Recursive lattice reduction - A framework for finding short lattice vectors. CoRR abs/2311.15064 (2023) - [i29]Léo Ducas, Thomas Espitau, Eamonn W. Postlethwaite:
Finding short integer solutions when the modulus is small. IACR Cryptol. ePrint Arch. 2023: 1125 (2023) - [i28]Thomas Espitau, Thi Thu Quyen Nguyen, Chao Sun, Mehdi Tibouchi, Alexandre Wallet:
Antrag: Annular NTRU Trapdoor Generation. IACR Cryptol. ePrint Arch. 2023: 1335 (2023) - [i27]Xiuhan Lin, Moeto Suzuki, Shiduo Zhang, Thomas Espitau, Yang Yu, Mehdi Tibouchi, Masayuki Abe:
Cryptanalysis of the Peregrine Lattice-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2023: 1628 (2023) - [i26]Thomas Espitau, Alexandre Wallet, Yang Yu:
On Gaussian sampling, smoothing parameter and application to signatures. IACR Cryptol. ePrint Arch. 2023: 1654 (2023) - 2022
- [j5]Chao Sun
Guessing Bits: Improved Lattice Attacks on (EC)DSA with Nonce Leakage. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1): 391-413 (2022) - [c18]Thomas Espitau
Shorter Hash-and-Sign Lattice-Based Signatures. CRYPTO (2) 2022: 245-275 - [c17]Thomas Espitau
Mitaka: A Simpler, Parallelizable, Maskable Variant of Falcon. EUROCRYPT (3) 2022: 222-253 - [i25]Nicolas David, Thomas Espitau, Akinori Hosoyamada:
Quantum binary quadratic form reduction. IACR Cryptol. ePrint Arch. 2022: 466 (2022) - [i24]Thomas Espitau, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Shorter Hash-and-Sign Lattice-Based Signatures. IACR Cryptol. ePrint Arch. 2022: 785 (2022) - 2021
- [c16]Thomas Espitau:
Mitaka: Faster, Simpler, Parallelizable and Maskable Hash-and-Sign Signatures on NTRU Lattices. APKC@AsiaCCS 2021: 1 - [c15]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque
Towards Faster Polynomial-Time Lattice Reduction. CRYPTO (2) 2021: 760-790 - [i23]Chao Sun, Thomas Espitau, Mehdi Tibouchi, Masayuki Abe:
Guessing Bits: Improved Lattice Attacks on (EC)DSA. IACR Cryptol. ePrint Arch. 2021: 455 (2021) - [i22]Thomas Espitau, Pierre-Alain Fouque, François Gérard, Mélissa Rossi, Akira Takahashi, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Mitaka: a simpler, parallelizable, maskable variant of Falcon. IACR Cryptol. ePrint Arch. 2021: 1486 (2021) - 2020
- [b1]Thomas Espitau:
Algorithmic aspects of algebraic lattices. (Aspects algorithmiques des réseaux algébriques). Sorbonne University, Paris, France, 2020 - [j4]Thomas Espitau, Antoine Joux
Certified lattice reduction. Adv. Math. Commun. 14(1): 137-159 (2020) - [c14]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque
Fast Reduction of Algebraic Lattices over Cyclotomic Fields. CRYPTO (2) 2020: 155-185 - [c13]Thomas Espitau, Antoine Joux
On a Dual/Hybrid Approach to Small Secret LWE - A Dual/Enumeration Technique for Learning with Errors and Application to Security Estimates of FHE Schemes. INDOCRYPT 2020: 440-462 - [i21]Thomas Espitau, Paul Kirchner:
The nearest-colattice algorithm. CoRR abs/2006.05660 (2020) - [i20]Thomas Espitau, Antoine Joux, Natalia Kharchenko:
On a hybrid approach to solve binary-LWE. IACR Cryptol. ePrint Arch. 2020: 515 (2020) - [i19]Thomas Espitau, Paul Kirchner:
The nearest-colattice algorithm. IACR Cryptol. ePrint Arch. 2020: 694 (2020)
2010 – 2019
- 2019
- [j3]Gilles Barthe, Thomas Espitau, Justin Hsu
Relational ⋆⋆\star-Liftings for Differential Privacy. Log. Methods Comput. Sci. 15(4) (2019) - [c12]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque
GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited. CCS 2019: 2147-2164 - [i18]Thomas Espitau, Antoine Joux
Certified lattice reduction. CoRR abs/1905.11743 (2019) - [i17]Thomas Espitau, Paul Kirchner, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. CoRR abs/1912.04586 (2019) - [i16]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Mélissa Rossi, Mehdi Tibouchi:
GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited. IACR Cryptol. ePrint Arch. 2019: 511 (2019) - [i15]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. IACR Cryptol. ePrint Arch. 2019: 1436 (2019) - 2018
- [j2]Gilles Barthe
Proving expected sensitivity of probabilistic programs. Proc. ACM Program. Lang. 2(POPL): 57:1-57:29 (2018) - [j1]Thomas Espitau
Loop-Abort Faults on Lattice-Based Signature Schemes and Key Exchange Protocols. IEEE Trans. Computers 67(11): 1535-1549 (2018) - [c11]Jonathan Bootle
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. ASIACRYPT (1) 2018: 494-524 - [c10]Gilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Grégoire, Justin Hsu
An Assertion-Based Program Logic for Probabilistic Programs. ESOP 2018: 117-144 - [c9]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque
Masking the GLP Lattice-Based Signature Scheme at Any Order. EUROCRYPT (2) 2018: 354-384 - [i14]Gilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
An Assertion-Based Program Logic for Probabilistic Programs. CoRR abs/1803.05535 (2018) - [i13]Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi:
Masking the GLP Lattice-Based Signature Scheme at Any Order. IACR Cryptol. ePrint Arch. 2018: 381 (2018) - [i12]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. IACR Cryptol. ePrint Arch. 2018: 822 (2018) - 2017
- [c8]Thomas Espitau, Pierre-Alain Fouque
Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers. CCS 2017: 1857-1874 - [c7]Jean-François Biasse
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. EUROCRYPT (1) 2017: 60-88 - [c6]Gilles Barthe
*-Liftings for Differential Privacy. ICALP 2017: 102:1-102:12 - [c5]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu
Proving uniformity and independence by self-composition and coupling. LPAR 2017: 385-403 - [i11]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
Proving uniformity and independence by self-composition and coupling. CoRR abs/1701.06477 (2017) - [i10]Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub:
*-Liftings for Differential Privacy. CoRR abs/1705.00133 (2017) - [i9]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
Proving Expected Sensitivity of Probabilistic Programs. CoRR abs/1708.02537 (2017) - [i8]Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme. IACR Cryptol. ePrint Arch. 2017: 142 (2017) - [i7]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Side-Channel Attacks on BLISS Lattice-Based Signatures - Exploiting Branch Tracing Against strongSwan and Electromagnetic Emanations in Microcontrollers. IACR Cryptol. ePrint Arch. 2017: 505 (2017) - 2016
- [c4]Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu
Synthesizing Probabilistic Invariants via Doob's Decomposition. CAV (1) 2016: 43-61 - [c3]Thomas Espitau, Pierre-Alain Fouque
Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures. SAC 2016: 140-158 - [i6]Gilles Barthe, Thomas Espitau, Luis María Ferrer Fioriti, Justin Hsu:
Synthesizing Probabilistic Invariants via Doob's Decomposition. CoRR abs/1605.02765 (2016) - [i5]Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, Mehdi Tibouchi:
Loop abort Faults on Lattice-Based Fiat-Shamir & Hash'n Sign signatures. IACR Cryptol. ePrint Arch. 2016: 449 (2016) - [i4]Thomas Espitau, Antoine Joux:
Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic. IACR Cryptol. ePrint Arch. 2016: 528 (2016) - [i3]Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing generator in cyclotomic integer rings. IACR Cryptol. ePrint Arch. 2016: 957 (2016) - 2015
- [c2]Thomas Espitau, Pierre-Alain Fouque
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE. CRYPTO (1) 2015: 683-701 - [c1]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu
Relational Reasoning via Probabilistic Coupling. LPAR 2015: 387-401 - [i2]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Léo Stefanesco, Pierre-Yves Strub:
Relational reasoning via probabilistic coupling. CoRR abs/1509.03476 (2015) - [i1]Thomas Espitau, Pierre-Alain Fouque, Pierre Karpman:
Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE. IACR Cryptol. ePrint Arch. 2015: 515 (2015)
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-08-29 21:53 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: