|Full text||Click to download.|
|Citation||Proceedings of Theory of Cryptography Conference, Lecture Notes
in Computer Science, Vol. 3378, pp. 476-494, February 2005
John C. Mitchell
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. These relations between a protocol and an ideal functionality are similar enough that they can be ordered from strongest to weakest according to the local form of their definitions. However, determining whether two relations are in fact identical depends on some subtle features that have not been brought out in previous studies. We identify the position of a "master process" in the distributed system, and some limitations on transparent message forwarding within computational complexity bounds, as two main factors. Using a general computational framework, we clarify the relationships between the simulation-based security conditions.
Back to publications
Back to previous page