in Ausgezeichnete Informatikdissertationen 2006, Lecture Notes in Informatics (LNI) – Dissertations vol. D-7, Gesellschaft für Informatik, pp. 189-198, May 2007. In German.
This is a short summary of the Ph.D. thesis Protokollkomposition und Komplexität by Unruh published as part of the nomination process for the award offered by the German Society for Computer Science (Gesellschaft für Informatik) for the best German, Austrian and Swiss Ph.D. thesis.
Both this summary and the thesis are written in German. Wide parts of this thesis are covered by the English papers Comparing Two Notions of Simulatability by Hofheinz and Unruh, Simulatable Security and Polynomially Bounded Concurrent Composition by Hofheinz and Unruh and Relations among Statistical Security Notions - or - Why Exponential Adversaries are Unlimited by Unruh.
This publication is accompanied by links to downloadable versions of this publication. These documents do not necessarily correspond exactly to the cited version. Instead, in most cases full, updated or preliminary versions are provided. For access to the official version, follow the "Official version" link to the publishers site.
Slides used in my talks are available upon personal request, as long as you agree not to disseminate them to a wider audience or make them available online. If in doubt, please ask.