Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs

Provable security. The goal of provable security is to verify rigorously the security of cryptographic systems. A provable security argument proceeds in three steps:

1. Define a security goal and an adversarial model;

2. Define the cryptographic system and the security assumptions upon which the security of the system hinges;

3. Show by reduction that any attack against the cryptographic system can be used to build an efficient algorithm that breaks a security assumption.

2012.MPC.pdf
PDF file

In  11th International Conference on Mathematics of Program Construction, MPC 2012

Publisher  Springer

Details

TypeInproceedings
URLhttp://dx.doi.org/10.1007/978-3-642-31113-0_1
Pages1-6
Number7342
SeriesLecture Notes in Computer Science
> Publications > Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs