%0 Conference Paper
%B Conference on Computer and Communications Security  - CCS
%D 2012
%T Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols
%A José Bacelar Almeida
%A Manuel Bernardo Barbosa
%A Endre Bangerter
%A Gilles Barthe
%A Stephan Krenn
%A Santiago Zanella Béguelin
%C Raleigh, NC, USA
%P 488-500
%U http://doi.acm.org/10.1145/2382196.2382249
%X <p>Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from having to implement cryptography on their own by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is risky as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify.<br /> In this paper, we present ZKCrypt, an optimizing cryptographic compiler that achieves an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt tightly integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage in the pipeline, ZKCrypt provides assurance that the implementation it outputs securely realizes the high-level proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system.</p>
%8 October
%> https://haslab.uminho.pt/sites/default/files/jba/files/12ccs.pdf