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, we propose two new constructions. First, we propose an optimized threshold-PRF with significantly reduced round and communication complexity. We achieve this by improving the underlying bit truncation protocol, as well as the lower bound on the required number of LWR instances. Second, we show that the same underlying PRF construction lends itself as a basis for a novel and efficient exponent-VRF. We implement prototypes of both of our contributions and demonstrate their practical performance.
Note: update github links
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Threshold PRFExponent VRFLWR
- Contact author(s)
- matthias @ tor us
- History
- 2024-06-24: last of 2 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},
note = {\url{https://eprint.iacr.org/2024/996}},
url = {https://eprint.iacr.org/2024/996}
}
