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

Authors

• Silvio Micali
• Rafael Pass
• Alon Rosen

Keywords

• Security
• Concurrent computing
• Access protocols
• Computational modeling
• Privacy
• Public key
• Processor scheduling
• Internet
• Computer science
• Veins
• Standard Assumptions
• Multi-party Computation
• Number Of Executions
• Corruption
• General Protocol
• Type Of Protocol
• Security Protocols
• Man-in-the-middle
• Security Parameter
• Proof Sketch
• Notion Of Security
• Protocol Execution
• Security Weaknesses
• Zero-knowledge Proof