On Achieving the “Best of Both Worlds” in Secure Multiparty Computation

DOI10.1137/100783224zbMath1215.68035OpenAlexW2093767941MaRDI QIDQ2999858

Erez Petrank, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Jonathan N. Katz

Publication date: 17 May 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i1/p122_s1

zbMATH Keywords

cryptographysecure computationsecurity protocolsfull security

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (7)

On fully secure MPC with solitary output ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ From fairness to full security in multiparty computation ⋮ MPC with friends and foes

This page was built for publication: On Achieving the “Best of Both Worlds” in Secure Multiparty Computation