On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation

DOI10.1007/11818175_29zbMath1161.94444OpenAlexW1552719996MaRDI QIDQ5756647

Eyal Kushilevitz, Yuval Ishai, Yehuda Lindell, Erez Petrank

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_29

Mathematics Subject Classification ID

Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

On fully secure MPC with solitary output ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Player-Centric Byzantine Agreement ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Three party secure computation with friends and foes ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Threshold-optimal MPC with friends and foes ⋮ Network Oblivious Transfer

This page was built for publication: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation