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 language | English |
---|---|
Place of Publication | Enschede |
Publisher | University of Twente |
Number of pages | 18 |
Publication status | Published - 2006 |
Keywords
- IR-55964