A Simple Model of Polynomial Time UC (abstract) (Workshop on Models for Cryptographic Protocols 2006)
Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
[ eprint ]

We introduce a new notion of polynomial-time UC and Reactive Simulatability that allows the protocols to run in polynomial time in the length of their inputs. In comparison to prior work, our approach allows for a much larger class of protocols, and the definitions are nevertheless very simple.