High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
From MaRDI portal
Publication:5738976
DOI10.1007/978-3-319-56614-6_8zbMath1415.94431OpenAlexW2614104334MaRDI QIDQ5738976
Yehuda Lindell, Ariel Nof, Or Weinstein, Jun Furukawa
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_8
Related Items (23)
Secure fast evaluation of iterative methods: with an application to secure PageRank ⋮ Oblivious TLS via multi-party computation ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ Honest majority MPC with abort with minimal online communication ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ CNF-FSS and Its Applications ⋮ SecureBiNN: 3-party secure computation for binarized neural network inference ⋮ High-throughput secure three-party computation with an honest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Amortizing division and exponentiation ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Secure computation with low communication from cross-checking ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the exact round complexity of secure three-party computation ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings
Cites Work
- Unnamed Item
- Security and composition of multiparty cryptographic protocols
- Secure multi-party computation without agreement
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Two Halves Make a Whole
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Information-Theoretically Secure Protocols and Security under Composition
- Foundations of Cryptography
This page was built for publication: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
