9 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.CC2014★ 4 cited
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…
cs.CR2012
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…
cs.IT2010★ 9 cited
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…