Olingo: Threshold Lattice Signatures with DKG and Identifiable Abort
Kamil Doruk Gur, Patrick Hough, Jonathan Katz, Caroline Sandsbråten, Tjerand Silde
摘要
We present Olingo, a framework for threshold lattice signatures that is the first to offer all desired properties for real-world implementations of quantum-secure threshold signatures: small keys and signatures, low communication and round complexity, noninteractive online signing, distributed key generation (DKG), and identifiable abort. Our starting point is the framework by Gur, Katz, and Silde (PQCrypto 2024). We change the underlying signature scheme to Raccoon (Katsumata et al, Crypto 2024), remove the trapdoor commitments, extend the scheme from two to three rounds, and then apply numerous improvements and optimizations to achieve all the above properties. We provide detailed proofs of security for our new framework and present concrete parameters and benchmarks. At the 128-bit security level, for up to 1024 parties and supporting 2 60 signatures, our scheme has 4.4 KB public keys and 11.3 KB signatures; while signing requires communication of 852 KB per party using the LaBRADOR proof system (Beullens and Seiler, Crypto 2023). An optimistic non-interactive version of our scheme requires only 76 KB communication per party. 1
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper25
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- On the Security of Two-Round Multi-SignaturesManu Drijvers, Kasra Edalatnejad, Bryan Ford, Eike Kiltz 等S&P 2019 · 被引用 126 次
- Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More GeneralVadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime PlançonCRYPTO 2022 · 被引用 125 次
- On the Adaptive Security of the Threshold BLS Signature SchemeRenas Bacho, Julian LossCCS 2022 · 被引用 75 次
- Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of PartiesCraig Gentry, Shai Halevi, Vadim LyubashevskyEUROCRYPT 2022 · 被引用 65 次
相关 Paper
- Ringtail: Practical Two-Round Threshold Signatures from Learning with ErrorsCecilia Boschini, Darya Kaviani, Russell W. F. Lai, Giulio Malavolta 等S&P 2025
- Threshold Raccoon: Practical Threshold Signatures from Standard Lattice AssumptionsRafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem 等EUROCRYPT 2024 · 被引用 61 次
- Efficient Threshold ML-DSASofía Celi, Rafael del Pino, Thomas Espitau, Guilhem Niot 等USENIX Security 2026 · 被引用 1 次
- Two-Round Threshold Signature from Algebraic One-More Learning with ErrorsThomas Espitau, Shuichi Katsumata, Kaoru TakemureCRYPTO 2024 · 被引用 25 次
- Quorus: Efficient, Scalable Threshold ML-DSA Signatures from MPCAlexander Bienstock, Leo de Castro, Daniel Escudero, Antigoni Polychroniadou 等USENIX Security 2026 · 被引用 1 次
