default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Prest
Person information
- affiliation: PQShield SAS, Paris, France
Other persons with a similar name
- Thomas P. Caudell (aka: Thomas Preston Caudell)
- Thomas Preston
- Catherine Preston-Thomas
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Rafaël del Pino, Shuichi Katsumata
, Thomas Prest, Mélissa Rossi:
Raccoon: A Masking-Friendly Signature Proven in the Probing Model. CRYPTO (1) 2024: 409-444- [c22]Thomas Espitau, Guilhem Niot, Thomas Prest:
Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices. CRYPTO (7) 2024: 425-458 - [c21]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. EUROCRYPT (2) 2024: 219-248 - [c20]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 - [i23]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. IACR Cryptol. ePrint Arch. 2024: 184 (2024) - [i22]Muhammed F. Esgin, Thomas Espitau, Guilhem Niot, Thomas Prest, Amin Sakzad, Ron Steinfeld:
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. IACR Cryptol. ePrint Arch. 2024: 401 (2024) - [i21]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) - [i20]Rafaël del Pino, Shuichi Katsumata, Thomas Prest, Mélissa Rossi:
Raccoon: A Masking-Friendly Signature Proven in the Probing Model. IACR Cryptol. ePrint Arch. 2024: 1291 (2024) - 2023
- [c19]Thomas Prest:
A Key-Recovery Attack Against Mitaka in the t-Probing Model. Public Key Cryptography (1) 2023: 205-220 - [c18]Rafaël del Pino, Thomas Prest, Mélissa Rossi, Markku-Juhani O. Saarinen:
High-Order Masking of Lattice Signatures in Quasilinear Time. SP 2023: 1168-1185 - [i19]Thomas Prest:
A Key-Recovery Attack against Mitaka in the t-Probing Model. IACR Cryptol. ePrint Arch. 2023: 157 (2023) - 2022
- [j3]Keitaro Hashimoto, Shuichi Katsumata, Kris Kwiatkowski, Thomas Prest:
An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable. J. Cryptol. 35(3): 17 (2022) - [c17]Keitaro Hashimoto, Shuichi Katsumata, Thomas Prest:
How to Hide MetaData in MLS-Like Secure Group Messaging: Simple, Modular, and Post-Quantum. CCS 2022: 1399-1412 - [i18]Dahmun Goudarzi, Thomas Prest, Matthieu Rivain, Damien Vergnaud:
Probing Security through Input-Output Separation and Revisited Quasilinear Masking. IACR Cryptol. ePrint Arch. 2022: 45 (2022) - [i17]Keitaro Hashimoto, Shuichi Katsumata, Thomas Prest:
How to Hide MetaData in MLS-Like Secure Group Messaging: Simple, Modular, and Post-Quantum. IACR Cryptol. ePrint Arch. 2022: 1533 (2022) - 2021
- [j2]Dahmun Goudarzi, Thomas Prest, Matthieu Rivain, Damien Vergnaud:
Probing Security through Input-Output Separation and Revisited Quasilinear Masking. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3): 599-640 (2021) - [c16]Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite, Thomas Prest, Bas Westerbaan:
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs. CCS 2021: 1441-1462 - [c15]James Howe, Thomas Prest, Daniel Apon:
SoK: How (not) to Design and Implement Post-quantum Cryptography. CT-RSA 2021: 444-477 - [c14]Keitaro Hashimoto, Shuichi Katsumata, Kris Kwiatkowski, Thomas Prest:
An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable. Public Key Cryptography (2) 2021: 410-440 - [c13]Maxime Plançon, Thomas Prest:
Exact Lattice Sampling from Non-Gaussian Distributions. Public Key Cryptography (1) 2021: 573-595 - [i16]James Howe, Thomas Prest, Daniel Apon:
SoK: How (not) to Design and Implement Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2021: 462 (2021) - [i15]Maxime Plançon, Thomas Prest:
Exact Lattice Sampling from Non-Gaussian Distributions. IACR Cryptol. ePrint Arch. 2021: 585 (2021) - [i14]Keitaro Hashimoto, Shuichi Katsumata, Kris Kwiatkowski, Thomas Prest:
An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable. IACR Cryptol. ePrint Arch. 2021: 616 (2021) - [i13]Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite, Thomas Prest, Bas Westerbaan:
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs. IACR Cryptol. ePrint Arch. 2021: 1407 (2021) - 2020
- [c12]Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest:
Scalable Ciphertext Compression Techniques for Post-quantum KEMs and Their Applications. ASIACRYPT (1) 2020: 289-320 - [c11]Chitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé, Alexandre Wallet, Keita Xagawa:
ModFalcon: Compact Signatures Based On Module-NTRU Lattices. AsiaCCS 2020: 853-866 - [c10]Léo Ducas, Steven D. Galbraith, Thomas Prest, Yang Yu:
Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats. EUROCRYPT (2) 2020: 608-637 - [c9]James Howe, Thomas Prest, Thomas Ricosset, Mélissa Rossi:
Isochronous Gaussian Sampling: From Inception to Implementation. PQCrypto 2020: 53-71 - [c8]Marc Abboud, Thomas Prest:
Cryptographic Divergences: New Techniques and New Applications. SCN 2020: 492-511 - [i12]Marc Abboud, Thomas Prest:
Cryptographic Divergences: New Techniques and New Applications. IACR Cryptol. ePrint Arch. 2020: 815 (2020) - [i11]Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest:
Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications. IACR Cryptol. ePrint Arch. 2020: 1107 (2020)
2010 – 2019
- 2019
- [c7]Thomas Prest, Dahmun Goudarzi, Ange Martinelli, Alain Passelègue:
Unifying Leakage Models on a Rényi Day. CRYPTO (1) 2019: 683-712 - [c6]Thomas Pornin, Thomas Prest:
More Efficient Algorithms for the NTRU Key Generation Using the Field Norm. Public Key Cryptography (2) 2019: 504-533 - [i10]Thomas Pornin, Thomas Prest:
More Efficient Algorithms for the NTRU Key Generation using the Field Norm. IACR Cryptol. ePrint Arch. 2019: 15 (2019) - [i9]Dahmun Goudarzi, Ange Martinelli, Alain Passelègue, Thomas Prest:
Unifying Leakage Models on a Rényi Day. IACR Cryptol. ePrint Arch. 2019: 138 (2019) - [i8]Léo Ducas, Steven D. Galbraith, Thomas Prest, Yang Yu:
Integral Matrix Gram Root and Lattice Gaussian Sampling without Floats. IACR Cryptol. ePrint Arch. 2019: 320 (2019) - [i7]James Howe, Thomas Prest, Thomas Ricosset, Mélissa Rossi:
Isochronous Gaussian Sampling: From Inception to Implementation. IACR Cryptol. ePrint Arch. 2019: 1411 (2019) - [i6]Chitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé, Alexandre Wallet, Keita Xagawa:
ModFalcon: compact signatures based on module NTRU lattices. IACR Cryptol. ePrint Arch. 2019: 1456 (2019) - 2018
- [c5]Laurent Castelnovi, Ange Martinelli, Thomas Prest:
Grafting Trees: A Fault Attack Against the SPHINCS Framework. PQCrypto 2018: 165-184 - [i5]Laurent Castelnovi, Ange Martinelli, Thomas Prest:
Grafting Trees: a Fault Attack against the SPHINCS framework. IACR Cryptol. ePrint Arch. 2018: 102 (2018) - 2017
- [c4]Thomas Prest:
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence. ASIACRYPT (1) 2017: 347-374 - [i4]Thomas Prest:
Sharper Bounds in Lattice-Based Cryptography using the Rényi Divergence. IACR Cryptol. ePrint Arch. 2017: 480 (2017) - 2016
- [c3]Léo Ducas, Thomas Prest:
Fast Fourier Orthogonalization. ISSAC 2016: 191-198 - 2015
- [b1]Thomas Prest:
Gaussian Sampling in Lattice-Based Cryptography. École Normale Supérieure, Paris, France, 2015 - [c2]Vadim Lyubashevsky, Thomas Prest:
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. EUROCRYPT (1) 2015: 789-815 - [i3]Vadim Lyubashevsky, Thomas Prest:
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. IACR Cryptol. ePrint Arch. 2015: 257 (2015) - [i2]Léo Ducas, Thomas Prest:
Fast Fourier Orthogonalization. IACR Cryptol. ePrint Arch. 2015: 1014 (2015) - 2014
- [c1]Léo Ducas, Vadim Lyubashevsky, Thomas Prest:
Efficient Identity-Based Encryption over NTRU Lattices. ASIACRYPT (2) 2014: 22-41 - [i1]Léo Ducas, Vadim Lyubashevsky, Thomas Prest:
E fficient Identity-Based Encryption over NTRU Lattices. IACR Cryptol. ePrint Arch. 2014: 794 (2014) - 2012
- [j1]Thomas Prest, Paul Zimmermann:
Non-linear polynomial selection for the number field sieve. J. Symb. Comput. 47(4): 401-409 (2012)
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-09-02 21:19 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:
