Fast large-scale honest-majority MPC for malicious adversaries
From MaRDI portal
Publication:775948
DOI10.1007/978-3-319-96878-0_2zbMath1446.94118OpenAlexW2884909828MaRDI QIDQ775948
Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Koki Hamada, Koji Chida, Daniel Genkin, Ariel Nof
Publication date: 30 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_2
Related Items (31)
Compilation of function representations for secure computing paradigms ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Fluid MPC: secure multiparty computation with dynamic participants ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ The cost of IEEE arithmetic in secure computation ⋮ Honest majority MPC with abort with minimal online communication ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Secure multiparty computation with free branching ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Privacy preserving solution of DCOPs by mediation ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ The price of active security in cryptographic protocols
This page was built for publication: Fast large-scale honest-majority MPC for malicious adversaries
