## Abstract

The properties of weak sources of randomness have been investigated in many contexts and using several models of weakly random behaviour. For two such models, developed by Santha and Vazirani, and Chor and Goldreich, it is known that the output from one such source cannot be “compressed” to produce nearly random bits. At the same time, however, a single source is sufficient to solve problems in the randomized complexity classes BPP and RP. It is natural to ask exactly which tasks can be done using a single, weak source of randomness and which cannot. The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure “one-time-pad” type of cryptosystem.

Original language | English |
---|---|

Title of host publication | Advances in Cryptology – CRYPTO 1990, Proceedings |

Editors | Alfred J. Menezes, Scott A. Vanstone |

Publisher | Springer Verlag |

Pages | 421-435 |

Number of pages | 15 |

ISBN (Print) | 9783540545088 |

DOIs | |

State | Published - 1991 |

Externally published | Yes |

Event | 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 - Santa Barbara, United States Duration: 11 Aug 1990 → 15 Aug 1990 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 537 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 |
---|---|

Country/Territory | United States |

City | Santa Barbara |

Period | 11/08/90 → 15/08/90 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1991.