Paper 2024/996
Great-LaKeys: An Improved Threshold-PRF and a Novel Exponent-VRF from LWR
Abstract
Building on the recently proposed LWR-based threshold-PRF LaKey (USENIX'24), we propose two new constructions. First, we propose an optimized variant of the LaKey threshold-PRF with significantly reduced round and communication complexity. We achieve this by improving the underlying bit truncation protocol, which may be of independent interest, and by providing tighter parameter bounds. Second, we show that the underlying LWR-based PRF can be proven efficiently in zero-knowledge, and thereby yields a novel and practically efficient exponent-VRF. We provide prototype implementations of both of our constructions and evaluate their concrete performance.
Note: fix evrf proof system
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Latincrypt 2025
- Keywords
- Threshold PRFExponent VRFLWRMPCZK
- Contact author(s)
- matthias geihs @ consensys net
- History
- 2025-08-10: last of 4 revisions
- 2024-06-20: received
- See all versions
- Short URL
- https://ia.cr/2024/996
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/996,
author = {Matthias Geihs},
title = {Great-{LaKeys}: An Improved Threshold-{PRF} and a Novel Exponent-{VRF} from {LWR}},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/996},
year = {2024},
url = {https://eprint.iacr.org/2024/996}
}
