41 citations · 95 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CR2015★ 33 cited
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…
cs.CC2015★ 1 cited
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…