Document Open Access Logo

Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness

Author Reo Eriguchi

PDF
Thumbnail PDF

File

LIPIcs.ITC.2024.10.pdf
  • Filesize: 0.89 MB
  • 22 pages

Document Identifiers

Author Details

Reo Eriguchi
  • National Institute of Advanced Industrial Science and Technology, Tokyo, Japan

Funding

  • Eriguchi, Reo: This work was supported in part by JST CREST Grant Number MJCR22M1 and JST AIP Acceleration Research JPMJCR22U5.

Acknowledgements

We thank Keitaro Hiwatashi for his helpful discussions and suggestions.

Cite As Get BibTex

Reo Eriguchi. Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness. In 5th Conference on Information-Theoretic Cryptography (ITC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 304, pp. 10:1-10:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ITC.2024.10

Abstract

Bottleneck complexity is an efficiency measure of secure multiparty computation (MPC) protocols introduced to achieve load-balancing in large-scale networks, which is defined as the maximum communication complexity required by any one player within the protocol execution. Towards the goal of achieving low bottleneck complexity, prior works proposed MPC protocols for computing symmetric functions in the correlated randomness model, where players are given input-independent correlated randomness in advance. However, the previous protocols with polylogarithmic bottleneck complexity in the number n of players require a large amount of correlated randomness that is linear in n, which limits the per-party efficiency as receiving and storing correlated randomness are the bottleneck for efficiency. In this work, we present for the first time MPC protocols for symmetric functions such that bottleneck complexity and the amount of correlated randomness are both polylogarithmic in n, assuming semi-honest adversaries colluding with at most n-o(n) players. Furthermore, one of our protocols is even computationally efficient in that each player performs only polylog(n) arithmetic operations while the computational complexity of the previous protocols is O(n). Technically, our efficiency improvements come from novel protocols based on ramp secret sharing to realize basic functionalities with low bottleneck complexity, which we believe may be of interest beyond their applications to secure computation of symmetric functions.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
Keywords
  • Secure multiparty computation
  • Bottleneck complexity
  • Secret sharing

Metrics

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

Related Versions

References

  1. Donald Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology - CRYPTO '91, pages 420-432, 1992. Google Scholar
  2. Zuzana Beerliová-Trubíniová and Martin Hirt. Perfectly-secure mpc with linear communication complexity. In Theory of Cryptography, pages 213-230, 2008. Google Scholar
  3. Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, and Anat Paskin-Cherniavsky. Non-interactive secure multiparty computation. In Advances in Cryptology - CRYPTO 2014, Part II, pages 387-404, 2014. Google Scholar
  4. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 1-10, 1988. Google Scholar
  5. Eli Ben-Sasson, Serge Fehr, and Rafail Ostrovsky. Near-linear unconditionally-secure multiparty computation with a dishonest minority. In Advances in Cryptology - CRYPTO 2012, pages 663-680, 2012. Google Scholar
  6. Rikke Bendlin, Ivan Damgård, Claudio Orlandi, and Sarah Zakarias. Semi-homomorphic encryption and multiparty computation. In Advances in Cryptology - EUROCRYPT 2011, pages 169-188, 2011. Google Scholar
  7. G. R. Blakley and C. Meadows. Security of ramp schemes. In Advances in Cryptology - CRYPTO '84, pages 242-268, 1985. Google Scholar
  8. Elette Boyle, Niv Gilboa, and Yuval Ishai. Secure computation with preprocessing via function secret sharing. In Theory of Cryptography, pages 341-371, 2019. Google Scholar
  9. Elette Boyle, Niv Gilboa, Yuval Ishai, and Ariel Nof. Sublinear gmw-style compiler for mpc with preprocessing. In Advances in Cryptology - CRYPTO 2021, pages 457-485, 2021. Google Scholar
  10. Elette Boyle, Abhishek Jain, Manoj Prabhakaran, and Ching-Hua Yu. The Bottleneck Complexity of Secure Multiparty Computation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), volume 107 of Leibniz International Proceedings in Informatics (LIPIcs), pages 24:1-24:16, 2018. Google Scholar
  11. David Chaum, Claude Crépeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pages 11-19, 1988. Google Scholar
  12. Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, and Ariel Nof. Fast large-scale honest-majority MPC for malicious adversaries. In Advances in Cryptology - CRYPTO 2018, Part III, pages 34-64, 2018. Google Scholar
  13. Geoffroy Couteau. A note on the communication complexity of multiparty computation in the correlated randomness model. In Advances in Cryptology - EUROCRYPT 2019, pages 473-503, 2019. Google Scholar
  14. Ronald Cramer, Ivan Damgård, and Robbert de Haan. Atomic secure multi-party multiplication with low communication. In Advances in Cryptology - EUROCRYPT 2007, pages 329-346, 2007. Google Scholar
  15. Ronald Cramer, Ivan Damgård, and Ueli Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Advances in Cryptology - EUROCRYPT 2000, pages 316-334, 2000. Google Scholar
  16. Ivan Damgård, Yuval Ishai, and Mikkel Krøigaard. Perfectly secure multiparty computation and the computational overhead of cryptography. In Advances in Cryptology - EUROCRYPT 2010, pages 445-465, 2010. Google Scholar
  17. Ivan Damgård and Jesper Buus Nielsen. Scalable and unconditionally secure multiparty computation. In Advances in Cryptology - CRYPTO 2007, pages 572-590, 2007. Google Scholar
  18. Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci. The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. In Advances in Cryptology - CRYPTO 2017, pages 167-187, 2017. Google Scholar
  19. Ivan Damgård, Valerio Pastro, Nigel Smart, and Sarah Zakarias. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology - CRYPTO 2012, pages 643-662, 2012. Google Scholar
  20. Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, and Mahdi Zamani. Secure multi-party computation in large networks. Distributed Computing, 30:193-229, 2017. Google Scholar
  21. Reo Eriguchi. Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity. In Advances in Cryptology - ASIACRYPT 2023, pages 335-368, 2023. Google Scholar
  22. Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. TurboPack: Honest majority mpc with constant online communication. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS '22, pages 951-964, 2022. Google Scholar
  23. Matthew Franklin and Moti Yung. Communication complexity of secure computation (extended abstract). In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC '92, pages 699-710, 1992. Google Scholar
  24. Yuval Gelles and Ilan Komargodski. Optimal load-balanced scalable distributed agreement. Cryptology ePrint Archive, Paper 2023/1139, 2023. URL: https://eprint.iacr.org/2023/1139.
  25. Craig Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC '09, pages 169-0178, 2009. Google Scholar
  26. Craig Gentry, Amit Sahai, and Brent Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology - CRYPTO 2013, pages 75-92, 2013. Google Scholar
  27. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC '87, pages 218-229, 1987. Google Scholar
  28. Oded Goldreich. Foundations of cryptography: volume 2, basic applications. Cambridge University Press, 2009. Google Scholar
  29. Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, and Yifan Song. ATLAS: Efficient and scalable MPC in the honest majority setting. In Advances in Cryptology - CRYPTO 2021, Part II, pages 244-274, 2021. Google Scholar
  30. Vipul Goyal, Yanyi Liu, and Yifan Song. Communication-efficient unconditional MPC with guaranteed output delivery. In Advances in Cryptology - CRYPTO 2019, Part II, pages 85-114, 2019. Google Scholar
  31. Vipul Goyal, Yifan Song, and Chenzhi Zhu. Guaranteed output delivery comes free in honest majority MPC. In Advances in Cryptology - CRYPTO 2020, Part II, pages 618-646, 2020. Google Scholar
  32. Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, and Tal Rabin. Secure multiparty computation with general interaction patterns. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS '16, pages 157-168, 2016. Google Scholar
  33. Shai Halevi, Yehuda Lindell, and Benny Pinkas. Secure computation on the web: Computing without simultaneous interaction. In Advances in Cryptology - CRYPTO 2011, pages 132-150, 2011. Google Scholar
  34. Martin Hirt and Ueli Maurer. Robustness for free in unconditional multi-party computation. In Advances in Cryptology - CRYPTO 2001, pages 101-118, 2001. Google Scholar
  35. Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient secure multi-party computation. In Advances in Cryptology - ASIACRYPT 2000, pages 143-161, 2000. Google Scholar
  36. Martin Hirt and Daniel Tschudi. Efficient general-adversary multi-party computation. In Advances in Cryptology - ASIACRYPT 2013, Part II, pages 181-200, 2013. Google Scholar
  37. Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, and Anat Paskin-Cherniavsky. On the power of correlated randomness in secure computation. In Theory of Cryptography, pages 600-620, 2013. Google Scholar
  38. Stasys Jukna. Boolean Function Complexity. Springer, Berlin, Heidelberg, 1 edition, 2012. Google Scholar
  39. Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, and Divya Ravi. MPC with low bottleneck-complexity: Information-theoretic security and more. In 4th Information-Theoretic Cryptography (ITC) Conference, 2023. URL: https://eprint.iacr.org/2023/683.
  40. Marcel Keller. MP-SPDZ: A versatile framework for multi-party computation. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS '20, pages 1575-1590, 2020. Google Scholar
  41. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In SODA, volume 6, pages 990-999, 2006. Google Scholar
  42. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 24(9):583-584, 1981. Google Scholar
  43. Claudio Orlandi, Divya Ravi, and Peter Scholl. On the bottleneck complexity of mpc with correlated randomness. In Public-Key Cryptography - PKC 2022, Part I, pages 194-220, 2022. Google Scholar
  44. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC '89, pages 73-85, 1989. Google Scholar
  45. Victor Shoup. A computational introduction to number theory and algebra. Cambridge university press, 2009. Google Scholar
  46. Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT 2010, pages 24-43, 2010. Google Scholar
  47. H. Yamamoto. Secret sharing system using (k,L,n) threshold scheme. Electronics and Communications in Japan (Part I: Communications), 69(9):46-54, 1986. Google Scholar
  48. Andrew C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS '82, pages 160-164, 1982. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact