Distributed pseudo-random functions and KDCs

Moni Naor; Benny Pinkas; Omer Reingold

doi:10.1007/3-540-48910-X_23

Distributed pseudo-random functions and KDCs

Moni Naor, Benny Pinkas, Omer Reingold

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

144 Scopus citations

Abstract

This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme is consistent, i.e. that given an input x all authorized subsets compute the same value f(x). The solutions we present enable the operation of many servers, preventing bottlenecks or single points of failure. There are also no single entities which can compromise the security of the entire network. The solutions can be used to distribute the operation of a Key Distribution Center (KDC). They are far better than the known partitioning to domains or replication solutions to this problem, and are especially suited to handle users of multicast groups.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Jacques Stern
Publisher	Springer Verlag
Pages	327-346
Number of pages	20
ISBN (Print)	3540658890, 9783540658894
DOIs	https://doi.org/10.1007/3-540-48910-X_23
State	Published - 1999
Externally published	Yes
Event	7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 - Prague, Czech Republic Duration: 2 May 1999 → 6 May 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1592
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999
Country/Territory	Czech Republic
City	Prague
Period	2/05/99 → 6/05/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Access to Document

10.1007/3-540-48910-X_23

Cite this

Naor, M., Pinkas, B., & Reingold, O. (1999). Distributed pseudo-random functions and KDCs. In J. Stern (Ed.), Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 327-346). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1592). Springer Verlag. https://doi.org/10.1007/3-540-48910-X_23

Naor, Moni ; Pinkas, Benny ; Reingold, Omer. / Distributed pseudo-random functions and KDCs. Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Jacques Stern. Springer Verlag, 1999. pp. 327-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e8bdc2d6d0c94608be1e99f7576576df,

title = "Distributed pseudo-random functions and KDCs",

abstract = "This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme is consistent, i.e. that given an input x all authorized subsets compute the same value f(x). The solutions we present enable the operation of many servers, preventing bottlenecks or single points of failure. There are also no single entities which can compromise the security of the entire network. The solutions can be used to distribute the operation of a Key Distribution Center (KDC). They are far better than the known partitioning to domains or replication solutions to this problem, and are especially suited to handle users of multicast groups.",

author = "Moni Naor and Benny Pinkas and Omer Reingold",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999 ; Conference date: 02-05-1999 Through 06-05-1999",

year = "1999",

doi = "10.1007/3-540-48910-X_23",

language = "אנגלית",

isbn = "3540658890",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "327--346",

editor = "Jacques Stern",

booktitle = "Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",

address = "גרמניה",

}

Naor, M, Pinkas, B & Reingold, O 1999, Distributed pseudo-random functions and KDCs. in J Stern (ed.), Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1592, Springer Verlag, pp. 327-346, 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999, Prague, Czech Republic, 2/05/99. https://doi.org/10.1007/3-540-48910-X_23

Distributed pseudo-random functions and KDCs. / Naor, Moni; Pinkas, Benny; Reingold, Omer.
Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Jacques Stern. Springer Verlag, 1999. p. 327-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1592).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed pseudo-random functions and KDCs

AU - Naor, Moni

AU - Pinkas, Benny

AU - Reingold, Omer

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme is consistent, i.e. that given an input x all authorized subsets compute the same value f(x). The solutions we present enable the operation of many servers, preventing bottlenecks or single points of failure. There are also no single entities which can compromise the security of the entire network. The solutions can be used to distribute the operation of a Key Distribution Center (KDC). They are far better than the known partitioning to domains or replication solutions to this problem, and are especially suited to handle users of multicast groups.

AB - This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme is consistent, i.e. that given an input x all authorized subsets compute the same value f(x). The solutions we present enable the operation of many servers, preventing bottlenecks or single points of failure. There are also no single entities which can compromise the security of the entire network. The solutions can be used to distribute the operation of a Key Distribution Center (KDC). They are far better than the known partitioning to domains or replication solutions to this problem, and are especially suited to handle users of multicast groups.

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

U2 - 10.1007/3-540-48910-X_23

DO - 10.1007/3-540-48910-X_23

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957653598

SN - 3540658890

SN - 9783540658894

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

SP - 327

EP - 346

BT - Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Stern, Jacques

PB - Springer Verlag

T2 - 7th International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999

Y2 - 2 May 1999 through 6 May 1999

ER -

Naor M, Pinkas B, Reingold O. Distributed pseudo-random functions and KDCs. In Stern J, editor, Advances in Cryptology – EUROCRYPT 1999 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 1999. p. 327-346. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48910-X_23

Distributed pseudo-random functions and KDCs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this