Paper 2024/1459
Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable
Abstract
We revisit the lattice-based verifiable oblivious PRF construction from PKC'21 and remove or mitigate its central three sources of inefficiency. First, applying Rényi divergence arguments, we eliminate one superpolynomial factor from the ciphertext modulus
Note: Full version following ASIACRYPT 2024 acceptance.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2024
- Keywords
- LatticesOblivious Pseudorandom FunctionThreshold Cryptography
- Contact author(s)
-
martin albrecht @ kcl ac uk
dgur1 @ cs umd edu - History
- 2025-01-23: revised
- 2024-09-18: received
- See all versions
- Short URL
- https://ia.cr/2024/1459
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1459, author = {Martin R. Albrecht and Kamil Doruk Gur}, title = {Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1459}, year = {2024}, url = {https://eprint.iacr.org/2024/1459} }