Low cost constant round MPC combining BMR and oblivious transfer
From MaRDI portal
Publication:5920168
DOI10.1007/978-3-319-70694-8_21zbMath1420.94072OpenAlexW2604366484MaRDI QIDQ5920168
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Publication date: 6 April 2018
Published in: Advances in Cryptology – ASIACRYPT 2017 (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/2594665
Related Items (32)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Oblivious TLS via multi-party computation ⋮ An efficient structural attack on NIST submission DAGS ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ The cost of IEEE arithmetic in secure computation ⋮ Practical witness-key-agreement for blockchain-based dark pools financial trading ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ On actively-secure elementary MPC reductions ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ On multiparty garbling of arithmetic circuits ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ What security can we achieve within 4 rounds? ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ Round-optimal secure multi-party computation ⋮ Multiparty generation of an RSA modulus ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Blazing fast OT for three-round UC OT extension ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ Multiparty generation of an RSA modulus ⋮ The price of active security in cryptographic protocols ⋮ Broadcast-optimal two-round MPC
This page was built for publication: Low cost constant round MPC combining BMR and oblivious transfer
