[MPTC-forum] LoTRS
35 views
Skip to first unread message
Nikai Jagganath
Jul 9, 2026, 1:15:25 AMJul 9
to MPTC-forum, lotrs...@googlegroups.com
Hi MPTC Forum,
On July 08, 2026, at 11:30, in Talk 2a3 (Threshold Call Preview Talks Phase 2), we presented LoTRS — Lord of the RingS — our lattice-based post-quantum structured threshold ring signature scheme. In this work, we introduce structured threshold ring signatures, or sTRS, where public keys can be arranged as a T×N table and a valid quorum is one hidden column of T signers; the verifier learns that an admissible quorum signed, but not which quorum it was. LoTRS instantiates this idea by combining a two-round lattice-based multi-signature layer derived from DualMS with a lattice one-out-of-many proof — “One (Ring) Proof to Rule them all.” The scheme avoids Shamir secret sharing, distributed key generation, cryptographic group managers, and trusted setup trapdoors; each signer keeps an ordinary locally generated lattice signing key. Our submission includes Python and Rust implementations, deterministic test vectors, parameter-estimation scripts, and benchmarks. At the headline setting N=100, T=50, corresponding to a structured ring of 5000 public keys, LoTRS produces signatures of about 35.8 KiB, around 3.5 times smaller than the previous best lattice-based threshold ring signature comparison point.
LoTRS Team: Muhammed Esgin, Nikai Jagganath, Dongxi Liu, Markku-Juhani O. Saarinen, Amin Sakzad, and Ron Steinfeld.
We'd be very happy to hear your feedback!
On July 08, 2026, at 11:30, in Talk 2a3 (Threshold Call Preview Talks Phase 2), we presented LoTRS — Lord of the RingS — our lattice-based post-quantum structured threshold ring signature scheme. In this work, we introduce structured threshold ring signatures, or sTRS, where public keys can be arranged as a T×N table and a valid quorum is one hidden column of T signers; the verifier learns that an admissible quorum signed, but not which quorum it was. LoTRS instantiates this idea by combining a two-round lattice-based multi-signature layer derived from DualMS with a lattice one-out-of-many proof — “One (Ring) Proof to Rule them all.” The scheme avoids Shamir secret sharing, distributed key generation, cryptographic group managers, and trusted setup trapdoors; each signer keeps an ordinary locally generated lattice signing key. Our submission includes Python and Rust implementations, deterministic test vectors, parameter-estimation scripts, and benchmarks. At the headline setting N=100, T=50, corresponding to a structured ring of 5000 public keys, LoTRS produces signatures of about 35.8 KiB, around 3.5 times smaller than the previous best lattice-based threshold ring signature comparison point.
Links:
- Preview Writeup: https://csrc.nist.gov/csrc/media/Projects/threshold-cryptography/documents/TCall-1/LoTRS-PW02.pdf
- ePrint Paper: https://ia.cr/2026/974
LoTRS Team: Muhammed Esgin, Nikai Jagganath, Dongxi Liu, Markku-Juhani O. Saarinen, Amin Sakzad, and Ron Steinfeld.
We'd be very happy to hear your feedback!
LoTRS Team
Reply all
Reply to author
Forward
0 new messages