Communication complexity of secure computation (extended abstract) (original) (raw)

Communication complexity of secure computation (extended abstract)

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92, 1992

Abstract

Page 1. Communication Complexity of Secure Computation (Extended Abstract)Matthew Franklin* Abstract A secret-ballot vote for a single proposition is an example of a secure distributed computation. The goal is for n participants ...

Moti Yung hasn't uploaded this paper.

Let Moti know you want this paper to be uploaded.

Ask for this paper to be uploaded.