167 citations · 262 across the 13 of their papers we have counts for
6 papers · 1 filter
Must the Communication Graph of MPC Protocols be an Expander?
Elette Boyle, Ran Cohen, Deepesh Data +1
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corrupt…
On the Renyi Differential Privacy of the Shuffle Model
Antonious M. Girgis, Deepesh Data, Suhas Diggavi +2
The central question studied in this paper is Renyi Differential Privacy (RDP) guarantees for general discrete local mechanisms in the shuffle privacy model. In the shuffle model,…
Successive Refinement of Privacy
Antonious M. Girgis, Deepesh Data, Kamalika Chaudhuri +2
This work examines a novel question: how much randomness is needed to achieve local differential privacy (LDP)? A motivating scenario is providing {\em multiple levels of privacy}…
Secure Computation of Randomized Functions
Deepesh Data
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 lea…
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…
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…