User Tools

Site Tools

On the Relationships Between Notions of Simulation-Based Security (BibTeX)

  author      = {R.~K{\"u}sters and A.~Datta and J.~C.~Mitchell and A.~Ramanathan},
  title       = {{On the Relationships Between Notions of Simulation-Based Security}},
  journal     = {Journal of Cryptology},
  year        = 2008,
  volume      = 21,
  number      = 4,
  pages       = {492-546},
  note        = {Electronic publication \url{}},
  doi         = {10.1007/s00145-008-9019-9},
  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.  Many of the proofs are carried out based on a small set of equivalence principles involving processes and distributed systems. These equivalences exhibit the essential properties needed to prove relationships between security notions and allow us to carry over our results to those computational models which satisfy these equivalences.}