The formal and computational views of cryptography have been related by the seminal work of Abadi and Rogaway. In their work, a formal treatment of encryption that uses atomic keys is justified in the computational world. However, many proposed formal approaches allow the use of composed keys, where any arbitrary expression can be used as encryption key. In this paper we consider an extension of the formal model presented by Abadi and Rogaway, in which it is allowed to use composed keys in formal encryption. We then provide a computational interpretation for expressions that allow us to establish the computational soundness of formal encryption with composed keys. © Springer-Verlag 2004.
CITATION STYLE
Laud, P., & Corin, R. (2004). Sound computational interpretation of formal encryption with composed keys. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2971, 55–66. https://doi.org/10.1007/978-3-540-24691-6_5
Mendeley helps you to discover research relevant for your work.