Sound Computational Interpretation of Formal Encryption with Composed Keys

Peeter Laud, Ricardo Corin

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    32 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. 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
    Title of host publicationInformation Security and Cryptology - ICISC 2003
    Subtitle of host publication6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers
    EditorsJong-In Lim, Dong-Hoo Lee
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer
    Pages55-66
    Number of pages12
    ISBN (Electronic)978-3-540-24691-6
    ISBN (Print)978-3-540-21376-5
    DOIs
    Publication statusPublished - Nov 2003
    Event6th Annual International Conference on Information Security and Cryptology, ICISC 2003 - Seoul, Korea, Republic of
    Duration: 1 Nov 20031 Nov 2003
    Conference number: 6

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume2971
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference6th Annual International Conference on Information Security and Cryptology, ICISC 2003
    Abbreviated titleICISC
    CountryKorea, Republic of
    CitySeoul
    Period1/11/031/11/03

    Fingerprint

    Computational
    Sound
    Cryptography

    Keywords

    • SCS-Cybersecurity

    Cite this

    Laud, P., & Corin, R. (2003). Sound Computational Interpretation of Formal Encryption with Composed Keys. In J-I. Lim, & D-H. Lee (Eds.), Information Security and Cryptology - ICISC 2003: 6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers (pp. 55-66). (Lecture Notes in Computer Science; Vol. 2971). Berlin, Heidelberg: Springer. https://doi.org/10.1007/b96249
    Laud, Peeter ; Corin, Ricardo. / Sound Computational Interpretation of Formal Encryption with Composed Keys. Information Security and Cryptology - ICISC 2003: 6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers. editor / Jong-In Lim ; Dong-Hoo Lee. Berlin, Heidelberg : Springer, 2003. pp. 55-66 (Lecture Notes in Computer Science).
    @inproceedings{c557de7f70fa4258a1781d74b88497cf,
    title = "Sound Computational Interpretation of Formal Encryption with Composed Keys",
    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.",
    keywords = "SCS-Cybersecurity",
    author = "Peeter Laud and Ricardo Corin",
    year = "2003",
    month = "11",
    doi = "10.1007/b96249",
    language = "English",
    isbn = "978-3-540-21376-5",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "55--66",
    editor = "Jong-In Lim and Dong-Hoo Lee",
    booktitle = "Information Security and Cryptology - ICISC 2003",

    }

    Laud, P & Corin, R 2003, Sound Computational Interpretation of Formal Encryption with Composed Keys. in J-I Lim & D-H Lee (eds), Information Security and Cryptology - ICISC 2003: 6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers. Lecture Notes in Computer Science, vol. 2971, Springer, Berlin, Heidelberg, pp. 55-66, 6th Annual International Conference on Information Security and Cryptology, ICISC 2003, Seoul, Korea, Republic of, 1/11/03. https://doi.org/10.1007/b96249

    Sound Computational Interpretation of Formal Encryption with Composed Keys. / Laud, Peeter; Corin, Ricardo.

    Information Security and Cryptology - ICISC 2003: 6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers. ed. / Jong-In Lim; Dong-Hoo Lee. Berlin, Heidelberg : Springer, 2003. p. 55-66 (Lecture Notes in Computer Science; Vol. 2971).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    TY - GEN

    T1 - Sound Computational Interpretation of Formal Encryption with Composed Keys

    AU - Laud, Peeter

    AU - Corin, Ricardo

    PY - 2003/11

    Y1 - 2003/11

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

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

    KW - SCS-Cybersecurity

    U2 - 10.1007/b96249

    DO - 10.1007/b96249

    M3 - Conference contribution

    SN - 978-3-540-21376-5

    T3 - Lecture Notes in Computer Science

    SP - 55

    EP - 66

    BT - Information Security and Cryptology - ICISC 2003

    A2 - Lim, Jong-In

    A2 - Lee, Dong-Hoo

    PB - Springer

    CY - Berlin, Heidelberg

    ER -

    Laud P, Corin R. Sound Computational Interpretation of Formal Encryption with Composed Keys. In Lim J-I, Lee D-H, editors, Information Security and Cryptology - ICISC 2003: 6th International Conference, Seoul, Korea, November 27-28, 2003. Revised Papers. Berlin, Heidelberg: Springer. 2003. p. 55-66. (Lecture Notes in Computer Science). https://doi.org/10.1007/b96249