Paper 2009/055

Universally Composable Symmetric Encryption

Ralf Kuesters and Max Tuengerthal


For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract Dolev-Yao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Abridged version appears in CSF 2009.
simulation-based security
Contact author(s)
tuengerthal @ uni-trier de
2009-08-11: last of 2 revisions
2009-02-06: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ralf Kuesters and Max Tuengerthal},
      title = {Universally Composable Symmetric Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2009/055},
      year = {2009},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.