Communication and Randomness Lower Bounds for Secure Computation

DOI10.1109/TIT.2016.2568207MaRDI QIDQ2976700zbMATH OpenOpenAlexFDO

Authors Deepesh Data, Vinod M. Prabhakaran, Manoj Prabhakaran

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Communication theory (94A05)

Abstract: In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to other users. While it is known that information theoretically secure MPC is possible among $n$ users (connected by secure and noiseless links and have access to private randomness) against the collusion of less than $n/2$ users in the honest-but-curious model, relatively less is known about the communication and randomness complexity of secure computation. In this work, we employ information theoretic techniques to obtain lower bounds on the amount of communication and randomness required for secure MPC. We restrict ourselves to a concrete interactive setting involving 3 users under which all functions are securely computable against corruption of a single user in the honest-but-curious model. We derive lower bounds for both the perfect security case (i.e., zero-error and no leakage of information) and asymptotic security (where the probability of error and information leakage vanish as block-length goes to $infty$). Our techniques include the use of a data processing inequality for residual information (i.e., the gap between mutual information and G'acs-K"orner common information), a new information inequality for 3-user protocols, and the idea of distribution switching. Our lower bounds are shown to be tight for various functions of interest. In particular, we show concrete functions which have "communication-ideal" protocols, i.e., which achieve the minimum communication simultaneously on all links in the network, and also use minimum amount of randomness. Also, we obtain the first explicit example of a function that incurs a higher communication cost than the input length in the secure computation model of "Feige, Kilian, and Naor [STOC, 1994]", who had shown that such functions exist.

Recommendations

• On the communication complexity of secure computation
• Bounds on tradeoffs between randomness and communication complexity
• Tight bounds on the randomness complexity of secure multiparty computation
• On communication protocols that compute almost privately
• On communication protocols that compute almost privately
• Lower and upper bounds on the randomness complexity of private computations of AND
• Lower and upper bounds on the randomness complexity of private computations of AND
• Communication complexity of secure distributed computation in the presence of noise
• Communication Complexity and Quasi Randomness
• Secure computation with low communication from cross-checking

Cited in

(18)

• Lower bounds on the probability of successful substitution of messages
• The price of low communication in secure multi-party computation
• Secure computation with low communication from cross-checking
• Lower and upper bounds on the randomness complexity of private computations of AND
• New Lower Bounds for Privacy in Communication Protocols
• Нижние оценки для практической секретности ключа
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Communication complexity of secure distributed computation in the presence of noise
• Communication complexity of key agreement on small ranges
• scientific article; zbMATH DE number 6829278 (Why is no real title available?)
• Some open problems in information-theoretic cryptography
• Lower and upper bounds on the randomness complexity of private computations of AND
• The communication complexity of private simultaneous messages, revisited
• On query-to-communication lifting for adversary bounds
• Random sources in private computation
• Tight bounds on the randomness complexity of secure multiparty computation
• Randomness in private sequential stateless protocols
• Lower bounds and new constructions on secure group communication schemes

This page was built for publication: Communication and Randomness Lower Bounds for Secure Computation

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