Information-Theoretic Security Without an Honest Majority

Carles Padró

Xiaoqi Duan, Vipul Goyal, Hanjun Li +3 more

We propose ACCO: the first maliciously secure multiparty computation engine in the honest majority setting, which also supports secure and efficient comparison and integer truncation. Our system is also the first to achieve information theoretic security.

Sergey Mihailovich Ratseev, Ольга Ивановна Череватенко

In 2016, the authors Araki T., Furukawa J., Lindell Y., Of A. and Ohara K. introduced a new information-theoretic protocol (and a computationally-secure variant) for secure three- party computation with an honest majority. The protocol has very minimal computation and communication. The authors did not provide a complete protocols. This paper provides complete protocols for secure multiparty computation.

Hutchison, David, Gerhard Weikum, Moshe Y. Vardi +13 more

Hari Krishnan P. Anilkumar, Keval Jain, Manoj Prabhakaran +1 more

This work deals with the fundamental problem of characterizing which multiparty distributions can be securely sampled with information-theoretic security against passive corruption, when there is no setup or honest-majority. We focus on the case of 4-party distributions with boolean outputs for each party. We show that such a distribution is securely samplable if and only if every 2-party distribution derived from it by partitioning the parties into two sets is securely samplable. This extends a similar characterization previously known for 3-party distributions.