Sharing Random Bits with No Process Coordination

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 7
Cited 0

How to construct random functions

Journal of the ACM (JACM)
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On extracting randomness from weak random sources (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness-optimal sampling, extractors, and constructive leader election

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Extracting Randomness: How and Why - A survey

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
How to Privatize Random Bits

How to Privatize Random Bits

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits and access to a server providing random strings. The method assumes no coordination among the processes. The error probability increases by only an additive negligible term, and the time complexity of each process increases by at most a polylog factor. The main contribution of the paper is in reducing the length of the local random string from (roughly) quadratic (as reported in [Zim97]) to (roughly) linear in the logarithm of the length of the input.