A minimal model for secure computation (extended abstract)
Uri Feige, J. L. Killian, Moni Naor · 1994
We consider a minimal scenario for secure computation: Parties A and B have private inputs x and y and a shared random string r.A and B are each allowed to send a single message to a third party C, from which C is to learn the value of ~(z, y) for some function ~, but nothing else.We show that this model is surpris-Permission to copywithout fee all or part of this material is granted provided that the copies are not made or distributed for direct eommarcial advantaqe, tha ACM copyrioht notice a?d the title of the publicatiort 'and Its date appear, and notice is gwen that copying is by permission of the Association of Computing Machinery.