François Dupressoir

Orcid: 0000-0003-3497-3110

Affiliations:
  • University of Bristol, UK


According to our database1, François Dupressoir authored at least 39 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
How Hard Can It Be to Formalize a Proof? Lessons from Formalizing CryptoBox Three Times in EasyCrypt.
IACR Cryptol. ePrint Arch., 2025

Work in Progress: Secure Deletion on Cloud - a Constant Battle.
Proceedings of the IEEE European Symposium on Security and Privacy, 2025

2024
Towards End-to-End Verifiable Online Voting: Adding Verifiability to Established Voting Systems.
IEEE Trans. Dependable Secur. Comput., 2024

A Tight Security Proof for $\mathrm{SPHINCS^{+}}$, Formally Verified.
IACR Cryptol. ePrint Arch., 2024

Formally Verifying Kyber - Episode V: Machine-Checked IND-CCA Security and Correctness of ML-KEM in EasyCrypt.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

A Tight Security Proof for SPHINCS<sup>+</sup>, Formally Verified.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Machine-Checked Security for $\mathrm{XMSS}$ as in RFC 8391 and $\mathrm{SPHINCS}^{+}$.
IACR Cryptol. ePrint Arch., 2023

Machine-Checked Proofs of Accountability: How to sElect Who is to Blame.
Proceedings of the Computer Security - ESORICS 2023, 2023

Machine-Checked Security for rmXMSS as in RFC 8391 and $\mathrm {SPHINCS^{+}} $.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Bringing State-Separating Proofs to EasyCrypt A Security Proof for Cryptobox.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021
Machine-Checking Unforgeability Proofs for Signature Schemes with Tight Reductions to the Computational Diffie-Hellman Problem.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

Mechanised Models and Proofs for Distance-Bounding.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations.
J. Cryptogr. Eng., 2020

Precise and Mechanised Models and Proofs for Distance-Bounding and an Application to Contactless Payments.
IACR Cryptol. ePrint Arch., 2020

Augmenting an Internet Voting System with Selene Verifiability using Permissioned Distributed Ledger.
Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019
Machine-Checked Proofs for Cryptographic Standards.
IACR Cryptol. ePrint Arch., 2019

VMV: Augmenting an Internet Voting System with Selene Verifiability.
CoRR, 2019

Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference & Automated Optimizations.
IACR Cryptol. ePrint Arch., 2018

Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

Formal Security Proof of CMAC and Its Variants.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'.
IACR Cryptol. ePrint Arch., 2017

Machine-Checked Proofs of Privacy for Electronic Voting Protocols.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

A Fast and Verified Software Stack for Secure Function Evaluation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Verifying Constant-Time Implementations.
Proceedings of the 25th USENIX Security Symposium, 2016

Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC.
Proceedings of the Fast Software Encryption - 23rd International Conference, 2016

Strong Non-Interference and Type-Directed Higher-Order Masking.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler.
IACR Cryptol. ePrint Arch., 2015

Verified Proofs of Higher-Order Masking.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Verified Implementations for Secure and Verifiable Computation.
IACR Cryptol. ePrint Arch., 2014

Making RSA-PSS Provably Secure against Non-random Faults.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

Synthesis of Fault Attacks on Cryptographic Implementations.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Proving cryptographic C programs secure with general-purpose verification tools.
PhD thesis, 2013

EasyCrypt: A Tutorial.
Proceedings of the Foundations of Security Analysis and Design VII, 2013

Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2011
Verifying Cryptographic Code in C: Some Experience and the Csec Challenge.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011


  Loading...