Cryptology ePrint Archive: Report 2006/153
On the Relationships Between Notions of Simulation-Based Security
Anupam Datta and Ralf Kuesters and John C. Mitchell and Ajith Ramanathan
Abstract: 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 logical 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, called Sequential Probabilistic Process Calculus (SPPC), we clarify the relationships between the simulation-based security conditions.
We also prove general composition theorems in SPPC. Many of the proofs are carried out based on a small set of equivalence principles involving processes and distributed systems. This gives us results that carry over to a variety of computational models.
Category / Keywords: foundations / simulation-based security, universal composability, reactive simulatability, black-box simulatability, process calculus
Publication Info: An abridged version of this work has been published in TCC 2005.
Date: received 20 Apr 2006
Contact author: kuesters at ti informatik uni-kiel de
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20060422:183741 (All versions of this report)
Short URL: ia.cr/2006/153
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]