skip to main content
research-article

Multi-Party Protocols, Information Complexity and Privacy

Published:17 March 2019Publication History
Skip Abstract Section

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).

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. 2013. How to compress interactive communication. SIAM J. Comput. 42, 3 (2013), 1327--1363.Google ScholarGoogle ScholarCross RefCross Ref
  4. 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 ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. Mark Braverman. 2015. Interactive information complexity. SIAM J. Comput. 44, 6 (2015), 1698--1739.Google ScholarGoogle ScholarCross RefCross Ref
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarCross RefCross Ref
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. Mark Braverman and Anup Rao. 2014. Information equals amortized communication. IEEE Trans. Inf. Theory 60, 10 (2014), 6058--6069.Google ScholarGoogle ScholarCross RefCross Ref
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarCross RefCross Ref
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle Scholar
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. Tomás Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan. 1995. Amortized communication complexity. SIAM J. Comput. 24, 4 (1995), 736--750. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  22. Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal. 1994. Computing with noisy information. SIAM J. Comput. 23, 5 (Oct. 1994), 1001--1018. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  25. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. Anat Ganor, Gillat Kol, and Ran Raz. 2015. Exponential separation of communication and external information. Electr. Colloq. Comput. Complex. 22 (2015), 88.Google ScholarGoogle Scholar
  28. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  29. 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 ScholarGoogle Scholar
  30. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  31. Rahul Jain. 2015. New strong direct product results in communication complexity. J. ACM 62, 3 (2015), 20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  33. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  34. 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 ScholarGoogle Scholar
  35. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  36. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  37. 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 ScholarGoogle Scholar
  38. 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 ScholarGoogle Scholar
  39. Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  41. Denis Pankratov. 2015. Communication Complexity and Information Complexity. Ph.D. Dissertation. The University of Chicago.Google ScholarGoogle Scholar
  42. 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 ScholarGoogle ScholarCross RefCross Ref
  43. Anup Rao and Makrand Sinha. 2015. Simplified separation of information and communication. Electr. Colloq. Comput. Complex. 22 (2015), 57.Google ScholarGoogle Scholar
  44. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  45. Ronen Shaltiel. 2003. Towards proving strong direct product theorems. Comput. Complex. 12, 1--2 (2003), 1--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. C. E. Shannon. 1948. A mathematical theory of communication. Bell Syst. Techn. J. 27, 3 (1948), 379--423.Google ScholarGoogle ScholarCross RefCross Ref
  47. Alexander A. Sherstov. 2018. Compressing interactive communication under product distributions. SIAM J. Comput. 47, 2 (2018), 367--419.Google ScholarGoogle ScholarCross RefCross Ref
  48. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  49. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Multi-Party Protocols, Information Complexity and Privacy

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!