Abstract
We introduce a new information-theoretic measure, which we call Public Information Complexity (PIC), as a tool for the study of multi-party computation protocols, and of quantities such as their communication complexity, or the amount of randomness they require in the context of information-theoretic private computations. We are able to use this measure directly in the natural asynchronous message-passing peer-to-peer model and show a number of interesting properties and applications of our new notion: The Public Information Complexity is a lower bound on the Communication Complexity and an upper bound on the Information Complexity; the difference between the Public Information Complexity and the Information Complexity provides a lower bound on the amount of randomness used in a protocol; any communication protocol can be compressed to its Public Information Cost; and an explicit calculation of the zero-error Public Information Complexity of the k-party, n-bit Parity function, where a player outputs the bitwise parity of the inputs. The latter result also establishes that the amount of randomness needed by a private protocol that computes this function is Ω (n).
- Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, and Alon Orlitsky. 1993. Privacy, additional information and communication. IEEE Trans. Inf. Theory 39, 6 (1993), 1930--1943. Google Scholar
Digital Library
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2004. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68, 4 (2004), 702--732. Google Scholar
Digital Library
- Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. 2013. How to compress interactive communication. SIAM J. Comput. 42, 3 (2013), 1327--1363.Google Scholar
Cross Ref
- Balthazar Bauer, Shay Moran, and Amir Yehudayoff. 2015. Internal compression of protocols to entropy. In Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM’15), Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim (Eds.), Vol. 40. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 481--496.Google Scholar
- Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). ACM, New York, NY, 1--10. Google Scholar
Digital Library
- Mark Braverman. 2015. Interactive information complexity. SIAM J. Comput. 44, 6 (2015), 1698--1739.Google Scholar
Cross Ref
- Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, and Vinod Vaikuntanathan. 2013. A tight bound for set disjointness in the message-passing model. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). IEEE Computer Society, 668--677. Google Scholar
Digital Library
- Mark Braverman and Ankit Garg. 2014. Public vs private coin in bounded-round information. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Lecture Notes in Computer Science, Vol. 8572. Springer, 502--513.Google Scholar
Cross Ref
- Mark Braverman, Ankit Garg, Denis Pankratov, and Omri Weinstein. 2013. From information to exact communication. In Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing (STOC’13). ACM, New York, NY, 151--160. Google Scholar
Digital Library
- Mark Braverman and Rotem Oshman. 2015. On information complexity in the broadcast model. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC’15), Chryssis Georgiou and Paul G. Spirakis (Eds.). ACM, 355--364. Google Scholar
Digital Library
- Mark Braverman and Anup Rao. 2014. Information equals amortized communication. IEEE Trans. Inf. Theory 60, 10 (2014), 6058--6069.Google Scholar
Cross Ref
- Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, and Nikolai K. Vereshchagin. 2016. Towards a reverse newman’s theorem in interactive information complexity. Algorithmica 76, 3 (2016), 749--781. Google Scholar
Digital Library
- Amit Chakrabarti, Subhash Khot, and Xiaodong Sun. 2003. Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In Proceedings of the IEEE Conference on Computational Complexity. 107--117.Google Scholar
Cross Ref
- Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao. 2001. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’01). 270--278. Google Scholar
Digital Library
- Arkadev Chattopadhyay and Sagnik Mukhopadhyay. 2015. Tribes is hard in the message passing model. In Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science (STACS’15), Ernst W. Mayr and Nicolas Ollinger (Eds.), LIPIcs, Vol. 30. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 224--237.Google Scholar
- Arkadev Chattopadhyay, Jaikumar Radhakrishnan, and Atri Rudra. 2014. Topology matters in communication. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS’14). 631--640. Google Scholar
Digital Library
- Arkadev Chattopadhyay and Atri Rudra. 2015. The range of topological effects on communication. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15), Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.), Lecture Notes in Computer Science, Vol. 9135. Springer, 540--551. Google Scholar
Digital Library
- David Chaum, Claude Crépeau, and Ivan Damgard. 1988. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). ACM, New York, NY, 11--19. Google Scholar
Digital Library
- Danny Dolev and Tomás Feder. 1989. Multiparty communication complexity. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 428--433. Google Scholar
Digital Library
- Tomás Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan. 1995. Amortized communication complexity. SIAM J. Comput. 24, 4 (1995), 736--750. Google Scholar
Digital Library
- Uri Feige, Joe Killian, and Moni Naor. 1994. A minimal model for secure computation (extended abstract). In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC’94). ACM, New York, NY, 554--563. Google Scholar
Digital Library
- Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal. 1994. Computing with noisy information. SIAM J. Comput. 23, 5 (Oct. 1994), 1001--1018. Google Scholar
Digital Library
- Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, and Jérémie Roland. 2016. Relative discrepancy does not separate information and communication complexity. ACM Trans. Comput. Theory 9, 1 (2016), 4:1--4:15. Google Scholar
Digital Library
- Silvio Frischknecht, Stephan Holzer, and Roger Wattenhofer. 2012. Networks cannot compute their diameter in sublinear time. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’12), Yuval Rabani (Ed.). SIAM, 1150--1162. Google Scholar
Digital Library
- Anna Gál and Parikshit Gopalan. 2010. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. SIAM J. Comput. 39, 8 (2010), 3463--3479. Google Scholar
Digital Library
- Anat Ganor, Gillat Kol, and Ran Raz. 2014. Exponential separation of information and communication. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS’14). 176--185. Google Scholar
Digital Library
- Anat Ganor, Gillat Kol, and Ran Raz. 2015. Exponential separation of communication and external information. Electr. Colloq. Comput. Complex. 22 (2015), 88.Google Scholar
- Anat Ganor, Gillat Kol, and Ran Raz. 2015. Exponential separation of information and communication for boolean functions. In Proceedings of the 47th Annual ACM on Symposium on Theory of Computing (STOC’15), Rocco A. Servedio and Ronitt Rubinfeld (Eds.). ACM, 557--566. Google Scholar
Digital Library
- Andre Gronemeier. 2009. Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS’09), Susanne Albers and Jean-Yves Marion (Eds.), LIPIcs, Vol. 3. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany, 505--516.Google Scholar
- Prahladh Harsha, Rahul Jain, David A. McAllester, and Jaikumar Radhakrishnan. 2010. The communication complexity of correlation. IEEE Trans. Inf. Theory 56, 1 (2010), 438--449. Google Scholar
Digital Library
- Rahul Jain. 2015. New strong direct product results in communication complexity. J. ACM 62, 3 (2015), 20. Google Scholar
Digital Library
- Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. 2003. A direct sum theorem in communication complexity via message compression. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP’03), Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger (Eds.), Lecture Notes in Computer Science, Vol. 2719. Springer, 300--315. Google Scholar
Digital Library
- T. S. Jayram. 2009. Hellinger strikes back: A note on the multi-party information complexity of AND. In Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX’09/RANDOM’09). Springer-Verlag, Berlin, 562--573. Google Scholar
Digital Library
- Iordanis Kerenidis, Adi Rosén, and Florent Urrutia. 2016. Multi-party protocols, information complexity and privacy. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS’16), Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier (Eds.), LIPIcs, Vol. 58. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 57:1--57:16.Google Scholar
- Hartmut Klauck. 2010. A strong direct product theorem for disjointness. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC’10), Leonard J. Schulman (Ed.). ACM, 77--86. Google Scholar
Digital Library
- Gillat Kol. 2016. Interactive compression for product distributions. In Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing (STOC’16). ACM, New York, NY, 987--998. Google Scholar
Digital Library
- Gillat Kol, Rotem Oshman, and Dafna Sadeh. 2017. Interactive compression for multi-party protocol. In Proceedings of the 31st International Symposium on Distributed Computing (DISC’17), Andréa W. Richa (Ed.), Leibniz International Proceedings in Informatics, Vol. 91. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 31:1--31:15.Google Scholar
- Alexander Kozachinskiy. 2015. Computer Science—Theory and Applications: Proceedings of the 10th International Computer Science Symposium in Russia (CSR’15). Springer International Publishing, Cham, 296--309.Google Scholar
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press. Google Scholar
Digital Library
- Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. 1998. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57, 1 (1998), 37--49. Google Scholar
Digital Library
- Denis Pankratov. 2015. Communication Complexity and Information Complexity. Ph.D. Dissertation. The University of Chicago.Google Scholar
- Jeff M. Phillips, Elad Verbin, and Qin Zhang. 2016. Lower bounds for number-in-hand multiparty communication complexity, made easy. SIAM J. Comput. 45, 1 (2016), 174--196.Google Scholar
Cross Ref
- Anup Rao and Makrand Sinha. 2015. Simplified separation of information and communication. Electr. Colloq. Comput. Complex. 22 (2015), 57.Google Scholar
- Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2010. Distributed verification and hardness of distributed approximation. CoRR abs/1011.3049 (2010). http://arxiv.org/abs/1011.3049 Google Scholar
Digital Library
- Ronen Shaltiel. 2003. Towards proving strong direct product theorems. Comput. Complex. 12, 1--2 (2003), 1--22. Google Scholar
Digital Library
- C. E. Shannon. 1948. A mathematical theory of communication. Bell Syst. Techn. J. 27, 3 (1948), 379--423.Google Scholar
Cross Ref
- Alexander A. Sherstov. 2018. Compressing interactive communication under product distributions. SIAM J. Comput. 47, 2 (2018), 367--419.Google Scholar
Cross Ref
- David P. Woodruff and Qin Zhang. 2014. An optimal lower bound for distinct elements in the message passing model. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14), Chandra Chekuri (Ed.). SIAM, 718--733. Google Scholar
Digital Library
- Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC’79). ACM, New York, NY, 209--213. Google Scholar
Digital Library
Index Terms
Multi-Party Protocols, Information Complexity and Privacy
Recommendations
Public vs. private randomness in simultaneous multi-party communication complexity
AbstractIn simultaneous number-in-hand multi-party communication protocols, we have k players, who each receive a private input, and wish to compute a joint function of their inputs. The players simultaneously each send a single message to a ...
Lower bounds on the amount of randomness in private computation
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingWe consider the amount of randomness necessary in information-theoretic private protocols. We prove that at least Ω(log n) random bits are necessary for the t-private computation of the function xor by n players, for any t ≥ 2. In view of the upper ...
Collusive attacks to "circle-type" multi-party quantum key agreement protocols
We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate ...






Comments