Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation

DOI10.1007/978-3-030-35423-7_11zbMath1456.94107OpenAlexW2996598375MaRDI QIDQ2179390

Sibi Raj B. Pillai, Vinod M. Prabhakaran, Manoj Prabhakaran, Srivatsan Sridhar

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_11

zbMATH Keywords

lower boundsecure multiparty computationrandomness complexityprivate simultaneous messages

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12) Communication theory (94A05)

Cites Work

• Unnamed Item
• A communication-privacy tradeoff for modular addition
• A minimal model for secure computation (extended abstract)
• On the Communication Required for Unconditionally Secure Multiplication
• On the Communication Complexity of Secure Computation
• Foundations of Cryptography
• Secure Multiparty Computation and Secret Sharing
• A Zero-One Law for Boolean Privacy
• The communication complexity of private simultaneous messages, revisited

This page was built for publication: Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation