Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC

Authors Navneet Agarwal, Sanat Anand, Manoj Prabhakaran

Thumbnail PDF


  • Filesize: 301 kB
  • 4 pages

Document Identifiers

Author Details

Navneet Agarwal
  • Indian Institute of Technology Bombay
Sanat Anand
  • Indian Institute of Technology Bombay
Manoj Prabhakaran
  • Indian Institute of Technology Bombay

Cite AsGet BibTex

Navneet Agarwal, Sanat Anand, and Manoj Prabhakaran. Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 103:1-103:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against passive corruption. This question has seen little progress since the work of Chor and Ishai (2001), which demonstrated difficulties in resolving it. In this work, we make significant progress towards resolving this question in the important case of aggregating functionalities, in which m parties P1,...,Pm hold inputs x1,...,xm and an aggregating party P0 must learn f(x1,...,xm). We give a necessary condition and a slightly stronger sufficient condition for f to admit a secure protocol. Both the conditions are stated in terms of an algebraic structure we introduce called Commuting Permutations Systems (CPS), which may be of independent combinatorial interest. When our sufficiency condition is met, we obtain a perfectly secure protocol with minimal interaction, that fits the model of Non-Interactive MPC or NIMPC (Beimel et al., 2014), but without the need for a trusted party to generate correlated randomness. We define Unassisted Non-Interactive MPC (UNIMPC) to capture this variant. We also present an NIMPC protocol for all functionalities, which is simpler and more efficient than the one given in the prior work.

Subject Classification

ACM Subject Classification
  • Theory of computation → Cryptographic protocols
  • Theory of computation → Complexity classes
  • Security and privacy → Mathematical foundations of cryptography
  • Secure Multi-Party Computation
  • Combinatorial Characterization
  • Latin Hypercube
  • Permutation Hypercube Complex


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, and Anat Paskin-Cherniavsky. Non-interactive secure multiparty computation. In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II, volume 8617 of Lecture Notes in Computer Science, pages 387-404. Springer, 2014. URL:
  2. Benny Chor and Yuval Ishai. On privacy and partition arguments. Information and Computation, 167(1):2-9, 2001. Google Scholar
  3. Deepesh Data, Manoj Prabhakaran, and Vinod Prabhakaran. On the communication complexity of secure computation. CoRR Report 1311.7584 available from, 2013.
  4. Uriel Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In STOC, pages 554-563. ACM, 1994. URL:
  5. Yuval Ishai and Eyal Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In FOCS, pages 294-304, 2000. Google Scholar
  6. Satoshi Obana and Maki Yoshida. An efficient construction of non-interactive secure multiparty computation. In Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, pages 604-614, 2016. Google Scholar
  7. Manoj Prabhakaran and Vinod Prabhakaran. On secure multiparty sampling for more than two parties. In Proceedings of the 2012 IEEE International Information Theory Workshop (ITW 2012), 2012. Google Scholar
  8. Manoj Prabhakaran and Mike Rosulek. Cryptographic complexity of multi-party computation problems: Classifications and separations. In David Wagner, editor, Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, volume 5157 of Lecture Notes in Computer Science, pages 262-279. Springer, 2008. URL:
  9. Sundara Rajan S, S. Rajakrishnan, A. Thangaraj, and V. Prabhakaran. Lower bounds and optimal protocols for three-party secure computation. In 2016 IEEE International Symposium on Information Theory (ISIT), pages 1361-1365, July 2016. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail