<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06084478</id>
  <dt>a</dt>
  <an>06084478</an>
  <augroup>
    <au>Barthe, Gilles</au>
    <au>Crespo, Juan Manuel</au>
    <au>Gr\'egoire, Benjamin</au>
    <au>Kunz, C\'esar</au>
    <au>Zanella B\'eguelin, Santiago</au>
  </augroup>
  <ti>Computer-aided cryptographic proofs.</ti>
  <so>Beringer, Lennart (ed.) et al., Interactive theorem proving. Third international conference, ITP 2012, Princeton, NJ, USA, August 13--15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32346-1/pbk). Lecture Notes in Computer Science 7406, 11-27 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-32347-8_2</li>
  </ligroup>
  <abgroup>
    <ab>Summary: EasyCrypt is an automated tool that supports the machine-checked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of public-key encryption schemes, digital signature schemes, hash function designs, and block cipher modes of operation. The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.</ab>
    <rv></rv>
  </abgroup>
</item>