Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols

José Bacelar Almeida, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephen Krenn, and Santiago Zanella-Béguelin

Abstract

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 this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving 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 integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract 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.

Details

Publication typeInproceedings
Published in19th ACM Conference on Computer and Communications Security, CCS 2012
URLhttp://dx.doi.org/10.1145/2382196.2382249
Pages488-500
PublisherACM
> Publications > Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols