Distributed Pseudo-random functions and KDCs

Authors:
Moni Naor;Benny Pinkas;Omer Reingold
Affiliations:
Dept. of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel;Dept. of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel;Dept. of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel
Venue:
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Year:
1999

Citing 31
Cited 29

How to construct random functions

Journal of the ACM (JACM)
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
How to share a function securely

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Provably secure session key distribution: the three party case

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Algorithmic number theory

Algorithmic number theory
Access control and signatures via quorum secret sharing

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Load, Capacity, and Availability of Quorum Systems

SIAM Journal on Computing
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On sharing secrets and Reed-Solomon codes

Communications of the ACM
How to share a secret

Communications of the ACM
Using encryption for authentication in large networks of computers

Communications of the ACM
Pseudorandomness and Cryptographic Applications

Pseudorandomness and Cryptographic Applications
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Efficient Identification and Signatures for Smart Cards

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Synthesizers and their application to the parallel construction of pseudo-random functions

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Number-theoretic constructions of efficient pseudo-random functions

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Robust threshold DSS signatures

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

The proactive security toolkit and applications

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On the Distribution of a Key Distribution Center

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Compressing Cryptographic Resources

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Secure and Efficient Asynchronous Broadcast Protocols

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
A Threshold Pseudorandom Function Construction and Its Applications

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
On Unconditionally Secure Robust Distributed Key Distribution Centers

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures

ISC '01 Proceedings of the 4th International Conference on Information Security
A Distributed and Computationally Secure Key Distribution Scheme

ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient Construction of (Distributed) Verifiable Random Functions

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A ramp model for distributed key distribution schemes

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
Shared generation of pseudo-random functions

Journal of Complexity - Special issue on coding and cryptography
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures

Theoretical Computer Science
CODEX: A Robust and Secure Secret Distribution System

IEEE Transactions on Dependable and Secure Computing
A unified model for unconditionally secure key distribution

Journal of Computer Security
Verifying distributed erasure-coded data

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Weak Pseudorandom Functions in Minicrypt

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Improving privacy and security in multi-authority attribute-based encryption

Proceedings of the 16th ACM conference on Computer and communications security
Asymmetric key pre-distribution scheme for sensor networks

IEEE Transactions on Wireless Communications
Noninteractive self-certification for long-lived mobile ad hoc networks

IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Energy-efficient and non-interactive self-certification in MANETs

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Authenticated data structures for graph and geometric searching

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On everlasting security in the hybrid bounded storage model

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Share conversion, pseudorandom secret-sharing and applications to secure computation

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On error correction in the exponent

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Threshold and proactive pseudo-random permutations

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.