A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs
Autor: | Corin, Ricardo, den Hartog, Jerry, Bugliesi, Michele, Preneel, Bart, Sassone, Vladimiro, Wegener, Ingo |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2006 |
Předmět: |
EWI-1785
Theoretical computer science Cryptographic primitive METIS-237428 Programming language Computer science business.industry Semantics (computer science) SCS-Cybersecurity Probabilistic logic Cryptography Hoare logic computer.software_genre Mathematical proof TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science Computer Science::Programming Languages Semantic security business computer ElGamal encryption IR-65548 Computer Science::Cryptography and Security |
Zdroj: | Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, 252-263 STARTPAGE=252;ENDPAGE=263;TITLE=Automata, Languages and Programming Automata, Languages and Programming ISBN: 9783540359074 ICALP (2) Automata, Languages and Programming (Proceedings 33rd International Colloquium, ICALP 2006, Venice, Italy, July 9-16, 2006), Part II, 252-263 STARTPAGE=252;ENDPAGE=263;TITLE=Automata, Languages and Programming (Proceedings 33rd International Colloquium, ICALP 2006, Venice, Italy, July 9-16, 2006), Part II |
ISSN: | 0302-9743 |
DOI: | 10.1007/11787006_22 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |