Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices
Thomas Espitau, Guilhem Niot, Thomas Prest
Abstract
We propose a new framework based on random submersions-that is projection over a random subspace blinded by a small Gaussian noise-for constructing verifiable short secret sharing and showcase it to construct efficient threshold lattice-based signatures in the hash-and-sign paradigm, when based on noise flooding. This is, to our knowledge, the first hash-and-sign lattice-based threshold signature. Our threshold signature enjoys the very desirable property of robustness, including at key generation. In practice, we are able to construct a robust hash-and-sign threshold signature for threshold and provide a typical parameter set for threshold T " 16 and signature size 13kB. Our constructions are provably secure under standard MLWE assumption in the ROM and only require basic primitives as building blocks. In particular, we do not rely on FHE-type schemes.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 634eb50e-70cf-42a2-b984-d8a57206f898Cited by top-tier papers13
- Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort ProtocolRafaël Del Pino, Shuichi Katsumata, Guilhem Niot, Michael Reichle et al.CRYPTO 2025 · 8 citations
- Leftover Hash Lemma(s) Over Cyclotomic RingsKatharina Boudgoust, Oleksandra LapihaEUROCRYPT 2026 · 3 citations
- mmCipher: Batching Post-Quantum Public Key Encryption Made Bandwidth-OptimalHongxiao Wang, Ron Steinfeld, Markku-Juhani O. Saarinen, Muhammed F. Esgin et al.USENIX Security 2026 · 2 citations
- Lattice-Based Threshold Blind SignaturesSebastian Faller, Guilhem Niot, Michael ReichleS&P 2026 · 2 citations
- Efficient Threshold ML-DSASofía Celi, Rafael del Pino, Thomas Espitau, Guilhem Niot et al.USENIX Security 2026 · 1 citation
Builds on4
- Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of PartiesCraig Gentry, Shai Halevi, Vadim LyubashevskyEUROCRYPT 2022 · 65 citations
- ROAST: Robust Asynchronous Schnorr Threshold SignaturesTim Ruffing, Viktoria Ronge, Elliott Jin, Jonas Schneider-Bensch et al.CCS 2022 · 50 citations
- Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWEDuhyeong Kim, Dongwon Lee, Jinyeong Seo, Yongsoo SongCRYPTO 2023 · 47 citations
- Plover: Masking-Friendly Hash-and-Sign Lattice SignaturesMuhammed F. Esgin, Thomas Espitau, Guilhem Niot, Thomas Prest et al.EUROCRYPT 2024 · 14 citations
Related papers
- Two-Round Threshold Signature from Algebraic One-More Learning with ErrorsThomas Espitau, Shuichi Katsumata, Kaoru TakemureCRYPTO 2024 · 25 citations
- A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor SamplingRafaël del Pino, Shuichi KatsumataCRYPTO 2022 · 50 citations
- Threshold and Multi-signature Schemes from Linear Hash FunctionsStefano Tessaro, Chenzhi ZhuEUROCRYPT 2023 · 48 citations
- Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with RewindingShuichi Katsumata, Michael Reichle, Kaoru TakemureCRYPTO 2024 · 34 citations
- Lattice-Based Blind Signatures: Short, Efficient, and Round-OptimalWard Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor SeilerCCS 2023 · 22 citations
