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.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||55|
|Publication status||Published - Sep 2003|
|Name||CTIT Technical Reports|
Laud, P., & Corin, R. (2003). Sound Computational Interpretation of Formal Encryption with Composed Keys. (CTIT Technical Reports; No. 2003-4). Enschede: Centre for Telematics and Information Technology (CTIT).