Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
From MaRDI portal
Publication:3457072
DOI10.1007/978-3-662-48000-7_16zbMath1352.94049OpenAlexW3031847131MaRDI QIDQ3457072
Yehuda Lindell, Avishay Yanai, Benny Pinkas, Nigel P. Smart
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2015/523
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items (28)
Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ How to simulate it in Isabelle: towards formal proof for secure multi-party computation ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ On multiparty garbling of arithmetic circuits ⋮ Secure computation with low communication from cross-checking ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Scalable Multi-party Private Set-Intersection ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ Round-optimal secure multi-party computation ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Topology-hiding computation for networks with unknown delays ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Network Oblivious Transfer ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ The price of active security in cryptographic protocols ⋮ Broadcast-optimal two-round MPC
Uses Software
This page was built for publication: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
