### Abstract

We study a variation on classical key-agreement and consensus problems in which the key space S is the range of a random variable that can be sampled. We give tight upper and lower bounds of [log_{2}k] bits on the communication complexity of agreement on some key in S, using a form of Sperner’s Lemma, and give bounds on other problems. In the case where keys are generated by a probabilistic polynomial-time Turing machine, we show agreement possible with zero communication if every fully polynomial-time approximation scheme (fpras) has a certain symmetry-breaking property.

Original language | English (US) |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 38-49 |

Number of pages | 12 |

Volume | 900 |

ISBN (Print) | 3540590420, 9783540590422 |

State | Published - 1995 |

Externally published | Yes |

Event | 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 - Munich, Germany Duration: Mar 2 1995 → Mar 4 1995 |

### Publication series

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

Volume | 900 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 |
---|---|

Country | Germany |

City | Munich |

Period | 3/2/95 → 3/4/95 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 900, pp. 38-49). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 900). Springer Verlag.