Input-Indistinguishable Computation

Authors:
Silvio Micali;Rafael Pass;Alon Rosen
Affiliations:
MIT CSAIL, USA;Cornell University, USA;Harvard DEAS, USA
Venue:
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Year:
2006

Citing 0
Cited 6

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A unified framework for concurrent security: universal composability from stand-alone non-malleability

Proceedings of the forty-first annual ACM symposium on Theory of computing
Concurrently-secure blind signatures without random oracles or setup assumptions

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Constant round non-malleable protocols using one way functions

Proceedings of the forty-third annual ACM symposium on Theory of computing
Concurrently secure computation in constant rounds

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A unified framework for UC from only OT

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

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.