Dishonest majority multi-party computation for binary circuits

DOI10.1007/978-3-662-44381-1_28MaRDI QIDQ2874555zbMATH OpenOpenAlexFDO

Authors Enrique Larraia, Emmanuela Orsini, N. 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

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

Recommendations

• scientific article; zbMATH DE number 2009981
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Multiparty computation for dishonest majority: from passive to active security at low cost
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Bounded-concurrent secure multi-party computation with a dishonest majority

Cited in

(20)

• An efficient structural attack on NIST submission DAGS
• On compiling Boolean circuits optimized for secure multi-party computation
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• Proactive secure multiparty computation with a dishonest majority
• 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
• Efficient, actively secure MPC with a dishonest majority: a survey
• Efficient constant-round multi-party computation combining BMR and SPDZ
• More efficient oblivious transfer extensions
• Network oblivious transfer
• Actively secure 1-out-of-N OT extension with application to private set intersection
• More efficient constant-round multi-party computation from BMR and SHE
• 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
• A new approach to efficient and secure fixed-point computation
• Towards building scalable constant-round MPC from minimal assumptions via round collapsing
• Dishonest majority constant-round MPC with linear communication from DDH

This page was built for publication: Dishonest majority multi-party computation for binary circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874555)