Paper 2025/1950
Fully Adaptive FROST in the Algebraic Group Model From Falsifiable Assumptions
, Friedrich-Alexander-Universität Erlangen–Nürnberg, TU Wien, TU Wien, TU Wien, TU Wien, George Washington UniversityAbstract
We present the first round-optimal Schnorr threshold signature scheme that achieves full adaptive security against algebraic adversaries, relying solely on the Algebraic One-More Discrete Log (AOMDL) assumption. Our scheme, FaFROST, builds on the FROST framework preserving its two-round signing structure and communication efficiency. By avoiding binding commitments to partial public keys, FaFROST circumvents the recent impossibility results from CRYPTO’25 and requires no reliance on the newly introduced, tailor-made LDVR assumption. This establishes that round-optimal, adaptively secure Schnorr threshold signatures are achievable under well-established algebraic assumptions.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Threshold SignaturesSchnorr SignaturesAdaptive Security
- Contact author(s)
-
ruben baecker @ fau de
paul gerhart @ tuwien ac at
davide li calsi @ tuwien ac at
luigi russo @ tuwien ac at
dominique schroeder @ tuwien ac at
arkady @ gwu edu - History
- 2025-11-12: revised
- 2025-10-19: received
- See all versions
- Short URL
- https://ia.cr/2025/1950
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1950,
author = {Ruben Baecker and Paul Gerhart and Davide Li Calsi and Luigi Russo and Dominique Schröder and Arkady Yerukhimovich},
title = {Fully Adaptive {FROST} in the Algebraic Group Model From Falsifiable Assumptions},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1950},
year = {2025},
url = {https://eprint.iacr.org/2025/1950}
}
