Input-indistinguishable computation

Silvio Micali*, Rafael Pass, Alon Rosen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Pages367-376
Number of pages10
DOIs
StatePublished - 2006
Externally publishedYes
Event47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 - Berkeley, CA, United States
Duration: 21 Oct 200624 Oct 2006

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Country/TerritoryUnited States
CityBerkeley, CA
Period21/10/0624/10/06

Fingerprint

Dive into the research topics of 'Input-indistinguishable computation'. Together they form a unique fingerprint.

Cite this