Secure multiparty computation with minimal interaction

DOI10.1007/978-3-642-14623-7_31MaRDI QIDQ3582778zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Eyal Kushilevitz, Anat Paskin

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

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

Recommendations

• Secure computation with minimal interaction, revisited
• Round-optimal secure multiparty computation with honest majority
• scientific article; zbMATH DE number 1942420
• Round-optimal secure multi-party computation
• Perfect secure computation in two rounds

Cited in

(45)

• Secure computation with parallel calls to 2-ary functions
• Round-optimal black-box secure computation from two-round malicious OT
• TinyKeys: a new approach to efficient multi-party computation
• Broadcast-optimal two-round MPC
• The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
• On the correlation complexity of MPC with cheater identification
• Broadcast-optimal two round MPC with an honest majority
• On actively-secure elementary MPC reductions
• On the exact round complexity of secure three-party computation
• Three party secure computation with friends and foes
• Interaction-preserving compilers for secure computation
• scientific article; zbMATH DE number 7559047 (Why is no real title available?)
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Secure two-party computation with low communication
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• Perfect secure computation in two rounds
• Secure multi-party computation minimizing online rounds
• Round-optimal secure multiparty computation with honest majority
• Secure computation with minimal interaction, revisited
• On the round complexity of black-box secure MPC
• Round-optimal black-box protocol compilers
• Placing conditional disclosure of secrets in the communication complexity universe
• Round-optimal black-box MPC in the plain model
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• Threshold-optimal MPC with friends and foes
• Round-optimal and communication-efficient multiparty computation
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Ad hoc PSM protocols: secure computation without coordination
• A little honesty goes a long way. The two-tier model for secure multiparty computation
• A Single Initialization Server for Multi-party Cryptography
• Fully-secure MPC with minimal trust
• Black-box constant-round secure 2PC with succinct communication
• Round-optimal black-box multiparty computation from polynomial-time assumptions
• Efficient multiparty private simultaneous messages for symmetric functions
• 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
• Minimizing setup in broadcast-optimal two round MPC
• Secure computation with low communication from cross-checking
• MPC with friends and foes
• Secure multiparty computation with general interaction patterns
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• Unconditionally secure computation with reduced interaction

This page was built for publication: Secure multiparty computation with minimal interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582778)