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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Paulin-Mohring, C., Audebaud, P.: Proofs of Randomized Algorithms in Coq. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 49–68. Springer, Heidelberg (2006)
M. Bellare and P. Rogaway. The game-playing technique, December 2004. At http://www.cs.ucdavis.edu/~rogaway/papers/games.html .
Blanchet, B.: A computationally sound mechanized prover for security protocols. In: IEEE Symposium on Security and Privacy, Oakland, California (2006)
Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer-Verlag, Heidelberg (2001)
R. Corin and J. den Hartog. A probabilistic hoare-style logic for game-based cryptographic proofs 2006.(long version, http://eprint.iacr.org/2005/467 )
ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)
Filliâtre, J.-C.: Why: a multi-language multi-prover verification tool. Technical report, LRI, Université Paris Sud (2003)
Galindo, D.: Boneh-franklin identity based encryption revisited. In: ICALP, pp. 791–802 (2005)
Halevi, S.: A plausible approach to computer-aided cryptographic proofs (2005), At http://eprint.iacr.org/2005/181/
den Hartog, J.I.: Probabilistic Extensions of Semantical Models. In: PhD thesis (2002)
den Hartog, J.I., de Vink, E.P.: Verifying probabilistic programs using a Hoare like logic. Int. Journal of Foundations of Computer Science 13(3), 315–340 (2002)
Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12, 576–580 (1969)
Hooman, J.: Program design in PVS. In: Workshop on Tool Support for System Development and Verification, Germany (1997)
Gordon, M.J.C.: Mechanizing programming logics in higher-order logic. In: Proc. of the Workshop on Hardware Verification, pp. 387–439. Springer, Heidelberg (1988)
Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: Probabilistic bisimulation and equivalence for security analysis of network protocols. In: FoSSaCS, pp. 468–483 (2004)
V. Shoup. Sequences of games: a tool for taming complexity in security proofs, May 2005.At http://www.shoup.net/papers/games.pdf .
Tarento, S.: Machine-checked security proofs of cryptographic signature schemes. In: ESORICS, pp. 140–158 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corin, R., den Hartog, J. (2006). A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_22
Download citation
DOI: https://doi.org/10.1007/11787006_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35907-4
Online ISBN: 978-3-540-35908-1
eBook Packages: Computer ScienceComputer Science (R0)