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

32 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

Fingerprint

Semantics

Keywords

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

Cite this

Corin, R., & den Hartog, J. (2006). A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. In M. Bugliesi, B. Preneel, V. Sassone, & I. Wegener (Eds.), Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings (pp. 252-263). (Lecture Notes in Computer Science; Vol. 4052). Berlin: Springer. https://doi.org/10.1007/11787006_22
Corin, Ricardo ; den Hartog, Jerry. / A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings. editor / Michele Bugliesi ; Bart Preneel ; Vladimiro Sassone ; Ingo Wegener. Berlin : Springer, 2006. pp. 252-263 (Lecture Notes in Computer Science).
@inproceedings{beb509e3a5904bb197dd9d55e3017b0f,
title = "A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs",
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.",
keywords = "METIS-237428, SCS-Cybersecurity, EWI-1785, IR-65548",
author = "Ricardo Corin and {den Hartog}, Jerry",
year = "2006",
month = "7",
doi = "10.1007/11787006_22",
language = "English",
isbn = "978-3-540-35907-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "252--263",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener",
booktitle = "Automata, Languages and Programming",

}

Corin, R & den Hartog, J 2006, A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. in M Bugliesi, B Preneel, V Sassone & I Wegener (eds), Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings. Lecture Notes in Computer Science, vol. 4052, Springer, Berlin, pp. 252-263, 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, Venice, Italy, 9/07/06. https://doi.org/10.1007/11787006_22

A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. / Corin, Ricardo; den Hartog, Jerry.

Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings. ed. / Michele Bugliesi; Bart Preneel; Vladimiro Sassone; Ingo Wegener. Berlin : Springer, 2006. p. 252-263 (Lecture Notes in Computer Science; Vol. 4052).

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

TY - GEN

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

AU - Corin, Ricardo

AU - den Hartog, Jerry

PY - 2006/7

Y1 - 2006/7

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

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

KW - METIS-237428

KW - SCS-Cybersecurity

KW - EWI-1785

KW - IR-65548

U2 - 10.1007/11787006_22

DO - 10.1007/11787006_22

M3 - Conference contribution

SN - 978-3-540-35907-4

T3 - Lecture Notes in Computer Science

SP - 252

EP - 263

BT - Automata, Languages and Programming

A2 - Bugliesi, Michele

A2 - Preneel, Bart

A2 - Sassone, Vladimiro

A2 - Wegener, Ingo

PB - Springer

CY - Berlin

ER -

Corin R, den Hartog J. A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. In Bugliesi M, Preneel B, Sassone V, Wegener I, editors, Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings. Berlin: Springer. 2006. p. 252-263. (Lecture Notes in Computer Science). https://doi.org/10.1007/11787006_22