User Tools

Site Tools


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

@INPROCEEDINGS{DattaKuestersMitchellRamanathan-TCC-2005,
  author = {A.~Datta and R.~K{\"u}sters and J.C.~Mitchell and A.~Ramanathan},
  title = {{On the Relationships Between Notions of Simulation-Based Security}},
  booktitle = {Proceedings of the 2nd Theory of Cryptography Conference (TCC 2005)},
  volume = 3378,
  series = {Lecture Notes in Computer Science},
  editor = {J.~Kilian},
  publisher = {Springer-Verlag},
  pages = {476--494},
  year = 2005,
  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, we clarify the relationships between the simulation-based security conditions.}
}