Communication Complexity of Key Agreement on Small Ranges

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.

[1]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[2]  Laura A. Sanchis,et al.  On the Efficient Generation of Language Instances , 1990, SIAM J. Comput..

[3]  Alan L. Selman,et al.  A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[4]  Ueli Maurer,et al.  Perfect cryptographic security from partially independent channels , 1991, STOC '91.

[5]  Andrew V. Goldberg,et al.  Compression and ranking , 1985, STOC '85.

[6]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[7]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[9]  Alon Orlitsky,et al.  Worst-case interactive communication - II: Two messages are not optimal , 1991, IEEE Trans. Inf. Theory.

[10]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[11]  Lane A. Hemaspaandra,et al.  Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1994, SIAM J. Comput..

[12]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[13]  Richard J. Lipton,et al.  A New Approach To Information Theory , 1994, STACS.

[14]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[15]  Alon Orlitsky,et al.  Average-case interactive communication , 1992, IEEE Trans. Inf. Theory.

[16]  Moni Naor,et al.  Three results on interactive communication , 1993, IEEE Trans. Inf. Theory.

[17]  Yishay Mansour,et al.  Weakly learning DNF and characterizing statistical query learning using Fourier analysis , 1994, STOC '94.

[18]  Rafail Ostrovsky,et al.  Computational complexity and knowledge complexity (extended abstract) , 1994, STOC '94.

[19]  Ronitt Rubinfeld,et al.  On the learnability of discrete distributions , 1994, STOC '94.

[20]  Aravind Srinivasan,et al.  Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, STOC '93.

[21]  Joachim von zur Gathen,et al.  Constructing Normal Bases in Finite Fields , 1990, J. Symb. Comput..

[22]  Maurice Herlihy,et al.  A simple constructive computability theorem for wait-free computation , 1994, STOC '94.

[23]  Michael Kearns,et al.  Efficient noise-tolerant learning from statistical queries , 1993, STOC.

[24]  Alon Orlitsky,et al.  Average and randomized communication complexity , 1990, IEEE Trans. Inf. Theory.

[25]  Alon Orlitsky,et al.  Interactive communication: balanced distributions, correlated files, and average-case complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Alon Orlitsky,et al.  Worst-case interactive communication I: Two messages are almost optimal , 1990, IEEE Trans. Inf. Theory.

[27]  H. Lenstra.  Finding isomorphisms between finite fields , 1991 .

[28]  Nancy A. Lynch,et al.  A tight lower bound for k-set agreement , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[29]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[30]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[31]  Rafail Ostrovsky,et al.  Computational Complexity and Knowledge Complexity , 1994, Electron. Colloquium Comput. Complex..

[32]  Maurice Herlihy,et al.  The asynchronous computability theorem for t-resilient tasks , 1993, STOC.