Decidable Fragments of Simultaneous Rigid Reachability. - Véronique Cortier; Harald Ganzinger; Florent Jacquemard; Margus Veanes (ICALP, 1999)

Flatness Is Not a Weakness. - Hubert Comon; Véronique Cortier (CSL, 2000)

Proving Secrecy is Easy Enough. - Véronique Cortier; Jonathan K. Millen; Harald Rueß (CSFW, 2001)

Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. - Hubert Comon; Véronique Cortier; John Mitchell (ICALP, 2001)

About the decision of reachability for register machines. - Véronique Cortier (RAIRO Theor. Informatics Appl., 2002)

New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. - Hubert Comon-Lundh; Véronique Cortier (RTA, 2003)

Security properties: two agents are sufficient. - Hubert Comon-Lundh; Véronique Cortier (Sci. Comput. Program., 2004)

Deciding Knowledge in Security Protocols under (Many More) Equational Theories. - Martín Abadi; Véronique Cortier (CSFW, 2005)

Computationally Sound, Automated Proofs for Security Protocols. - Véronique Cortier; Bogdan Warinschi (ESOP, 2005)

A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. - Véronique Cortier; Michaël Rusinowitch; Eugen Zalinescu (PPDP, 2005)

Computationally sound implementations of equational theories against passive adversaries. - Mathieu Baudet; Véronique Cortier; Steve Kremer (IACR Cryptol. ePrint Arch., 2005)

Tree automata with one memory set constraints and cryptographic protocols. - Hubert Comon; Véronique Cortier (Theor. Comput. Sci., 2005)

Vérifier les protocoles cryptographiques. - Véronique Cortier (Tech. Sci. Informatiques, 2005)

Deciding Key Cycles for Security Protocols. - Véronique Cortier; Eugen Zalinescu (LPAR, 2006)

A note on maximally repeated sub-patterns of a point set. - Véronique Cortier; Xavier Goaoc; Mira Lee; Hyeon-Suk Na (Discret. Math., 2006)

Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. - Véronique Cortier; Heinrich Hördegen; Bogdan Warinschi (ICS@SYNASC, 2006)

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. - Véronique Cortier; Steve Kremer; Ralf Küsters; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2006)

A survey of algebraic properties used in cryptographic protocols. - Véronique Cortier; Stéphanie Delaune; Pascal Lafourcade 001 (J. Comput. Secur., 2006)

Deciding knowledge in security protocols under equational theories. - Martín Abadi; Véronique Cortier (Theor. Comput. Sci., 2006)

A Formal Theory of Key Conjuring. - Véronique Cortier; Stéphanie Delaune; Graham Steel (CSF, 2007)

Synthesizing Secure Protocols. - Véronique Cortier; Bogdan Warinschi; Eugen Zalinescu (ESORICS, 2007)

Combining Algorithms for Deciding Knowledge in Security Protocols. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (FroCoS, 2007)

Safely Composing Security Protocols. - Véronique Cortier; Jérémie Delaitre; Stéphanie Delaune (FSTTCS, 2007)

Deciding Knowledge in Security Protocols for Monoidal Equational Theories. - Véronique Cortier; Stéphanie Delaune (LPAR, 2007)

Automatic Analysis of the Security of XOR-Based Key Management Schemes. - Véronique Cortier; Gavin Keighren; Graham Steel (TACAS, 2007)

A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. - Véronique Cortier; Ralf Küsters; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2007)

Relating two standard notions of secrecy. - Véronique Cortier; Michaël Rusinowitch; Eugen Zalinescu (Log. Methods Comput. Sci., 2007)

Computational soundness of observational equivalence. - Hubert Comon-Lundh; Véronique Cortier (CCS, 2008)

Analyse des protocoles cryptographiques: des modèles symboliques aux modèles calculatoires. (Analysis of cryptographic protocols: from symbolic to computational models). - Véronique Cortier (2009)

A Method for Proving Observational Equivalence. - Véronique Cortier; Stéphanie Delaune (CSF, 2009)

Verification of Security Protocols. - Véronique Cortier (VMCAI, 2009)

Safely composing security protocols. - Véronique Cortier; Stéphanie Delaune (Formal Methods Syst. Des., 2009)

Protocol Composition for Arbitrary Primitives. - Stefan Ciobaca; Véronique Cortier (CSF, 2010)

Deciding security properties for cryptographic protocols. application to key cycles. - Hubert Comon-Lundh; Véronique Cortier; Eugen Zalinescu (ACM Trans. Comput. Log., 2010)

Introduction. - Véronique Cortier; Steve Kremer (Formal Models and Techniques for Analyzing Security Protocols, 2011)

Deciding Security for Protocols with Recursive Tests. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (CADE, 2011)

A composable computational soundness notion. - Véronique Cortier; Bogdan Warinschi (CCS, 2011)

Ballot stuffing in a postal voting system. - Véronique Cortier; Jérémie Detrey; Pierrick Gaudry; Frédéric Sur; Emmanuel Thomé; Mathieu Turuani; Paul Zimmermann (REVOTE, 2011)

How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. - Hubert Comon-Lundh; Véronique Cortier (STACS, 2011)

Secure Composition of Protocols. - Véronique Cortier (TOSCA, 2011)

Deciding knowledge in security protocols under some e-voting theories. - Mouhebeddine Berrima; Narjes Ben Rajeb; Véronique Cortier (RAIRO Theor. Informatics Appl., 2011)

A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. - Véronique Cortier; Steve Kremer; Bogdan Warinschi (J. Autom. Reason., 2011)

Measuring vote privacy, revisited. - David Bernhard; Véronique Cortier; Olivier Pereira; Bogdan Warinschi (CCS, 2012)

Revoke and let live: a secure key revocation api for cryptographic devices. - Véronique Cortier; Graham Steel; Cyrille Wiedling (CCS, 2012)

Analysing Routing Protocols: Four Nodes Topologies Are Sufficient. - Véronique Cortier; Jan Degrieck; Stéphanie Delaune (POST, 2012)

Security proof with dishonest keys. - Hubert Comon-Lundh; Véronique Cortier; Guillaume Scerri (IACR Cryptol. ePrint Arch., 2012)

Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. - Véronique Cortier; Stéphanie Delaune (J. Autom. Reason., 2012)

Tractable Inference Systems: An Extension with a Deducibility Predicate. - Hubert Comon-Lundh; Véronique Cortier; Guillaume Scerri (CADE, 2013)

Lengths May Break Privacy - Or How to Check for Equivalences with Length. - Vincent Cheval; Véronique Cortier; Antoine Plet (CAV, 2013)

Practical Everlasting Privacy. - Myrto Arapinis; Véronique Cortier; Steve Kremer; Mark Ryan 001 (POST, 2013)

Analysis of an Electronic Boardroom Voting System. - Mathilde Arnaud; Véronique Cortier; Cyrille Wiedling (VoteID, 2013)

Distributed ElGamal à la Pedersen: Application to Helios. - Véronique Cortier; David Galindo; Stéphane Glondu; Malika Izabachène (WPES, 2013)

Deduction Soundness: Prove One, Get Five for Free. - Florian Böhl; Véronique Cortier; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2013)

A generic construction for voting correctness at minimum cost - Application to Helios. - Véronique Cortier; David Galindo; Stéphane Glondu; Malika Izabachène (IACR Cryptol. ePrint Arch., 2013)

Attacking and fixing Helios: An analysis of ballot secrecy. - Véronique Cortier; Ben Smyth (J. Comput. Secur., 2013)

Deciding equivalence-based properties using constraint solving. - Vincent Cheval; Véronique Cortier; Stéphanie Delaune (Theor. Comput. Sci., 2013)

YAPA: A Generic Tool for Computing Intruder Knowledge. - Mathieu Baudet; Véronique Cortier; Stéphanie Delaune (ACM Trans. Comput. Log., 2013)

Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (CONCUR, 2014)

Election Verifiability for Helios under Weaker Trust Assumptions. - Véronique Cortier; David Galindo; Stéphane Glondu; Malika Izabachène (ESORICS (2), 2014)

Formal Models and Techniques for Analyzing Security Protocols: A Tutorial. - Véronique Cortier; Steve Kremer (Found. Trends Program. Lang., 2014)

Modeling and verifying ad hoc routing protocols. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (Inf. Comput., 2014)

A generic security API for symmetric key management on cryptographic devices. - Véronique Cortier; Graham Steel (Inf. Comput., 2014)

Decidability of Trace Equivalence for Protocols with Nonces. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (CSF, 2015)

Checking Trace Equivalence: How to Get Rid of Nonces? - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (ESORICS (2), 2015)

Secure Refinements of Communication Channels. - Vincent Cheval; Véronique Cortier; Eric le Morvan (FSTTCS, 2015)

Timing Attacks in Security Protocols: Symbolic Framework and Proof Techniques. - Vincent Cheval; Véronique Cortier (POST, 2015)

SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. - David Bernhard; Véronique Cortier; David Galindo; Olivier Pereira; Bogdan Warinschi (IEEE Symposium on Security and Privacy, 2015)

A comprehensive analysis of game-based ballot privacy definitions. - David Bernhard; Véronique Cortier; David Galindo; Olivier Pereira; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2015)

Type-Based Verification of Electronic Voting Protocols. - Véronique Cortier; Fabienne Eigner; Steve Kremer; Matteo Maffei; Cyrille Wiedling (IACR Cryptol. ePrint Arch., 2015)

BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme. - Véronique Cortier; Georg Fuchsbauer; David Galindo (IACR Cryptol. ePrint Arch., 2015)

Formal verification of e-voting: solutions and challenges. - Véronique Cortier (ACM SIGLOG News, 2015)

From Security Protocols to Pushdown Automata. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (ACM Trans. Comput. Log., 2015)

BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme. - Pyrros Chaidos; Véronique Cortier; Georg Fuchsbauer; David Galindo (CCS, 2016)

Bounding the Number of Agents, for Equivalence Too. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (POST, 2016)

SoK: Verifiability Notions for E-Voting Protocols. - Véronique Cortier; David Galindo; Ralf Küsters; Johannes Müller 001; Tomasz Truderung (IEEE Symposium on Security and Privacy, 2016)

When Are Three Voters Enough for Privacy Properties? - Myrto Arapinis; Véronique Cortier; Steve Kremer (IACR Cryptol. ePrint Arch., 2016)

Adapting Helios for provable ballot privacy. - David Bernhard; Véronique Cortier; Olivier Pereira; Ben Smyth; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2016)

Verifiability Notions for E-Voting Protocols. - Véronique Cortier; David Galindo; Ralf Küsters; Johannes Müller 001; Tomasz Truderung (IACR Cryptol. ePrint Arch., 2016)

Formal Models for Analyzing Security Protocols: Some Lecture Notes. - Véronique Cortier; Steve Kremer (Dependable Software Systems Engineering, 2016)

A Type System for Privacy Properties. - Véronique Cortier; Niklas Grimm; Joseph Lallemand; Matteo Maffei (CCS, 2017)

Secure Composition of PKIs with Public Key Protocols. - Vincent Cheval; Véronique Cortier; Bogdan Warinschi (CSF, 2017)

SAT-Equiv: An Efficient Tool for Equivalence Properties. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (CSF, 2017)

Designing and Proving an EMV-Compliant Payment Protocol for Mobile Devices. - Véronique Cortier; Alicia Filipiak; Jan Florent; Said Gharout; Jacques Traoré (EuroS&P, 2017)

Machine-Checked Proofs of Privacy for Electronic Voting Protocols. - Véronique Cortier; Constantin Catalin Dragan; François Dupressoir; Benedikt Schmidt; Pierre-Yves Strub; Bogdan Warinschi (IEEE Symposium on Security and Privacy, 2017)

Electronic Voting: How Logic Can Help. - Véronique Cortier (CIAA, 2017)

A Type System for Privacy Properties (Technical Report). - Véronique Cortier; Niklas Grimm; Joseph Lallemand; Matteo Maffei (CoRR, 2017)

A formal analysis of the Norwegian E-voting protocol. - Véronique Cortier; Cyrille Wiedling (J. Comput. Secur., 2017)

Voting: You Can't Have Privacy without Individual Verifiability. - Véronique Cortier; Joseph Lallemand (CCS, 2018)

A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif. - Vincent Cheval; Véronique Cortier; Mathieu Turuani (CSF, 2018)

Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. - Véronique Cortier; Constantin Catalin Dragan; François Dupressoir; Bogdan Warinschi (CSF, 2018)

Efficiently Deciding Equivalence for Standard Primitives and Phases. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (ESORICS (1), 2018)

A Formal Analysis of the Neuchatel e-Voting Protocol. - Véronique Cortier; David Galindo; Mathieu Turuani (EuroS&P, 2018)

Equivalence Properties by Typing in Cryptographic Branching Protocols. - Véronique Cortier; Niklas Grimm; Joseph Lallemand; Matteo Maffei (POST, 2018)

Verifiability Analysis of CHVote. - David Bernhard; Véronique Cortier; Pierrick Gaudry; Mathieu Turuani; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2018)

Belenios: A Simple Private and Verifiable Electronic Voting System. - Véronique Cortier; Pierrick Gaudry; Stéphane Glondu (Foundations of Security, Protocols, and Equational Reasoning, 2019)

BeleniosVS: Secrecy and Verifiability Against a Corrupted Voting Device. - Véronique Cortier; Alicia Filipiak; Joseph Lallemand (CSF, 2019)

Verification of Security Protocols (Invited Talk). - Véronique Cortier (CSL, 2020)

Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. - Véronique Cortier; Stéphanie Delaune; Jannik Dreier (ESORICS (2), 2020)

Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. - Véronique Cortier; Joseph Lallemand; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2020)

Typing Messages for Free in Security Protocols. - Rémy Chrétien; Véronique Cortier; Antoine Dallon; Stéphanie Delaune (ACM Trans. Comput. Log., 2020)

How to Explain Security Protocols to Your Children. - Véronique Cortier; Itsaka Rakotonirina (Protocols, Strands, and Logic, 2021)

A toolbox for verifiable tally-hiding e-voting systems. - Véronique Cortier; Pierrick Gaudry; Quentin Yang (IACR Cryptol. ePrint Arch., 2021)

A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. - Véronique Cortier; Stéphanie Delaune; Vaishnavi Sundararajan (J. Autom. Reason., 2021)

Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. - Mikael Bougon; Hervé Chabanne; Véronique Cortier; Alexandre Debant; Emmanuelle Dottax; Jannik Dreier; Pierrick Gaudry; Mathieu Turuani (CCS, 2022)

A small bound on the number of sessions for security protocols. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (CSF, 2022)

ProVerif with Lemmas, Induction, Fast Subsumption, and Much More. - Bruno Blanchet; Vincent Cheval; Véronique Cortier (SP, 2022)

Is the JCJ voting system really coercion-resistant? - Véronique Cortier; Pierrick Gaudry; Quentin Yang (IACR Cryptol. ePrint Arch., 2022)

Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols. - Véronique Cortier; Stéphanie Delaune; Jannik Dreier; Elise Klein 002 (J. Comput. Secur., 2022)

Election Verifiability with ProVerif. - Vincent Cheval; Véronique Cortier; Alexandre Debant (CSF, 2023)

French 2022 legislatives elections. - Véronique Cortier; Pierrick Gaudry; Stéphane Glondu; Sylvain Ruhault (E-Vote-ID (GI), 2023)

Belenios with Cast as Intended. - Véronique Cortier; Alexandre Debant; Pierrick Gaudry; Stéphane Glondu (FC Workshops, 2023)

Code Voting: When Simplicity Meets Security. - Véronique Cortier; Alexandre Debant; Florian Moser (ESORICS (2), 2024)

Belenios with Cast-as-Intended: Towards a Usable Interface. - Véronique Cortier; Pierrick Gaudry; Anselme Goetschmann; Sophie Lemonnier (E-Vote-ID, 2024)

Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility. - Véronique Cortier; Alexandre Debant; Anselme Goetschmann; Lucca Hirschi (IACR Cryptol. ePrint Arch., 2024)

Breaking verifiability and vote privacy in CHVote. - Véronique Cortier; Alexandre Debant; Pierrick Gaudry (IACR Cryptol. ePrint Arch., 2025)

Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. - Véronique Cortier; Alexandre Debant; Pierrick Gaudry; Léo Louistisserand (Proc. Priv. Enhancing Technol., 2025)