Name
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, provided that the environment does not create key cycles or cause these-called commitment problem. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CSF.2009.18 | CSF |
Keywords | DocType | Volume |
authenticated encryption,abstract dolev-yao style functionality,authenticated version,universally composable symmetric encryption,ideal functionalities,public-key encryption,simulation-based security approach,symmetric encryption scheme,game-based security setting,ind-cca security,symmetric encryption,universal composability,digital signature,computational modeling,computer security,computer simulation,public key,cryptography,data mining,context modeling,authentication,digital signatures,protocols,public key encryption | Journal | 2009 |
ISSN | ISBN | Citations |
1940-1434 | 978-0-7695-3712-2 | 10 |
PageRank | References | Authors |
0.53 | 22 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Küsters | 1 | 1014 | 69.62 |
| Max Tuengerthal | 2 | 79 | 4.38 |