Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1995: STACS 95 pp 38–49Cite as

Communication complexity of key agreement on small ranges

Preliminary version

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 900))

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 [log2 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.

Cai was supported in part by NSF Grants CCR-9057486 and CCR-9319093, and by an Alfred P. Sloan Fellowship.

Supported in part by NSF Grant CCR-9304718.

Supported in part by NSF Grant CCR-9211174.

Supported in part by the NSF under grant CCR-9002292 and the JSPS under grant NSF-INT-9116781/JSPS-ENG-207.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ahlswede and I. Csiszàr. Common randomness in information theory and cryptography-part I: Secret sharing. IEEE Trans. Info. Thy., 39:1121–1132, 1993.

    Google Scholar 

  2. N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992. With an appendix by P. Erdös.

    Google Scholar 

  3. E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. 25th STOC, pages 91–100, 1993.

    Google Scholar 

  4. S. Chari, P. Rohatgi, and A. Srinivasan. Randomness-optimal unique element isolation, with applications to perfect matching and related problems. In Proc. 25th STOC, pages 458–467, 1993.

    Google Scholar 

  5. S. Chaudhuri, M. Herlihy, N. Lynch, and M. Tuttle. A tight lower bound for k-set agreement. In Proc. 34th FOCS, pages 206–215, 1993.

    Google Scholar 

  6. A. Goldberg and M. Sipser. Compression and ranking. SIAM J. Comput., 20, 1991.

    Google Scholar 

  7. O. Goldreich, R. Ostrovsky, and E. Petrank. Computational complexity and knowledge complexity. In Proc. 26th STOC, pages 534–543, 1994.

    Google Scholar 

  8. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18:186–208, 1989.

    Google Scholar 

  9. J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM J. Comput., 17:309–335, 1988.

    Google Scholar 

  10. M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proc. 25th STOC, pages 111–120, 1993.

    Google Scholar 

  11. M. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proc. 26th STOC, pages 243–252, 1994.

    Google Scholar 

  12. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18:1149–1178, 1989.

    Google Scholar 

  13. M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comp. Sci., 43:169–188, 1986.

    Google Scholar 

  14. R. Karp and M. Luby. Monte-Carlo algorithms for enumeration and reliability problems. In Proc. 24th FOCS, pages 56–64, 1983.

    Google Scholar 

  15. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proc. 25th STOC, pages 392–401, 1993.

    Google Scholar 

  16. M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie. On the learnability of discrete distributions. In Proc. 26th STOC, pages 273–282, 1994.

    Google Scholar 

  17. U. Maurer. Perfect cryptographic security from partially independent channels. In Proc. 23rd STOC, pages 561–572, 1991.

    Google Scholar 

  18. U. Maurer. Secret key agreement by public discussion from common information. IEEE Trans. Info. Thy., 39:733–742, 1993.

    Google Scholar 

  19. K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105–113, 1987.

    Google Scholar 

  20. M. Naor, A. Orlitsky, and P. Shor. Three results on interactive communication. IEEE Trans. Info. Thy., 39:1608–1615, 1993.

    Google Scholar 

  21. A. Orlitsky. Worst-case interactive communication I: Two messages are almost optimal. IEEE Trans. Info. Thy., 36:1111–1126, 1990.

    Google Scholar 

  22. A. Orlitsky. Worst-case interactive communication II: Two messages are not optimal. IEEE Trans. Info. Thy., 37:995–1005, 1991.

    Google Scholar 

  23. A. Orlitsky. Average-case interactive communication. IEEE Trans. Info. Thy., 38:1534–1547, 1992.

    Google Scholar 

  24. A. Orlitsky and A. El Gamal. Average and randomized communication complexity. IEEE Trans. Info. Thy., 36:3–16, 1990.

    Google Scholar 

  25. M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proc. 25th STOC, pages 101–110, 1993.

    Google Scholar 

  26. L. Sanchis and M. Fulk. On the efficient generation of language instances. SIAM J. Comput., 19:281–296, 1990.

    Google Scholar 

  27. A. Selman. A taxonomy of complexity classes of functions. J. Comp. Sys. Sci., 48:357–381, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State Univ. of NY at Buffalo, 14260-2000, Buffalo, NY

    Jin-Yi Cai, Kenneth W. Regan & D. Sivakumar

  2. Department of Computer Science, Princeton University, 08544, Princeton, NJ

    Richard J. Lipton

  3. Computer Science Department, University of Texas at El Paso, 79968, El Paso, TX

    Luc Longpré

  4. Department of Computer Science, University of Rochester, 14627, Rochester, NY

    Mitsunori Ogihara

Authors
  1. Jin-Yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard J. Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luc Longpré
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mitsunori Ogihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kenneth W. Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. D. Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr Claude Puech

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, JY., Lipton, R.J., Longpré, L., Ogihara, M., Regan, K.W., Sivakumar, D. (1995). Communication complexity of key agreement on small ranges. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-59042-0_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59042-2

  • Online ISBN: 978-3-540-49175-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation