A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs

Ricardo Corin, Jerry den Hartog

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

    44 Downloads (Pure)

    Abstract

    We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.
    Original languageEnglish
    Title of host publicationAutomata, Languages and Programming
    Subtitle of host publication33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings
    EditorsMichele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
    Place of PublicationBerlin
    PublisherSpringer
    Pages252-263
    Number of pages12
    ISBN (Electronic)978-3-540-35908-1
    ISBN (Print)978-3-540-35907-4
    DOIs
    Publication statusPublished - Jul 2006
    Event33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Venice, Italy
    Duration: 9 Jul 200613 Jul 2006
    Conference number: 33

    Publication series

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

    Conference

    Conference33rd International Colloquium on Automata, Languages and Programming, ICALP 2006
    Abbreviated titleICALP
    CountryItaly
    CityVenice
    Period9/07/0613/07/06

    Keywords

    • METIS-237428
    • SCS-Cybersecurity
    • EWI-1785
    • IR-65548

    Fingerprint Dive into the research topics of 'A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs'. Together they form a unique fingerprint.

    Cite this