Chapter

Mathematics of Program Construction

Volume 7342 of the series Lecture Notes in Computer Science pp 1-6

Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs

  • Gilles BartheAffiliated withLancaster UniversityIMDEA Software Institute
  • , Benjamin GrégoireAffiliated withLancaster UniversityINRIA Sophia Antipolis - Méditerranée
  • , Santiago Zanella BéguelinAffiliated withCarnegie Mellon UniversityMicrosoft Research

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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

    Define a security goal and an adversarial model;

     
  2. 2

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

     
  3. 3

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