@inproceedings{barthe2012computer-aided,
author = {Barthe, Gilles and Grégoire, Benjamin and Zanella-Béguelin, Santiago},
title = {Computer-Aided Cryptographic Proofs},
series = {Lecture Notes in Computer Science},
booktitle = {19th International Symposium on Static Analysis, SAS 2012},
year = {2012},
month = {January},
abstract = {Provable security is at the heart of modern cryptography. It advocates a mathematical approach in which the security of new cryptographic constructions is defined rigorously, and provably reduced to one or several assumptions, such as the hardness of a computational problem, or the existence of an ideal functionality. A typical provable security statement is of the form: for any adversary A against the cryptographic construction S, there exists an adversary B against a security assumption H, such that if A has a high probability of breaking the scheme S in time t, then B has a high probability of breaking the assumption H in time t′ (defined as a function of t).},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/computer-aided-cryptographic-proofs-2/},
pages = {1-2},
volume = {7460},
edition = {19th International Symposium on Static Analysis, SAS 2012},
}