Skip to Main content Skip to Navigation
Conference papers

Adaptively Secure Distributed PRFs from LWE

Benoît Libert 1, 2 Damien Stehlé 1, 2 Radu Titiu 2, 1, 3
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [72 references]  Display  Hide  Download

https://hal.inria.fr/hal-01911887
Contributor : Benoit Libert <>
Submitted on : Sunday, November 4, 2018 - 1:57:37 PM
Last modification on : Wednesday, November 20, 2019 - 3:15:44 AM
Long-term archiving on: : Tuesday, February 5, 2019 - 12:43:03 PM

File

DPRF-BLMR-v3.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Benoît Libert, Damien Stehlé, Radu Titiu. Adaptively Secure Distributed PRFs from LWE. TCC 2018 - 16th International Conference on Theory of Cryptography, Nov 2018, Panaji, India. pp.391-421, ⟨10.1007/978-3-030-03810-6_15⟩. ⟨hal-01911887⟩

Share

Metrics

Record views

128

Files downloads

273