Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Extended Abstract)
Gil Cohen, Ivan Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum · International Cryptology Conference · 2013
We put forward a new approach for the design of efficient multiparty protocols: 1. Design a protocol π for a small number of parties (say, 3 or 4) which achieves security against a single corrupted party. Such protocols are typically easy to construct, as they may employ techniques that do not scale well with the number of corrupted parties. 2. Recursively compose π with itself to obtain an efficient n-party pro- tocol which achieves security against a constant fraction of corrupted parties.