On the message complexity of secure multiparty computation

DOI10.1007/978-3-319-76578-5_24MaRDI QIDQ1749308zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Manika Mittal, Rafail Ostrovsky

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_24

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The broadcast message complexity of secure multiparty computation
• The bottleneck complexity of secure multiparty computation
• On the communication complexity of secure computation
• On the complexity of verifiable secret sharing and multiparty computation
• Tight bounds on the randomness complexity of secure multiparty computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• scientific article; zbMATH DE number 1583776
• On the (in)efficiency of non-interactive secure multiparty computation
• On the (in)efficiency of non-interactive secure multiparty computation
• Advances in Cryptology - EUROCRYPT 2004

Cited in

(24)

• Multi-Party Protocols, Information Complexity and Privacy
• Minimal complete primitives for secure multi-party computation
• On the correlation complexity of MPC with cheater identification
• A minimal model for secure computation (extended abstract)
• Two-round MPC: information-theoretic and black-box
• The complexity of multiparty PSM protocols and related models
• Characterization of secure multiparty computation without broadcast
• Advances in Cryptology - EUROCRYPT 2004
• On the bottleneck complexity of MPC with correlated randomness
• Communication complexity of secure distributed computation in the presence of noise
• A note on secure multiparty computation via higher residue symbols
• On the communication complexity of secure computation
• The broadcast message complexity of secure multiparty computation
• Theory of Cryptography
• On the power of correlated randomness in secure computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• On the complexity of verifiable secret sharing and multiparty computation
• The price of low communication in secure multi-party computation
• scientific article; zbMATH DE number 1848306 (Why is no real title available?)
• Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
• Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
• Brief announcement: Breaking the O(nm) bit barrier, secure multiparty computation with a static adversary
• Secure multiparty computation with general interaction patterns
• Unconditionally secure computation with reduced interaction

This page was built for publication: On the message complexity of secure multiparty computation

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