Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Threshold and Proactive Pseudo-Random Permutations
verfasst von : Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 [41] and Dodis-Yampolskiy [25] with shared input and keys.