A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs

A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Corin, Ricardo, den Hartog, Jerry
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Deterministic State
Exact sciences and technology
Probabilistic Choice
Security Notion
Security Proof
Signature Scheme
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/11787006_22