Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Logics for reasoning about cryptographic constructions
Journal of Computer and System Sciences - Special issue on FOCS 2003
Reasoning about probabilistic sequential programs
Theoretical Computer Science
A probabilistic hoare-style logic for game-based cryptographic proofs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Boneh-Franklin identity based encryption revisited
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In [R.J. Corin, J.I. den Hartog, A probabilistic hoare-style logic for game-based cryptographic proofs, in: M. Bugliesi, B. Preneel, V. Sassone (Eds.), ICALP 2006 Track C, Venice, Italy, in: Lecture Notes in Computer Science, vol. 4052, Springer-Verlag, Berlin, 2006, pp. 252-263] we build a formal verification technique for game-based correctness proofs of cryptographic algorithms based on a probabilistic Hoare style logic [J.I. den Hartog, E.P. de Vink, Verifying probabilistic programs using a Hoare like logic, International Journal of Foundations of Computer Science 13 (3) (2002) 315-340]. An important step towards enabling mechanized verification within this technique is an axiomatization of implication between predicates which is purely semantically defined in the latter reference cited above. In this paper we provide an axiomatization and illustrate its place in the formal verification technique given in the former.