Threshold and proactive pseudo-random permutations

Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings
Pages542-560
Number of pages19
Volume3876 LNCS
DOIs
StatePublished - 2006
Event3rd Theory of Cryptography Conference, TCC 2006 - New York, NY, United States
Duration: Mar 4 2006Mar 7 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3876 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd Theory of Cryptography Conference, TCC 2006
CountryUnited States
CityNew York, NY
Period3/4/063/7/06

Fingerprint

Random Permutation
Network protocols
Servers
Server
Pseudorandom Function
Block Cipher
Invertible
Computing
Communication

Keywords

  • Distributed Block Ciphers
  • Distributed Luby-Rackoff Construction
  • Oblivious Pseudo-Random Functions
  • Threshold Cryptography

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Dodis, Y., Yampolskiy, A., & Yung, M. (2006). Threshold and proactive pseudo-random permutations. In Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings (Vol. 3876 LNCS, pp. 542-560). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3876 LNCS). https://doi.org/10.1007/11681878_28

Threshold and proactive pseudo-random permutations. / Dodis, Yevgeniy; Yampolskiy, Aleksandr; Yung, Moti.

Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings. Vol. 3876 LNCS 2006. p. 542-560 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3876 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y, Yampolskiy, A & Yung, M 2006, Threshold and proactive pseudo-random permutations. in Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings. vol. 3876 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3876 LNCS, pp. 542-560, 3rd Theory of Cryptography Conference, TCC 2006, New York, NY, United States, 3/4/06. https://doi.org/10.1007/11681878_28
Dodis Y, Yampolskiy A, Yung M. Threshold and proactive pseudo-random permutations. In Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings. Vol. 3876 LNCS. 2006. p. 542-560. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11681878_28
Dodis, Yevgeniy ; Yampolskiy, Aleksandr ; Yung, Moti. / Threshold and proactive pseudo-random permutations. Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings. Vol. 3876 LNCS 2006. pp. 542-560 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{097a0aaf75d64e6291184c34e625d92c,
title = "Threshold and proactive pseudo-random permutations",
abstract = "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.",
keywords = "Distributed Block Ciphers, Distributed Luby-Rackoff Construction, Oblivious Pseudo-Random Functions, Threshold Cryptography",
author = "Yevgeniy Dodis and Aleksandr Yampolskiy and Moti Yung",
year = "2006",
doi = "10.1007/11681878_28",
language = "English (US)",
isbn = "3540327312",
volume = "3876 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "542--560",
booktitle = "Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings",

}

TY - GEN

T1 - Threshold and proactive pseudo-random permutations

AU - Dodis, Yevgeniy

AU - Yampolskiy, Aleksandr

AU - Yung, Moti

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Distributed Block Ciphers

KW - Distributed Luby-Rackoff Construction

KW - Oblivious Pseudo-Random Functions

KW - Threshold Cryptography

UR - http://www.scopus.com/inward/record.url?scp=33745526470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745526470&partnerID=8YFLogxK

U2 - 10.1007/11681878_28

DO - 10.1007/11681878_28

M3 - Conference contribution

SN - 3540327312

SN - 9783540327318

VL - 3876 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 542

EP - 560

BT - Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings

ER -