Sound Computational Interpretation of Formal Encryption with Composed Keys


Share/Save/Bookmark

Laud, P. and Corin, R.J. (2004) Sound Computational Interpretation of Formal Encryption with Composed Keys. In: LNCS, 6th Annual Int. Conf. on Information Security and Cryptology, Seoul, Korea (pp. pp. 55-66).

open access
[img]
Preview
PDF
209kB
Abstract: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. 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.
Item Type:Conference or Workshop Item
Copyright:© Springer
Research Group:
Link to this item:http://purl.utwente.nl/publications/41381
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 214077