Paper 2025/871
Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts
, PQShield, PQShield, PQShield, Univ Rennes, CNRS, IRISA, PQShieldAbstract
We introduce simple yet efficient lattice-based threshold signatures with identifiable aborts, secure under the MLWE assumption. Central to our construction are novel Distributed Key Generation with Short Shares (sDKG) protocols over lattices, ensuring short shares, small reconstruction coefficients, and linear evaluation of honest shares. This uniquely realizes the "threshold designer's dream": signature shares double as valid signatures under the corresponding secret key shares. With two concrete instantiations (ramp and replicated secret sharings), our schemes match Threshold Raccoon (del Pino et al. EUROCRYPT 2024)’s compact ~10kB size. Further, we unveil 'Death Star Detection', a new algorithm that enhances identifiable aborts by efficiently spotting short vector adversarial correlations, of interest beyond threshold signatures.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint.
- Contact author(s)
-
rafael del pino @ pqshield com
thomas espitau @ pqshield com
guilhem @ gniot fr
thomas prest @ pqshield com - History
- 2025-05-19: approved
- 2025-05-16: received
- See all versions
- Short URL
- https://ia.cr/2025/871
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/871,
author = {Rafael del Pino and Thomas Espitau and Guilhem Niot and Thomas Prest},
title = {Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/871},
year = {2025},
url = {https://eprint.iacr.org/2025/871}
}
