Dishonest Majority Multi-Party Computation for Binary Circuits

DOI10.1007/978-3-662-44381-1_28zbMath1335.94064OpenAlexW2149304702MaRDI QIDQ2874555

Emmanuela Orsini, Enrique Larraia, Nigel P. Smart

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_28

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

An efficient structural attack on NIST submission DAGS ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ More efficient oblivious transfer extensions ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ High-throughput secure three-party computation with an honest majority ⋮ Amortizing division and exponentiation ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Network Oblivious Transfer ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ