Experimental browser for the Atmosphere
Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted Dealer (Elette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai, Ariel Nof) ia.cr/2025/787
May 4, 2025, 3:17 PM
{ "uri": "at://did:plc:fwa55bujvdrwlwlwgqmmxmuf/app.bsky.feed.post/3loe5ltarfd23", "cid": "bafyreia7bosgpcerrv4k43jiairoreospnytnfs4tttxv4lif2lryvcgsi", "value": { "text": "Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted Dealer (Elette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai, Ariel Nof) ia.cr/2025/787", "$type": "app.bsky.feed.post", "embed": { "$type": "app.bsky.embed.images", "images": [ { "alt": "Abstract. We put forth a new paradigm for practical secure multiparty computation (MPC) in the preprocessing model, where a feasible one-time setup can enable a lifetime of efficient online secure computations. Our protocols match the security guarantees and low costs of the cheapest category of MPC solutions, namely 3-party protocols (3PC) secure against a single malicious party, with the qualitative advantages that one party communicates data sublinear in the circuit size, and can go offline after its initial messages. This “2+1”-party structure can alternatively be instantiated between 2 parties with the aid of a (possibly untrusted) dealer. Within such existing protocols, we provide comparable online performance while improving the storage and offline dealer-to-party communication requirements by more than 3 orders of magnitude.\n\nAt the technical level, we build on a novel combination of the Fully Linear Interactive Oracle Proof (FLIOP)-based protocol design of Boyle et al. (CRYPTO 2021) and pseudorandom correlation generators. We provide an extensive assortment of algorithmic and implementation-level optimizations, design efficient distributed proofs of well-formedness of complex FLIOP correlations, and make them circuit-independent. We implement and benchmark our end-to-end system against the state of the art in the (2+1) regime, a dealer-aided variant of SPDZ for Boolean circuits.\n\nWe additionally extend our techniques to the (n+1) party setting, where a dealer aids general dishonest-majority MPC, and provide a variant of the protocol which further achieves security with identifiable abort.\n", "image": { "$type": "blob", "ref": { "$link": "bafkreifqbspwl35ujofrygwon3wszmrksomyugbmmirwddnnswfp4q2qiy" }, "mimeType": "image/png", "size": 100491 }, "aspectRatio": { "width": 1200, "height": 800 } }, { "alt": "Image showing part 2 of abstract.", "image": { "$type": "blob", "ref": { "$link": "bafkreih4lf5yrnfgfk6rile34nxwokydu63rptwf5yksmq7antukrpdtke" }, "mimeType": "image/png", "size": 55278 }, "aspectRatio": { "width": 1200, "height": 800 } } ] }, "facets": [ { "index": { "byteEnd": 162, "byteStart": 148 }, "features": [ { "uri": "https://ia.cr/2025/787", "$type": "app.bsky.richtext.facet#link" } ] } ], "createdAt": "2025-05-04T15:17:53.548222Z" } }