Secure Multiparty Computation with Minimal Interaction

DOI10.1007/978-3-642-14623-7_31zbMath1283.94093OpenAlexW1556948092MaRDI QIDQ3582778

Anat Paskin, Yuval Ishai, Eyal Kushilevitz

Publication date: 24 August 2010

Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_31

zbMATH Keywords

round complexitysecure multiparty computation

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (21)

Broadcast-optimal two round MPC with an honest majority ⋮ On the round complexity of black-box secure MPC ⋮ Two-round MPC: information-theoretic and black-box ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal black-box protocol compilers ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Round-optimal black-box MPC in the plain model ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ On communication models and best-achievable security in two-round MPC ⋮ Perfect Secure Computation in Two Rounds ⋮ Unnamed Item ⋮ On the exact round complexity of secure three-party computation ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ MPC with friends and foes ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Secure Multiparty Computation with Minimal Interaction