On the Communication Complexity of Secure Computation

DOI10.1007/978-3-662-44381-1_12zbMath1334.94072arXiv1311.7584OpenAlexW2962686861MaRDI QIDQ2874538

Deepesh Data, Manoj Prabhakaran, Vinod M. Prabhakaran

Publication date: 7 August 2014

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

Full work available at URL: https://arxiv.org/abs/1311.7584

Mathematics Subject Classification ID

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

Related Items (4)

On the (in)efficiency of non-interactive secure multiparty computation ⋮ Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: On the Communication Complexity of Secure Computation