Vincent Cheval

Orcid: 0000-0002-3622-2129

According to our database1, Vincent Cheval authored at least 37 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Learning Polynomial Recursive Programs.
Proc. ACM Program. Lang., January, 2024

DeepSec: Deciding Equivalence Properties for Security Protocols - Improved theory and practice.
TheoretiCS, 2024

On Tree Automata, Generating Functions, and Differential Equations.
CoRR, 2024

2023
Symbolic protocol verification with dice.
J. Comput. Secur., 2023

Automatic verification of transparency protocols (extended version).
CoRR, 2023

Automatic verification of transparency protocols.
Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

Indistinguishability Beyond Diff-Equivalence in ProVerif.
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

Election Verifiability with ProVerif.
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

2022
Sapic+: protocol verifiers of the world, unite!
IACR Cryptol. ePrint Arch., 2022

Hash Gone Bad: Automated discovery of protocol attacks that exploit hash function weaknesses.
IACR Cryptol. ePrint Arch., 2022

ProVerif with Lemmas, Induction, Fast Subsumption, and Much More.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Symbolic protocol verification with dice: process equivalences in the presence of probabilities.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

A Symbolic Analysis of Privacy for TLS 1.3 with Encrypted Client Hello.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2020
On the semantics of communications when verifying equivalence properties.
J. Comput. Secur., 2020

The Hitchhiker's Guide to Decidability and Complexity of Equivalence Properties in Security Protocols.
Proceedings of the Logic, 2020

2019
Exploiting Symmetries When Proving Equivalence Properties for Security Protocols.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

The DEEPSEC Prover.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
A procedure for deciding symbolic equivalence between sets of constraint systems.
Inf. Comput., 2017

On Communication Models When Verifying Equivalence Properties.
Proceedings of the Principles of Security and Trust - 6th International Conference, 2017

Secure Composition of PKIs with Public Key Protocols.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
Automated Verification of Equivalence Properties of Cryptographic Protocols.
ACM Trans. Comput. Log., 2016

DTKI: A New Formalized PKI with Verifiable Trusted Parties.
Comput. J., 2016

2015
Timing Attacks in Security Protocols: Symbolic Framework and Proof Techniques.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

Composing Security Protocols: From Confidentiality to Privacy.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

Secure Refinements of Communication Channels.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
DTKI: a new formalized PKI with no trusted parties.
CoRR, 2014

Tests for Establishing Security Properties.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

APTE: An Algorithm for Proving Trace Equivalence.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

2013
Deciding equivalence-based properties using constraint solving.
Theor. Comput. Sci., 2013

Proving More Observational Equivalences with ProVerif.
Proceedings of the Principles of Security and Trust - Second International Conference, 2013

Lengths May Break Privacy - Or How to Check for Equivalences with Length.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Automatic verification of cryptographic protocols : privacy-type properties. (Vérification automatique des protocoles cryptographiques : propriétés d'équivalence).
PhD thesis, 2012

Verifying Privacy-Type Properties in a Modular Way.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

2011
Trace equivalence decision: negative tests and non-determinism.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Automating Security Analysis: Symbolic Equivalence of Constraint Systems.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010


  Loading...