A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management

ePrint Report: A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management

Matthias Geihs, Hart Montgomery

We initiate the study of lattice-based pseudo-random functions (PRFs) for use in multi-party computation protocols, motivated by their application to distributed key management. We show that the LWE-based PRF of Boneh et al. (CRYPTO'13) can be turned into a distributed PRF protocol that runs in only 8 online rounds, improving over the state-of-the-art by an order of magnitude. The resulting protocol …

application computation distributed eprint report functions key key management low management party protocols random report study