Sound Computational Interpretation of Formal Encryption with Composed Keys

Peeter Laud, Ricardo Corin

    Research output: Book/ReportReportOther research output

    35 Downloads (Pure)

    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. 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.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages55
    Publication statusPublished - Sep 2003

    Publication series

    NameCTIT Technical Reports
    PublisherCTIT
    No.2003-4

      Fingerprint

    Keywords

    • SCS-Cybersecurity

    Cite this

    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).