Interactive Coding for Multiparty Protocols

The problem of constructing error-resilient interactive protocols was introduced in the seminal works of Schulman (FOCS 1992, STOC 1993). These works show how to convert any two-party interactive protocol into one that is resilient to constant-fraction of adversarial error, while blowing up the communication by only a constant factor. In this work we extend the work of Schulman to the multi-party setting. We show how to convert any (non-adaptive) $n$-party protocol into one that is resilient to Θ(1/n)-fraction of adversarial error, while blowing up the communication by only a constant factor. One might hope to get resilience to constant-fraction of errors, by restricting the adversary's error distribution, and allowing him to make at most a constant-fraction of errors per party. We present a black-box lower bound, showing that we cannot be resilient to such adversarial errors, even if we increase the communication by an arbitrary polynomial factor, assuming the error-resilient protocol has a fixed (non-adaptive) speaking order.

[1]  Bernhard Haeupler,et al.  Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[2]  Mark Braverman,et al.  Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.

[3]  Leonard J. Schulman,et al.  Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  Madhu Sudan,et al.  Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.

[5]  Yael Tauman Kalai,et al.  Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[6]  Amit Sahai,et al.  Adaptive protocols for interactive communication , 2013, 2016 IEEE International Symposium on Information Theory (ISIT).

[7]  Kai-Min Chung,et al.  Knowledge-Preserving Interactive Coding , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[8]  Leonard J. Schulman Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[9]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[10]  Amit Sahai,et al.  Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Leonard J. Schulman,et al.  A coding theorem for distributed computation , 1994, STOC '94.

[12]  Mark Braverman,et al.  Towards deterministic tree code constructions , 2012, ITCS '12.

[13]  Cristopher Moore,et al.  Tree codes and a conjecture on exponential sums , 2013, ITCS.

[14]  Bernhard Haeupler,et al.  Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[15]  Ran Raz,et al.  Interactive channel capacity , 2013, STOC '13.

[16]  Moni Naor,et al.  Fast Algorithms for Interactive Coding , 2013, SODA.

[17]  Leonard J. Schulman,et al.  Deterministic coding for interactive communication , 1993, STOC.

[18]  Mark Braverman,et al.  List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise , 2014, FOCS.