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. 1
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1001
|
How to share a secret
– Shamir
- 1979
|
|
897
|
Random oracles are practical: A paradigm for designing efficient protocols
– Bellare, Rogaway
- 1993
|
|
697
|
Using encryption for authentication in large networks of computers
– Needham, Schroeder
- 1978
|
|
480
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
468
|
Completeness theorems for non-cryptographic fault-tolerant distributed computation
– Ben-Or, Goldwasser, et al.
- 1988
|
|
357
|
Undeniable signatures
– Chaum, Antwerpen
|
|
304
|
Multiparty unconditionally secure protocols
– Chaum, Crépeau, et al.
- 1988
|
|
266
|
How to play any mental game
– Goldreich, Micali, et al.
- 1987
|
|
210
|
Efficient identification and signatures for smart cards
– Schnorr
|
|
197
|
Threshold cryptosystem
– Desmedt, Frankel
- 1989
|
|
170
|
Provably secure session key distribution: the three party case
– Bellare, Rogaway
- 1995
|
|
140
|
Oblivious transfer and polynomial evaluation
– Noar, Pinkas
- 1999
|
|
135
|
Pseudorandomness and Cryptographic Applications
– Luby
- 1996
|
|
133
|
The Decision Diffie-Hellman Problem
– Boneh
- 1998
|
|
108
|
On span programs
– Karchmer, Wigderson
- 1993
|
|
97
|
Robust threshold DSS signatures
– Gennaro, Jarecki, et al.
- 1996
|
|
77
|
and U.Maurer: General Secure Multiparty Computation from Any Linear Secret-Sharing Scheme, EuroCrypt 2000
– Cramer
|
|
69
|
A Simplified Approach to Threshold and Proactive RSA. Crypto ’98
– Rabin
|
|
66
|
How to Share a Function Securely
– Santis, Desmedt, et al.
|
|
63
|
Perfectly secure message transmission
– Dolev, Dwork, et al.
- 1993
|
|
62
|
Towards realizing random oracles: Hash functions that hide all partial information
– Canetti
|
|
62
|
A.: The load, capacity, and availability of quorum systems
– Naor, Wool
- 1998
|
|
48
|
Proactive Security: Longterm Protection Against
– Canetti, Gennaro, et al.
- 1997
|
|
47
|
An Efficient Threshold Public-Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. Eurocrypt ’99
– Canetti, Goldwasser
|
|
47
|
Increasing availability and security of an authentication service
– Gong
- 1993
|
|
45
|
On sharing secrets and reed-solomon codes
– McEliece, Sarwate
- 1981
|
|
42
|
Transaction Protection by Beacons
– Rabin
- 1983
|
|
35
|
An optimal probabilistic protocol for synchronous Byzantine agreement
– Feldman, Micali
- 1997
|
|
28
|
Access control and signatures via quorum secret sharing
– Naor, Wool
- 1996
|
|
27
|
Synthesizers and their application to the parallel construction of pseudo-random functions
– Naor, Reingold
- 1999
|
|
25
|
An Introduction to Threshold Cryptography
– Gemmell
- 1997
|
|
20
|
Algorithmic Number Theory, Vol. 1: Efficient Algorithms. MITPress
– Bach, Shallit
- 1996
|
|
20
|
The random oracle model, revisited
– Canetti, Goldreich, et al.
- 1998
|
|
20
|
Network Security
– Kaufmaan, Perlman, et al.
|
|
20
|
Secure and efficient metering
– Naor, Pinkas
- 1998
|
|
19
|
Secure schemes for secret sharing and key distribution”, DSc dissertation
– Beimel
|
|
17
|
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs
– Naor, Reingold
- 1998
|
|
13
|
A simple method for generating and sharing pseudorandom functions, with applications to clipper-like key escrow systems
– Micali, Sidney
|
|
12
|
private communication
– Benaloh, Rudich
- 1989
|
|
2
|
Maintaining secure communication in networks for long terms, manuscript
– Naor, Pinkas
- 1999
|
|
2
|
The random oracle model, revisited, to appear in
– Canetti, Goldreich, et al.
- 1998
|
|
1
|
Naor M., "A Formal Treatment of Remotely Keyed Encryption
– Feigenbaum
- 1998
|
|
1
|
Foundations of Cryptography" (fragments of a book
– Goldreich
- 1995
|
|
1
|
Reingold O., "Number-Theoretic constructions of efficient pseudorandom functions
– Naor
- 1997
|
