Input-Indistinguishable Computation

We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementable based on standard complexity assumptions. In contrast to previous definitions of secure computation, ours is not simulation-based.

• Type: Conference
• Year: 2006
• Where: FOCS
• Authors: Silvio Micali, Rafael Pass, Alon Rosen
• Keywords: FOCS 2006, General Secure Computation, Secure Computation, Standard Complexity Assumptions, Theoretical Computer Science