[Resource Topic] 2006/017: Threshold and Proactive Pseudo-Random Permutations

Welcome to the resource topic for 2006/017

Threshold and Proactive Pseudo-Random Permutations

Authors: Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung


We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n-1)/2 of n dishonest servers in the semi-honest environment. Many protocols that use PRPs (e.g., a CBC block cipher mode) can now be translated into the distributed setting. Our main technique for constructing invertible threshold PRPs is a distributed Luby-Rackoff construction where both the secret keys and the input are shared among the servers. We also present protocols for obliviously computing pseudo-random functions by Naor-Reingold and Dodis-Yampolskiy with shared input and keys.

ePrint: https://eprint.iacr.org/2006/017

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .