Sharing random bits with no process coordination
Download:
|
|
by Marius Zimand
ftp://136.160.177.125/pub/sh-ex2.ps
Add To MetaCart
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.
Citations
| 474 | A pseudorandom generator from any one-way function – stad, Impagliazzo, et al. - 1999 |
| 230 | A hard-core predicate for all one-way functions – Goldreich, Levin - 1989 |
| 164 | Foundations of Cryptography (Fragments of a Book). Weizmann institute of science – Goldreich - 1995 |
| 55 | On extracting randomness from weak random sources – Ta-Shma - 1996 |
| 47 | Extracting randomness: How and why: A survey – Nisan - 1996 |
| 17 | Very strong one-way functions and pseudo-random generators exist relative to a random oracle. (manuscript – Impagliazzo - 1996 |
| 5 | How to privatize random bits – Zimand - 1996 |
