Secure Multiparty Computation with General Interaction Patterns

abstract of this work published in ITCS 2016 We present a unified framework for studying secure multi-party computation (MPC) with arbitrarily restricted interaction patterns. Our study generalizes both standard MPC and recent models for MPC with specific restricted interaction patterns (such as a chain or a star), which were studied by Halevi et al. (Crypto 2011), Goldwasser et al. (Eurocrypt 2014), and Beimel et al. (Crypto 2014). Since restricted interaction patterns cannot always yield full security for MPC, we start by formalizing the notion of “best possible security” for any interaction pattern. We then obtain the following results: • Completeness theorem. We prove that the star interaction pattern is complete for the problem of MPC with general interaction patterns. • Positive results. We present both information-theoretic and computationally secure protocols for computing arbitrary functions with general interaction patterns. We also present more efficient protocols...

• Type: Journal
• Year: 2016
• Where: INNOVATIONS
• Authors: Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin
• Keywords: INNOVATIONS 2016