TALUS: Threshold ML-DSA with One-Round Online Signing via Boundary Clearance and Carry Elimination
Leo Kao

TL;DR
TALUS introduces a novel threshold ML-DSA scheme enabling one-round online signing with high success rate and standard verifiability, overcoming fundamental theoretical barriers through innovative boundary and carry techniques.
Contribution
It presents the first threshold ML-DSA construction with one-round signing, formalizes the Lattice Threshold Trilemma, and introduces Boundary Clearance and Carry Elimination techniques.
Findings
Achieves >99% online signing success rate.
Completes signing in under 2 ms in TEE deployment.
Matches the performance of fastest existing threshold ML-DSA schemes.
Abstract
Deploying ML-DSA (FIPS 204) in threshold settings has remained an open problem: the scheme's inherently non-linear rounding step defeats the additive share techniques that underpin practical threshold schemes for elliptic-curve signatures such as FROST. We present TALUS, the first threshold ML-DSA construction that achieves one-round online signing with >99% online success, while producing standard signatures verifiable by any unmodified ML-DSA verifier. We formalise this as the Lattice Threshold Trilemma, proving that no group homomorphism from the ML-DSA nonce space into any abelian group can simultaneously be hiding and binding, ruling out all possible homomorphic commitment schemes. TALUS overcomes this barrier with two techniques. The Boundary Clearance Condition (BCC) identifies nonces whose rounding residuals lie far enough from modular boundaries that the secret key component s2…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Cryptography and Data Security · Security and Verification in Computing
