Communication and Randomness Lower Bounds for Secure Computation

  title={Communication and Randomness Lower Bounds for Secure Computation},
  author={Deepesh Data and Vinod M. Prabhakaran and Manoj Prabhakaran},
  journal={IEEE Transactions on Information Theory},
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 the other users. While it is known that information theoretically secure MPC is possible among n users having access to private randomness and are pairwise connected by secure, noiseless, and bidirectional links against the collusion of less than n/2 users (in the honest-but-curious model; the threshold is n/3… 

Figures from this paper

On coding for secure computing

This work provides generic lower bounds on the amount of communication required among users and the total amount of private randomness needed to compute any function in this three-user model in a three user setting.

Secure computation of randomized functions

  • Deepesh Data
  • Computer Science, Mathematics
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; and computation is such that no user learns any additional

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

This work revisits the question of minimizing the randomness complexity of protocols for secure multiparty computation (MPC) in the setting of perfect information-theoretic security and proves an Ω( t 2 ) lower bound on the randoms complexity of XOR, matching the previous upper bound up to a logarithmic factor.

Interactive Secure Function Computation

It is shown that randomized functions which can be perfectly securely computed in this model and obtain tight bounds on the optimal message lengths in all the privacy settings are obtained.

Communication Complexity of Private Simultaneous Quantum Messages Protocols

It is demonstrated that the privacy condition inevitably increases the communication cost in the two-party PSQM model as well as in the classical case presented by Applebaum, Holenstein, Mishra, and Shayevitz, and it is proved that a lower bound (3 − o(1)n) is proved of the communication complexity inPSQM protocols with a shared random string for random Boolean functions of 2n-bit input.

On the Randomness Cost of Linear Secure Computation : (Invited Presentation)

It is shown that to compute M generic linear independent combinations of the messages securely, it suffices to use $\min\left(\left\lceil\frac{K-M-1}{2}\right\rceil,~M\right)$ randomness symbols per message symbol, and the optimality of the achieved randomness cost remains open.

Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets

A new technique of randomness sparsification for perfect privacy is provided and ρ ≥ 2 ( k − 1) n − 1 for a general function f : ( { 0, 1 } n ) k → { 0 , 1 } under universal reconstruction, in which P 0 is independent of f .

Expand-and-Randomize: An Algebraic Approach to Secure Computation

This paper considers the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs, and proposes a novel coding scheme built from two steps.


This work shows that and cannot be privately computed using a single random bit, thus giving the first non-trivial lower bound on the randomness complexity of the private computation of an explicit boolean function.

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

It is shown that and cannot be privately computed using a single random bit, thus giving the first non-trivial lower bound on the 1-private randomness complexity of an explicit boolean function, f:{0, 1}n→{0,1} .



How to securely compute the modulo-two sum of binary sources

It is shown here that, if the authors only want the probability of error to vanish asymptotically in blocklength, it can be achieved by a lower rate (binary entropy of p) for all the links and for private randomness; this also guarantees perfect privacy.

Two shannon-type problems on secure multi-party computations

  • E. LeeE. Abbe
  • Computer Science, Mathematics
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
This paper considers the traditional one-shot model for SMC, moves to a probabilistic model for the data, and proposes a Shannon model for discrete memorylessSMC, which focuses on summation functions and relies on polar code constructions.

Communication complexity of secure computation (extended abstract)

This paper begins the investigation of the communication complexity of unconditionally secure multi-party computation, and its relation with various fault-tolerance models, and presents upper and lower bounds on communication, as well as tradeoffs among resources.

Secure Multiparty Computation and Secret Sharing

This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing, focusing on asymptotic results with interesting applications related to MPC.

Secret-key agreement over unauthenticated public channels III: Privacy amplification

This work considers the special case where the legitimate partners already share a mutual string which might, however, be partially known to the adversary, and proposes two protocols, one based on universal hashing and onebased on extractors, allowing for privacy amplification secure against an adversary whose knowledge about the initial partially secret string is limited to one third of the length of this string.

On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

This work provides bounds on the efficiency of secure (one-sided) two-party computation of arbitrary finite functions from distributed randomness in the statistical case and presents two lower bounds for reductions of OT to commitments and a protocol based on string commitments that is optimal with respect to both of these bounds.

A Communication-Privacy Tradeoff for Modular Addition

Privacy and communication complexity

  • E. Kushilevitz
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
A complete combinatorial characterization of privately computable functions is given and this characterization is used to derive tight bounds on the rounds complexity of any privately Computable function and to design optimal private protocols that compute these functions.

Assisted Common Information With an Application to Secure Two-Party Sampling

The region of tension developed in this paper measures how well the dependence between a pair of random variables can be resolved by a piece of common information.

Scalable Secure Multiparty Computation

We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes,