

















Aron van Baarsen, Aarhus University
Adam Blatchley Hansen, Aarhus University
Kent Nielsen, Aarhus University
Peter Scholl, Aarhus University
We construct protocols for oblivious pseudorandom functions (OPRFs) based on alternating moduli assumptions in the "Crypto Dark Matter" paradigm (Boneh et al, TCC 2016). Prior OPRFs based on this type of assumption were only secure against a semi-honest adversary. We show how to obtain maliciously secure protocols, by leveraging new cut-and-choose techniques for generating correlated randomness based on vector oblivious linear evaluation (VOLE), which allow efficient conversions between different moduli in zero-knowledge and secure two-party computation. Compared with the state-of-the-art GOLD OPRF (Yang et al, S&P 2025), our construction has a faster online phase in all settings, as well as overall better efficiency in the small-batch setting. Furthermore, our construction supports obtaining a secret-shared output, and can be extended to handle secret-shared inputs. This opens up additional applications in variants of private set intersection and secure database operations.
BibTeX
@misc{cryptoeprint:2026/533,
author = {Diego F. Aranha and Aron van Baarsen and Adam Blatchley Hansen and Kent Nielsen and Peter Scholl},
title = {A Maliciously-Secure Post-Quantum {OPRF} from Crypto Dark Matter},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/533},
year = {2026},
doi = {10.1109/SP63933.2026.00221},
url = {https://eprint.iacr.org/2026/533}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。