Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- Article
Computer-aided security proofs for the working cryptographer
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptology•August 2011, pp 71-90We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches-compact, formal representations of the essence of a proof as a sequence of games and hints. Proof sketches are checked automatically ...
- Article
Beyond provable security verifiable IND-CCA security of OAEP
CT-RSA'11: Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011•February 2011, pp 180-196OAEP is a widely used public-key encryption scheme based on trapdoor permutations. Its security proof has been scrutinized and amended repeatedly. Fifteen years after the introduction of OAEP, we present a machine-checked proof of its security against ...
- article
Certifying compilers using higher-order theorem provers as certificate checkers
Formal Methods in System Design, Volume 38, Issue 1•February 2011, pp 33-61 • https://doi.org/10.1007/s10703-010-0108-7Correct software requires compilers to work correctly. Especially code generation can be an error prone task, since it potentially uses sophisticated algorithms to produce efficient code.
In this paper we present an approach to guarantee the correctness ...
- Article
On strong normalization of the calculus of constructions with type-based termination
LPAR'10: Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning•October 2010, pp 333-347Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-based termination is a mechanism for ensuring termination that uses types ...
- Article
A Machine-Checked Formalization of Sigma-Protocols
CSF '10: Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium•July 2010, pp 246-260• https://doi.org/10.1109/CSF.2010.24Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by the rules of a protocol, without forcing them to reveal their secrets. Σ-...
- Article
Extending coq with imperative features and its application to SAT verification
ITP'10: Proceedings of the First international conference on Interactive Theorem Proving•July 2010, pp 83-98• https://doi.org/10.1007/978-3-642-14052-5_8Coq has within its logic a programming language that can be used to replace many deduction steps into a single computation, this is the so-called reflection. In this paper, we present two extensions of the evaluation mechanism that preserve its ...
- Article
Programming language techniques for cryptographic proofs
ITP'10: Proceedings of the First international conference on Interactive Theorem Proving•July 2010, pp 115-130• https://doi.org/10.1007/978-3-642-14052-5_10CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement of security, and the hypotheses under which it is proved, are expressed ...
- Article
Implementing a Direct Method for Certificate Translation
ICFEM '09: Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering•November 2009, pp 541-560• https://doi.org/10.1007/978-3-642-10373-5_28Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level code, and is useful for eliminating trust in the compiler (for high assurance code) ...
- chapter
A Tutorial on Type-Based Termination
Language Engineering and Rigorous Software Development•July 2009, pp 100-152• https://doi.org/10.1007/978-3-642-03153-3_3Type-based termination is a method to enforce termination of recursive definitions through a non-standard type system that introduces a notion of size for inhabitants of inductively defined types. The purpose of this tutorial is to provide a gentle ...
- research-article
Certificate translation for optimizing compilers
ACM Transactions on Programming Languages and Systems, Volume 31, Issue 5•June 2009, Article No.: 18, pp 1-45 • https://doi.org/10.1145/1538917.1538919Proof Carrying Code provides trust in mobile code by requiring certificates that ensure the code adherence to specific conditions. The prominent approach to generate certificates for compiled code is Certifying Compilation, that automatically generates ...
- chapter
A New Elimination Rule for the Calculus of Inductive Constructions
Types for Proofs and Programs•June 2009, pp 32-48• https://doi.org/10.1007/978-3-642-02444-3_3In Type Theory, definition by dependently-typed case analysis can be expressed by means of a set of equations -- the semantic approach -- or by an explicit pattern-matching construction -- the syntactic approach. We aim at putting together the best of ...
- Article
Formally Certifying the Security of Digital Signature Schemes
SP '09: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy•May 2009, pp 237-250• https://doi.org/10.1109/SP.2009.17We present two machine-checked proofs of the existentialunforgeability under adaptive chosen-message attacks of the FullDomain Hash signature scheme. These proofs formalize the originalargument of Bellare and Rogaway, and an optimal reduction by ...
- chapter
Formal Certification of ElGamal Encryption
Formal Aspects in Security and Trust•April 2009, pp 1-19• https://doi.org/10.1007/978-3-642-01465-9_1CertiCrypt [1] is a framework that assists the construction of machine-checked cryptographic proofs that can be automatically verified by third parties. To date, CertiCrypt has been used to prove formally the exact security of widely studied ...
- research-article
Formal certification of code-based cryptographic proofs
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages•January 2009, pp 90-101• https://doi.org/10.1145/1480881.1480894As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-based techniques provide a popular approach in which proofs are structured as ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 1, January 2009 - chapter
The MOBIUS Proof Carrying Code Infrastructure
Formal Methods for Components and Objects•December 2008, pp 1-24• https://doi.org/10.1007/978-3-540-92188-2_1The goal of the <Emphasis FontCategory="SansSerif">MOBIUS</Emphasis> project is to develop a Proof Carrying Code architecture to secure global computers that consist of Java-enabled mobile devices. In this overview, we present the consumer side of the <...
- Article
Proof certificates for algebra and their application to automatic geometry theorem proving
ADG'08: Proceedings of the 7th international conference on Automated deduction in geometry•September 2008, pp 42-59Integrating decision procedures in proof assistants in a safe way is a major challenge. In this paper, we describe how, starting from Hilbert's Nullstellensatz theorem, we combine a modified version of Buchberger's algorithm and some reflexive ...
- Article
Type-Based Termination with Sized Products
CSL '08: Proceedings of the 22nd international workshop on Computer Science Logic•September 2008, pp 493-507• https://doi.org/10.1007/978-3-540-87531-4_35Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursive calls operate on smaller arguments. However, many systems using type-...
- Article
Preservation of Proof Obligations from Java to the Java Virtual Machine
IJCAR '08: Proceedings of the 4th international joint conference on Automated Reasoning•August 2008, pp 83-99• https://doi.org/10.1007/978-3-540-71070-7_7While program verification environments typically target source programs, there is an increasing need to provide strong guarantees for executable programs.
We establish that it is possible to reuse the proof that a source Java program meets its ...
- Article
Combining a verification condition generator for a bytecode language with static analyses
In Proof-Carrying Code, the verification condition generator (VCgen) generates a set of formulas whose validity implies that the code satisfies the consumer policy. Applying a VCgen to a bytecode language with exceptions (such as Java bytecode) can ...
- Article
CIC∧: type-based termination of recursive definitions in the calculus of inductive constructions
LPAR'06: Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning•November 2006, pp 257-271• https://doi.org/10.1007/11916277_18Sized types provides a type-based mechanism to enforce termination of recursive definitions in typed λ-calculi. Previous work has provided strong indications that type-based termination provides an appropriate foundation for proof assistants based on ...
