The problem of three-party secure computation, where a function of private data of two parties is to be computed by a third party without revealing information beyond respective inputs or outputs is considered. New and better lower bounds on the amount of communication required between the parties to guarantee zero probability of error in the computation and achieve information-theoretic security are derived. Protocols are presented and proved to be optimal in some cases by showing that they achieve the improved lower bounds.
['Sundara Rajan S', 'Shijin Rajakrishnan', 'Andrew Thangaraj', 'Vinod M. Prabhakaran']
Lower bounds and optimal protocols for three-party secure computation