EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

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

Home Policy Brochure Browse Search User Area Contact Help

Corin, R.J. and den Hartog, J.I. (2006) A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs. In: ICALP 2006 track C, 9-13 Jul 2006, Venice, Italy. pp. 252-263. Lecture Notes in Computer Science 4052. Springer-Verlag. ISBN 3-540-35907-9

This is the latest version of this eprint.

Full text available as:

	PDF (Short version as published in the proceedings) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 235 Kb
	PDF (Long version as it appears here http://eprint.iacr.org/2005/467) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 251 Kb

Official URL: http://dx.doi.org/10.1007/11787006_22

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.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-DIES: Distributed and Embedded Security
Research Program:	CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:	Inspired: Integrated Secure Platform for Interactive Personal Devices, PAW: Privacy in an Ambient World
ID Code:	1785
Status:	Published
Deposited On:	02 May 2006
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Available Versions of this Item

A Probabilistic Hoare-style logic for Game-based Cryptographic Proofs (deposited 02 May 2006)
[Currently Displayed]

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item