A Unified Approach to MPC with Preprocessing Using OT

DOI10.1007/978-3-662-48797-6_29zbMath1396.94077OpenAlexW2295145729MaRDI QIDQ2811152

Marcel Keller, Peter Scholl, Emmanuela Orsini, Tore Kasper Frederiksen

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: http://eprint.iacr.org/2015/901

zbMATH Keywords

MPCpreprocessingSPDZOT extensionMiniMACTinyOT

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

An efficient structural attack on NIST submission DAGS ⋮ Secure multiparty computation with free branching ⋮ More efficient oblivious transfer extensions ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Actively secure setup for SPDZ ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits

This page was built for publication: A Unified Approach to MPC with Preprocessing Using OT