We consider the amount of randomness used in private computations. Specifically, we show how to compute the exclusive-or (xor) of n boolean inputs t-privately, using only O(t
|
1289
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
468
|
Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations
– Ben-Or, Goldwasser, et al.
|
|
466
|
How to generate Cryptographically Strong Sequences of Pseudo-Random Bits
– Blum, Micali
- 1984
|
|
415
|
Theory and applications of trapdoor functions
– Yao
- 1982
|
|
304
|
How to generate and exchange secrets
– Yao
- 1986
|
|
303
|
Multiparty unconditionally secure protocols
– Chaum, Crépeau, et al.
- 1988
|
|
266
|
How to Play Any Mental Game
– Goldreich, Micali, et al.
|
|
208
|
Small bias probability spaces: efficient constructions and applications
– Naor, Naor
- 1993
|
|
201
|
Simple Constructions of Almost k-wise Independent Random Variables. Random Structures and Algorithms
– Alon, Goldreich, et al.
- 1992
|
|
167
|
How to recycle random bits
– Impagliazzo, Zuckerman
- 1989
|
|
125
|
Unbiased bits from sources of weak randomness and probabilistic communication complexity
– Chor, Goldreich
- 1988
|
|
115
|
Pseudorandom Generators for Space Bounded Computation
– Nisan
- 1992
|
|
95
|
Non-cryptographic fault-tolerant computing in a constant number of rounds
– Bar-Ilan, Beaver
|
|
95
|
Simulating BPP using a general weak random source
– Zuckerman
- 1996
|
|
82
|
Dispersers, deterministic amplification, and weak random sources
– Cohen, Wigderson
- 1989
|
|
59
|
A zero–one law for Boolean privacy
– Chor, Kushilevitz
- 1991
|
|
56
|
Adaptively secure multi-party computation
– Canetti, Feige, et al.
|
|
50
|
Random polynomial time is equal to slightly-random polynomial time
– Vazirani, Vazirani
- 1985
|
|
49
|
The complexity of nonuniform random number generation
– Knuth, Yao
- 1976
|
|
45
|
Communication complexity of secure computation
– Franklin, Yung
- 1992
|
|
35
|
Constructing small sample spaces satisfying given constraints
– Koller, Megiddo
- 1993
|
|
33
|
Perfect Privacy for Two-Party Protocols
– Beaver
- 1989
|
|
31
|
Reducibility and Completeness In Multi-Party Private Computations
– Kushilevitz, Micali, et al.
- 1994
|
|
27
|
Randomness in Interactive Proofs
– Bellare, Goldreich, et al.
- 1993
|
|
23
|
A Time-Randomness Tradeoff for Oblivious Routing
– Krizanc, Peleg, et al.
- 1988
|
|
22
|
De)randomized Construction of Small Sample Spaces in NC
– Karger, Koller
- 1994
|
|
22
|
Sample Spaces Uniform on Neighborhoods
– Schulman
- 1992
|
|
21
|
On Construction of k-wise Independent Random Variables
– Karloff, Mansour
- 1994
|
|
19
|
On the structure of the privacy hierarchy
– Chor, Gereb-Graus, et al.
- 1994
|
|
16
|
On the Number of Random Bits in Totally Private Computations
– Blundo, De-Santis, et al.
- 1995
|
|
14
|
Characterizing Linear Size Circuits in Terms of Privacy
– Kushilevitz, Ostrovsky, et al.
- 1996
|
|
13
|
Private Computations Over the Integers
– Chor, Ger'eb-Graus, et al.
- 1995
|
|
13
|
Privacy and Communication Complexity", FOCS 89
– Kushilevitz
- 1992
|
|
13
|
A Randomness-Rounds Tradeoff in Private Computation
– Kushilevitz, Ros'en
- 1998
|
|
12
|
Bounds on Tradeoffs between Randomness and Communication Complexity
– Canetti, Goldreich
- 1993
|
|
12
|
Memory vs. Randomization in On-Line Algorithms
– Raghavan, Snir
- 1989
|
|
11
|
Derandomization through Approximation: An NC Algorithm for Minimum Cuts
– Karger, Motwani
- 1994
|
|
10
|
A Communication-Privacy Tradeoff for Modular Addition
– Chor, Kushilevitz
- 1993
|
|
9
|
A Randomness-Rounds Tradeoff
– Kushilevitz, Ros'en
- 1994
|
|
9
|
On the Dealer's Randomness Required in Secret Sharing Schemes
– Blundo, Gaggia, et al.
- 1995
|
|
8
|
Randomness in Distribution Protocols
– Blundo, De-Santis, et al.
- 1994
|
|
6
|
Private Computations Over the Integers", FOCS 90
– Chor, Ger'eb-Graus, et al.
- 1995
|
|
1
|
Private Computations over the Integers ", FOCS 90
– Chor, Ger'eb-Graus, et al.
- 1995
|
|
1
|
On the Number of Random Bits in Totally Private Computations
– Vaccaro
- 1995
|
|
1
|
Privacy and Communication Complexity ", FOCS 89
– Kushilevitz
- 1992
|
|
