Communication and Randomness Lower Bounds for Secure Computation

24 December 2015

Papers citing "Communication and Randomness Lower Bounds for Secure Computation"

3 / 3 papers shown

Title
How to Securely Compute the Modulo-Two Sum of Binary Sources Deepesh Data B. Dey M. Mishra V. Prabhakaran 35 7 0 11 May 2014
A Shannon Approach to Secure Multi-party Computations E. Lee Emmanuel Abbe 33 11 0 28 Jan 2014
Assisted Common Information with an Application to Secure Two-Party Sampling V. Prabhakaran M. Prabhakaran 54 49 0 06 Jun 2012