## Distributed computing and cryptography with general weak random sources

dc.contributor.advisor | Zuckerman, David I. | en |

dc.contributor.committeeMember | Alvisi, Lorenzo | en |

dc.contributor.committeeMember | Kalai, Yael | en |

dc.contributor.committeeMember | Klivans, Adam | en |

dc.contributor.committeeMember | Waters, Brent | en |

dc.creator | Li, Xin, Ph. D. | en |

dc.date.accessioned | 2015-08-14T18:41:23Z | en |

dc.date.issued | 2011-08 | en |

dc.date.submitted | August 2011 | en |

dc.date.updated | 2015-08-14T18:41:24Z | en |

dc.description.abstract | The use of randomness in computer science is ubiquitous. Randomized protocols have turned out to be much more efficient than their deterministic counterparts. In addition, many problems in distributed computing and cryptography are impossible to solve without randomness. However, these applications typically require uniform random bits, while in practice almost all natural random phenomena are biased. Moreover, even originally uniform random bits can be damaged if an adversary learns some partial information about these bits. In this thesis, we study how to run randomized protocols in distributed computing and cryptography with imperfect randomness. We use the most general model for imperfect randomness where the weak random source is only required to have a certain amount of min-entropy. One important tool here is the randomness extractor. A randomness extractor is a function that takes as input one or more weak random sources, and outputs a distribution that is close to uniform in statistical distance. Randomness extractors are interesting in their own right and are closely related to many other problems in computer science. Giving efficient constructions of randomness extractors with optimal parameters is one of the major open problems in the area of pseudorandomness. We construct network extractor protocols that extract private random bits for parties in a communication network, assuming that they each start with an independent weak random source, and some parties are corrupted by an adversary who sees all communications in the network. These protocols imply fault-tolerant distributed computing protocols and secure multi-party computation protocols where only imperfect randomness is available. The probabilistic method shows that there exists an extractor for two independent sources with logarithmic min-entropy, while known constructions are far from achieving these parameters. In this thesis we construct extractors for two independent sources with any linear min-entropy, based on a computational assumption. We also construct the best known extractors for three independent sources and affine sources. Finally we study the problem of privacy amplification. In this model, two parties share a private weak random source and they wish to agree on a private uniform random string through communications in a channel controlled by an adversary, who has unlimited computational power and can change the messages in arbitrary ways. All previous results assume that the two parties have local uniform random bits. We show that this problem can be solved even if the two parties only have local weak random sources. We also improve previous results in various aspects by constructing the first explicit non-malleable extractor and giving protocols based on this extractor. | en |

dc.description.department | Computer Sciences | en |

dc.format.mimetype | application/pdf | en |

dc.identifier.uri | http://hdl.handle.net/2152/30361 | en |

dc.subject | Randomness | en |

dc.subject | Weak random source | en |

dc.subject | Extractor | en |

dc.subject | Distributed computing | en |

dc.subject | Cryptography | en |

dc.title | Distributed computing and cryptography with general weak random sources | en |

dc.type | Thesis | en |

thesis.degree.department | Computer Sciences | en |

thesis.degree.discipline | Computer Science | en |

thesis.degree.grantor | The University of Texas at Austin | en |

thesis.degree.level | Doctoral | en |

thesis.degree.name | Doctor of Philosophy | en |