Paper 2024/467
Partially Non-Interactive Two-Round Lattice-Based Threshold Signatures
Abstract
This paper gives the first lattice-based two-round threshold signature based on lattice assumptions for which the first message is independent of the message being signed without relying on fully-homomorphic encryption, and our construction supports arbitrary thresholds. Our construction provides a careful instantiation of a generic threshold signature construction by Tessaro and Zhu (EUROCRYPT ’23) based on specific linear hash functions, which in turns can be seen as a generalization of the FROST scheme by Komlo and Goldberg (SAC ’20). Our reduction techniques are new in the context of lattice-based cryptography. Also, our scheme does not use any heavy tools, such as NIZKs or homomorphic trapdoor commitments.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Threshold SignaturesLatticesSIS
- Contact author(s)
-
rchairat @ cs washington edu
tessaro @ cs washington edu
zhucz20 @ cs washington edu - History
- 2024-04-01: revised
- 2024-03-20: received
- See all versions
- Short URL
- https://ia.cr/2024/467
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/467, author = {Rutchathon Chairattana-Apirom and Stefano Tessaro and Chenzhi Zhu}, title = {Partially Non-Interactive Two-Round Lattice-Based Threshold Signatures}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/467}, year = {2024}, url = {https://eprint.iacr.org/2024/467} }