Paper 2005/019

The Full Abstraction of the UC Framework

Jesüs F. Almansa


We prove that security in the Universal Composability framework (UC) is equivalent to security in the probabilistic polynomial time calculus ppc. Security is defined under active and adaptive adversaries with synchronous and authenticated communication. In detail, we define an encoding from machines in UC to processes in ppc and show it is fully abstract with respect to UC-security and ppc-security, i.e., we show a protocol is UC-secure iff its encoding is ppc-secure. However, we restrict security in ppc to be quantified not over all possible contexts, but over those induced by UC-environments under encoding. This result is not overly-simplifying security in ppc, since the threat and communication models we assume are meaningful in both practice and theory.

Note: (DIMACS Title: A Notation for Multiparty Protocols of ITM's: Digging from the Tunnel's Other End)

Available format(s)
Publication info
Published elsewhere. Also as BRICS Technical Report RS-04-15. Supersedes extended abstract at DIMACS Workshop, June 2004.
foundationsformal cryptographic analysis
Contact author(s)
jfa @ brics dk
2005-01-28: received
Short URL
Creative Commons Attribution


      author = {Jesüs F.  Almansa},
      title = {The Full Abstraction of the UC Framework},
      howpublished = {Cryptology ePrint Archive, Paper 2005/019},
      year = {2005},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.