41 citations · 95 across the 10 of their papers we have counts for
11 papers
Randomness Requirements for Three-Secret Sharing
Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan +2
We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted.…
Flexible Accuracy for Differential Privacy
Aman Bansal, Rahul Chunduru, Deepesh Data +1
Differential Privacy (DP) has become a gold standard in privacy-preserving data analysis. While it provides one of the most rigorous notions of privacy, there are many settings whe…
Communication and Randomness Lower Bounds for Secure Computation
Deepesh Data, Vinod M. Prabhakaran, Manoj M. Prabhakaran
In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their…
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound
Manoj M. Prabhakaran, Vinod M. Prabhakaran
We introduce a new information-theoretic complexity measure for 2-party functions which is a lower-bound on communication complexity, and has the two leading lower-boun…
Tension Bounds for Information Complexity
Manoj M. Prabhakaran, Vinod M. Prabhakaran
The main contribution of this work is to relate information complexity to "tension" [Prabhakaran and Prabhakaran, 2014] - an information-theoretic quantity defined with no referenc…
On the Communication Complexity of Secure Computation
Deepesh Data, Vinod M. Prabhakaran, Manoj M. Prabhakaran
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity…
Assisted Common Information with an Application to Secure Two-Party Sampling
Vinod M. Prabhakaran, Manoj M. Prabhakaran
In this paper we generalize the notion of common information of two dependent variables introduced by Gács & Körner. They defined common information as the largest entropy rate of…
Limits of Random Oracles in Secure Computation
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme…
Assisted Common Information: Further Results
Vinod M. Prabhakaran, Manoj M. Prabhakaran
We presented assisted common information as a generalization of Gács-Körner (GK) common information at ISIT 2010. The motivation for our formulation was to improve upperbounds on t…
Assisted Common Information with Applications to Secure Two-Party Computation
Vinod Prabhakaran, Manoj Prabhakaran
Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sampl…
Secure Arithmetic Computation with No Honest Majority
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case of…