Communication complexity of key agreement on small ranges

Jin Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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 [log2k] 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 languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages38-49
Number of pages12
Volume900
ISBN (Print)3540590420, 9783540590422
StatePublished - 1995
Externally publishedYes
Event12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 - Munich, Germany
Duration: Mar 2 1995Mar 4 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume900
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995
CountryGermany
CityMunich
Period3/2/953/4/95

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cai, J. Y., Lipton, R. J., Longpré, L., Ogihara, M., Regan, K. W., & Sivakumar, D. (1995). Communication complexity of key agreement on small ranges. In 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.