Round-optimal secure multi-party computation

DOI10.1007/978-3-319-96881-0_17zbMath1436.94070OpenAlexW2794886607MaRDI QIDQ5916238

Shai Halevi, Muthuramakrishnan Venkitasubramaniam, Antigoni Polychroniadou, Carmit Hazay

Publication date: 26 September 2018

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-96881-0_17

zbMATH Keywords

round complexitysecure multiparty computationgarbled circuitsadditive errors

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

On the round complexity of black-box secure MPC ⋮ Two-message statistically sender-private OT from LWE ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ From FE combiners to secure MPC and back ⋮ Statistical security in two-party computation revisited ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Reusable secure computation in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ What security can we achieve within 4 rounds? ⋮ On the exact round complexity of secure three-party computation ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Towards accountability in CRS generation

This page was built for publication: Round-optimal secure multi-party computation