Thomas Espitau

From MaRDI portal
Person:1633470


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Two-round threshold signature from algebraic one-more learning with errors
 
2024-12-13Paper
\textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
 
2024-12-13Paper
\textsf{Plover}: masking-friendly hash-and-sign lattice signatures
 
2024-11-13Paper
Cryptanalysis of the \textsc{Peregrine} lattice-based signature scheme
 
2024-11-12Paper
\textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
 
2024-08-30Paper
On Gaussian sampling, smoothing parameter and application to signatures
 
2024-08-30Paper
Finding short integer solutions when the modulus is small
Advances in Cryptology – CRYPTO 2023
2024-02-02Paper
Masking the GLP lattice-based signature scheme at any order
Journal of Cryptology
2024-01-23Paper
Shorter hash-and-sign lattice-based signatures
Advances in Cryptology – CRYPTO 2022
2023-06-28Paper
Fast reduction of algebraic lattices over cyclotomic fields
 
2022-11-09Paper
\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
 
2022-08-30Paper
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
 
2022-07-06Paper
Towards faster polynomial-time lattice reduction
 
2022-04-22Paper
The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP
Open Book Series
2021-03-11Paper
\(*\)-liftings for differential privacy
 
2020-05-27Paper
Relational \(\star\)-liftings for differential privacy
 
2020-01-03Paper
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
 
2019-12-10Paper
Certified lattice reduction
Advances in Mathematics of Communications
2019-11-26Paper
An assertion-based program logic for probabilistic programs
 
2019-09-13Paper
Synthesizing Probabilistic Invariants via Doob’s Decomposition
Computer Aided Verification
2019-05-03Paper
Proving uniformity and independence by self-composition and coupling
EPiC Series in Computing
2019-01-10Paper
LWE without modular reduction and improved side-channel attacks against BLISS
 
2018-12-20Paper
Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols
IEEE Transactions on Computers
2018-12-04Paper
Masking the GLP lattice-based signature scheme at any order
 
2018-07-09Paper
Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
 
2018-02-16Paper
Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
Lecture Notes in Computer Science
2017-06-13Paper
Relational reasoning via probabilistic coupling
Logic for Programming, Artificial Intelligence, and Reasoning
2016-01-12Paper
Higher-order differential meet-in-the-middle preimage attacks on SHA-1 and BLAKE
Lecture Notes in Computer Science
2015-12-10Paper


Research outcomes over time


This page was built for person: Thomas Espitau