Adaptively Secure Distributed PRFs from LWE

Benoît Libert, Damien Stehlé, and Radu Titiu

Abstract

In distributed pseudorandom functions (DPRFs), a PRF secret key $SK$ is secret shared among $N$ servers so that each server can locally compute a partial evaluation of the PRF on some input $X$. A combiner that collects $t$ partial evaluations can then reconstruct the evaluation $F(SK,X)$ of the PRF under the initial secret key. So far, all non-interactive constructions in the standard model are based on lattice assumptions. One caveat is that they are only known to be secure in the static corruption setting, where the adversary chooses the servers to corrupt at the very beginning of the game, before any evaluation query. In this work, we construct the first fully non-interactive adaptively secure DPRF in the standard model. Our construction is proved secure under the LWE assumption against adversaries that may adaptively decide which servers they want to corrupt. We also extend our construction in order to achieve robustness against malicious adversaries.

Note: Fixed one reference in the biblio

Available format(s)
Category
Cryptographic protocols
Publication info
A major revision of an IACR publication in TCC 2018
Keywords
LWEpseudorandom functionsdistributed PRFsthreshold cryptographyadaptive security
Contact author(s)
benoit libert @ ens-lyon fr
History
2019-05-17: last of 2 revisions
See all versions
Short URL
https://ia.cr/2018/927

CC BY

BibTeX

@misc{cryptoeprint:2018/927,
author = {Benoît Libert and Damien Stehlé and Radu Titiu},
title = {Adaptively Secure Distributed PRFs from LWE},
howpublished = {Cryptology ePrint Archive, Paper 2018/927},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/927}},
url = {https://eprint.iacr.org/2018/927}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.