Name
Affiliation
Papers
BENJAMIN GRÉGOIRE
INRIA Sophia Antipolis - Méditerranée, France
81
Collaborators
Citations 
PageRank 
127
817
48.93
Referers 
Referees 
References 
1145
1337
1118
Search Limit
1001000
Title
Citations
PageRank
Year
Enforcing Fine-grained Constant-time Policies00.342022
Enforcing fine-grained constant-time policies.00.342022
Typing High-Speed Cryptography against Spectre v1.00.342022
EasyPQC: Verifying Post-Quantum Cryptography10.352021
High-Assurance Cryptography in the Spectre Era.00.342021
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability00.342021
Structured Leakage and Applications to Cryptographic Constant-Time and Cost00.342021
Masking in Fine-Grained Leakage Models: Construction, Implementation and Verification.20.372021
Formal verification of a constant-time preserving C compiler10.372020
The Last Mile: High-Assurance and High-Speed Cryptographic Implementations10.352020
Hardware Private Circuits: From Trivial Composition to Full Verification20.392020
Maskverif: Automated Verification Of Higher-Order Masking In Presence Of Physical Defaults30.392019
FaCT: a DSL for timing-sensitive computation20.352019
Machine-Checked Proofs for Cryptographic Standards.00.342019
A Machine-Checked Proof of Security for AWS Key Management Service30.402019
Symbolic Methods in Computational Cryptography Proofs10.372019
The Last Mile: High-Assurance and High-Speed Cryptographic Implementations.00.342019
Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-300.342019
maskVerif: a formal tool for analyzing software and hardware masked implementations.10.362018
An Assertion-Based Program Logic for Probabilistic Programs.00.342018
Masking the GLP Lattice-Based Signature Scheme at Any Order.20.412018
Symbolic Proofs for Lattice-Based Cryptography.10.362018
Proving expected sensitivity of probabilistic programs70.472018
Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic “Constant-Time”90.462018
Formal Security Proof of CMAC and Its Variants00.342018
Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference & Automated Optimizations.10.352018
Coupling proofs are probabilistic product programs.30.392017
Provably secure compilation of side-channel countermeasures.10.352017
Jasmin: High-Assurance and High-Speed Cryptography.140.582017
A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'.00.342017
A Fast and Verified Software Stack for Secure Function Evaluation.40.402017
Proving uniformity and independence by self-composition and coupling.60.442017
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model.140.512017
Advanced Probabilistic Couplings for Differential Privacy.130.552016
Proving Differential Privacy via Probabilistic Couplings190.712016
A program logic for union bounds.40.372016
Strong Non-Interference and Type-Directed Higher-Order Masking.180.762016
Verified Proofs of Higher-Order Masking.300.862015
Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler.90.522015
Automated Proofs of Pairing-Based Cryptography70.462015
Relational reasoning via probabilistic coupling90.492015
Synthesis of Fault Attacks on Cryptographic Implementations80.562014
Making RSA---PSS Provably Secure against Non-random Faults40.402014
Probabilistic relational verification for cryptographic implementations241.572014
Verified Implementations for Secure and Verifiable Computation.00.342014
Fully automated analysis of padding-based encryption in the computational model210.862013
EasyCrypt: A Tutorial.110.482013
Verified Security of Merkle-Damgård90.572012
Computer-Aided cryptographic proofs20.412012
Automation in computer-aided cryptography: proofs, attacks and designs00.342012
  • 1
  • 2