Cryptology ePrint Archive: Report 2009/055

Universally Composable Symmetric Encryption

Ralf Kuesters and Max Tuengerthal

Abstract: 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.

Category / Keywords: cryptographic protocols / simulation-based security

Publication Info: Abridged version appears in CSF 2009.

Date: received 4 Feb 2009, last revised 11 Aug 2009

Contact author: tuengerthal at uni-trier de

Available format(s): PDF | BibTeX Citation

Version: 20090811:144642 (All versions of this report)

Short URL: ia.cr/2009/055

Discussion forum: Show discussion | Start new discussion