EasyCrypt: A Tutorial

@inproceedings{Barthe2013EasyCryptAT,
  title={EasyCrypt: A Tutorial},
  author={Gilles Barthe and François Dupressoir and Benjamin Gr{\'e}goire and C{\'e}sar Kunz and Benedikt Schmidt and Pierre-Yves Strub},
  booktitle={FOSAD},
  year={2013}
}
Cryptography plays a key role in the security of modern communication and computer infrastructures; therefore, it is of paramount importance to design cryptographic systems that yield strong security guarantees. To achieve this goal, cryptographic systems are supported by security proofs that establish an upper bound for the probability that a resource-constrained adversary is able to break the cryptographic system. In most cases, security proofs are reductionist, i.e. they construct from an… 
Computer-Aided Proofs for Multiparty Computation with Active Security
TLDR
It is shown for the first time that EasyCrypt can be used to prove security of MPC against a malicious adversary, and a new non-interference based alternative to the usual simulation-based cryptographic definition is provided that is tailored specifically to the protocol.
Automation and Modularity of Cryptographic Proofs in the Computational Model
TLDR
A novel combination of symbolic and computational methods to achieve automated analysis of classes of constructions, without sacrificing the rigor of the code-based approach, and enabling for the first time the use of program synthesis in cryptographic design with computational guarantees is proposed.
Symbolic Proofs for Lattice-Based Cryptography
TLDR
This paper introduces a symbolic approach for proving security of cryptographic constructions based on the Learning With Errors assumption, and uses AutoLWE, an implementation of the logic, to deliver very short or even automatic proofs of several emblematic constructions.
Automation of Secrecy Proofs for Security of Protocols
TLDR
A tool that uses a backward approach to explore the state space of a protocol, supporting this way an unlimited number of sessions and compared the obtained prototype with Scary, in order to work coherently with the technique of Bana and Commom-Lundh.
Machine-Checked Proofs for Cryptographic Standards
TLDR
This work presents a high-assurance and high-speed implementation of the SHA-3 hash function that is the first to achieve simultaneously the four desirable properties (efficiency, correctness, provable security, and side-channel protection) for a non-trivial cryptographic primitive.
Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3
TLDR
This work presents a high-assurance and high-speed implementation of the SHA-3 hash function that is the first to achieve simultaneously the four desirable properties (efficiency, correctness, provable security, and side-channel protection) for a non-trivial cryptographic primitive.
Bringing State-Separating Proofs to EasyCrypt - A Security Proof for Cryptobox
TLDR
This work explores how SSPs can guide EasyCrypt formalisations of proofs for modular constructions and proposes a mapping from SSP to EasyCrypt concepts which enables us to enhance cryptographic proofs with SSP insights while maintaining compatibility with existing EasyCrypt proof support.
Exploring Automation in Proofs of Attribute-based Encryption in the Standard Model
TLDR
This paper significantly expands the scope of AutoG&P to support a rich set of data types such as multi-dimensional arrays, and constructs commonly used in cryptographic protocols such as monotone-access structures, and linear secret-sharing schemes, and provides support for a extended class of pairing-based assumptions.
Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model
TLDR
The research on proving the security of multi-party cryptographic protocols using the EASYCRYPT proof assistant is reported on, and honest-butcurious (semi-honest) security is defined using a variation of the real/ideal paradigm in which an adversary chooses protocol inputs to distinguish the party’s real and ideal games.
Automated Cryptographic Analysis of the Pedersen Commitment Scheme
TLDR
This paper presents a mechanised formal verification of the popular Pedersen commitment protocol, proving its security properties of correctness, perfect hiding, and computational binding.
...
...

References

SHOWING 1-6 OF 6 REFERENCES
Verified Implementations for Secure and Verifiable Computation
TLDR
This paper presents a scalable approach to formally verifying implementations of higherlevel cryptographic systems, directly in the computational model, and critically rely on two novel features: a module and theory system that supports compositional reasoning, and a code extraction mechanism for generating implementations from formalizations.
Fully automated analysis of padding-based encryption in the computational model
TLDR
This paper presents proof systems for analyzing the chosen-plaintext and chosen-ciphertext security of public-key encryption schemes built from trapdoor permutations and hash functions in the random oracle model, and develops a toolset that bundles together fully automated proof and attack finding algorithms.
Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations
TLDR
A computer-aided framework for proving concrete security bounds for cryptographic machine code implementations that bridges the gap between computer-assisted security proofs and real-world cryptographic implementations as described by standards such as PKCS.
Formal certification of code-based cryptographic proofs
TLDR
This work presents Certicrypt, a framework that enables the machine-checked construction and verification of code-based proofs, built upon the general-purpose proof assistant Coq, and draws on many areas, including probability, complexity, algebra, and semantics of programming languages.
Computer-Aided Security Proofs for the Working Cryptographer
TLDR
It is argued that EasyCrypt is a plausible candidate for adoption by working cryptographers and its application to security proofs of the Cramer-Shoup and Hashed ElGamal cryptosystems is illustrated.
A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework
TLDR
An interesting feature-unique to the mutual information based distinguisher-resembling a type of stochastic resonance, which could potentially enhance the effectiveness of such attacks over other methods in certain noisy scenarios is observed.