Véronique Cortier

157 papers A* 20A 28B 7C 2Journal 54Unranked 37

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Practical and Fully Distributed E-Voting Protocol for the Swiss Context. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Olivier Esseiva, Pierrick Gaudry, Audhild Høgåsen, Chiara Spadafora
2025	J	`jnl`	Are ideal functionalities really ideal? IACR Cryptol. ePrint Arch. Myrto Arapinis, Véronique Cortier, Hubert de Groote, Charlie Jacomme, Steve Kremer
2025	—	`conf`	Breaking Verifiability and Vote Privacy in CHVote. ESORICS (4) Véronique Cortier, Alexandre Debant, Pierrick Gaudry
2025	J	`jnl`	Breaking verifiability and vote privacy in CHVote. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Pierrick Gaudry
2025	A*	`ed.`	Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, CCS 2025, Taipei, Taiwan, October 13-17, 2025 CCS Chun-Ying Huang, Jyh-Cheng Chen, Shiuh-Pyng Shieh, David Lie, Véronique Cortier
2025	J	`jnl`	Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. Proc. Priv. Enhancing Technol. Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Léo Louistisserand
2024	—	`conf`	Belenios with Cast-as-Intended: Towards a Usable Interface. E-Vote-ID Véronique Cortier, Pierrick Gaudry, Anselme Goetschmann, Sophie Lemonnier
2024	—	`conf`	Code Voting: When Simplicity Meets Security. ESORICS (2) Véronique Cortier, Alexandre Debant, Florian Moser
2024	A*	`conf`	Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility. USENIX Security Symposium Véronique Cortier, Alexandre Debant, Anselme Goetschmann, Lucca Hirschi
2024	J	`jnl`	Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Anselme Goetschmann, Lucca Hirschi
2024	A	`conf`	Is the JCJ voting system really coercion-resistant? CSF Véronique Cortier, Pierrick Gaudry, Quentin Yang
2024	J	`jnl`	Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Léo Louistisserand
2023	—	`conf`	Belenios with Cast as Intended. FC Workshops Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Stéphane Glondu
2023	A	`conf`	Election Verifiability with ProVerif. CSF Vincent Cheval, Véronique Cortier, Alexandre Debant
2023	—	`conf`	French 2022 legislatives elections. E-Vote-ID (GI) Véronique Cortier, Pierrick Gaudry, Stéphane Glondu, Sylvain Ruhault
2022	—	`conf`	A Toolbox for Verifiable Tally-Hiding E-Voting Systems. ESORICS (2) Véronique Cortier, Pierrick Gaudry, Quentin Yang
2022	A	`conf`	A small bound on the number of sessions for security protocols. CSF Véronique Cortier, Antoine Dallon, Stéphanie Delaune
2022	J	`jnl`	Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols. J. Comput. Secur. Véronique Cortier, Stéphanie Delaune, Jannik Dreier, Elise Klein
2022	J	`jnl`	Is the JCJ voting system really coercion-resistant? IACR Cryptol. ePrint Arch. Véronique Cortier, Pierrick Gaudry, Quentin Yang
2022	A*	`conf`	ProVerif with Lemmas, Induction, Fast Subsumption, and Much More. SP Bruno Blanchet, Vincent Cheval, Véronique Cortier
2022	A*	`conf`	Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. CCS Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani
2021	J	`jnl`	A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. J. Autom. Reason. Véronique Cortier, Stéphanie Delaune, Vaishnavi Sundararajan
2021	J	`jnl`	A toolbox for verifiable tally-hiding e-voting systems. IACR Cryptol. ePrint Arch. Véronique Cortier, Pierrick Gaudry, Quentin Yang
2021	—	`conf`	How to Explain Security Protocols to Your Children. Protocols, Strands, and Logic Véronique Cortier, Itsaka Rakotonirina
2020	—	`conf`	Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. ESORICS (2) Véronique Cortier, Stéphanie Delaune, Jannik Dreier
2020	A	`conf`	Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. CSF Véronique Cortier, Joseph Lallemand, Bogdan Warinschi
2020	J	`jnl`	Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. IACR Cryptol. ePrint Arch. Véronique Cortier, Joseph Lallemand, Bogdan Warinschi
2020	J	`jnl`	Typing Messages for Free in Security Protocols. ACM Trans. Comput. Log. Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune
2020	B	`conf`	Verification of Security Protocols (Invited Talk). CSL Véronique Cortier
2019	—	`conf`	Belenios: A Simple Private and Verifiable Electronic Voting System. Foundations of Security, Protocols, and Equational Reasoning Véronique Cortier, Pierrick Gaudry, Stéphane Glondu
2019	A	`conf`	BeleniosVS: Secrecy and Verifiability Against a Corrupted Voting Device. CSF Véronique Cortier, Alicia Filipiak, Joseph Lallemand
2019	—	`ed.`	Electronic Voting - 4th International Joint Conference, E-Vote-ID 2019, Bregenz, Austria, October 1-4, 2019, Proceedings E-Vote-ID Robert Krimmer, Melanie Volkamer, Véronique Cortier, Bernhard Beckert, Ralf Küsters, Uwe Serdült, David Duenas-Cid
2018	A	`conf`	A Formal Analysis of the Neuchatel e-Voting Protocol. EuroS&P Véronique Cortier, David Galindo, Mathieu Turuani
2018	A	`conf`	A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif. CSF Vincent Cheval, Véronique Cortier, Mathieu Turuani
2018	—	`conf`	Efficiently Deciding Equivalence for Standard Primitives and Phases. ESORICS (1) Véronique Cortier, Antoine Dallon, Stéphanie Delaune
2018	—	`ed.`	Electronic Voting - Third International Joint Conference, E-Vote-ID 2018, Bregenz, Austria, October 2-5, 2018, Proceedings E-Vote-ID Robert Krimmer, Melanie Volkamer, Véronique Cortier, Rajeev Goré, Manik Hapsara, Uwe Serdült, David Duenas-Cid
2018	—	`conf`	Equivalence Properties by Typing in Cryptographic Branching Protocols. POST Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei
2018	A	`conf`	Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. CSF Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Bogdan Warinschi
2018	J	`jnl`	Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi
2018	A*	`conf`	Voting: You Can't Have Privacy without Individual Verifiability. CCS Véronique Cortier, Joseph Lallemand
2017	J	`jnl`	A Type System for Privacy Properties (Technical Report). CoRR Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei
2017	A*	`conf`	A Type System for Privacy Properties. CCS Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei
2017	J	`jnl`	A formal analysis of the Norwegian E-voting protocol. J. Comput. Secur. Véronique Cortier, Cyrille Wiedling
2017	A	`conf`	Designing and Proving an EMV-Compliant Payment Protocol for Mobile Devices. EuroS&P Véronique Cortier, Alicia Filipiak, Jan Florent, Said Gharout, Jacques Traoré
2017	C	`conf`	Electronic Voting: How Logic Can Help. CIAA Véronique Cortier
2017	A*	`conf`	Machine-Checked Proofs of Privacy for Electronic Voting Protocols. IEEE Symposium on Security and Privacy Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Benedikt Schmidt, Pierre-Yves Strub, Bogdan Warinschi
2017	A	`conf`	SAT-Equiv: An Efficient Tool for Equivalence Properties. CSF Véronique Cortier, Antoine Dallon, Stéphanie Delaune
2017	A	`conf`	Secure Composition of PKIs with Public Key Protocols. CSF Vincent Cheval, Véronique Cortier, Bogdan Warinschi
2016	J	`jnl`	Adapting Helios for provable ballot privacy. IACR Cryptol. ePrint Arch. David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi
2016	A*	`conf`	BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme. CCS Pyrros Chaidos, Véronique Cortier, Georg Fuchsbauer, David Galindo
2016	—	`conf`	Bounding the Number of Agents, for Equivalence Too. POST Véronique Cortier, Antoine Dallon, Stéphanie Delaune
2016	—	`ch.`	Formal Models for Analyzing Security Protocols: Some Lecture Notes. Dependable Software Systems Engineering Véronique Cortier, Steve Kremer
2016	A*	`conf`	SoK: Verifiability Notions for E-Voting Protocols. IEEE Symposium on Security and Privacy Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung
2016	J	`jnl`	Verifiability Notions for E-Voting Protocols. IACR Cryptol. ePrint Arch. Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung
2016	—	`conf`	When Are Three Voters Enough for Privacy Properties? ESORICS (2) Myrto Arapinis, Véronique Cortier, Steve Kremer
2016	J	`jnl`	When Are Three Voters Enough for Privacy Properties? IACR Cryptol. ePrint Arch. Myrto Arapinis, Véronique Cortier, Steve Kremer
2015	J	`jnl`	A comprehensive analysis of game-based ballot privacy definitions. IACR Cryptol. ePrint Arch. David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi
2015	J	`jnl`	BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme. IACR Cryptol. ePrint Arch. Véronique Cortier, Georg Fuchsbauer, David Galindo
2015	—	`conf`	Checking Trace Equivalence: How to Get Rid of Nonces? ESORICS (2) Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2015	A	`conf`	Decidability of Trace Equivalence for Protocols with Nonces. CSF Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2015	J	`jnl`	Formal verification of e-voting: solutions and challenges. ACM SIGLOG News Véronique Cortier
2015	J	`jnl`	From Security Protocols to Pushdown Automata. ACM Trans. Comput. Log. Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2015	—	`conf`	Secure Refinements of Communication Channels. FSTTCS Vincent Cheval, Véronique Cortier, Eric le Morvan
2015	A*	`conf`	SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. IEEE Symposium on Security and Privacy David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi
2015	—	`conf`	Timing Attacks in Security Protocols: Symbolic Framework and Proof Techniques. POST Vincent Cheval, Véronique Cortier
2015	—	`conf`	Type-Based Verification of Electronic Voting Protocols. POST Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, Cyrille Wiedling
2015	J	`jnl`	Type-Based Verification of Electronic Voting Protocols. IACR Cryptol. ePrint Arch. Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, Cyrille Wiedling
2014	J	`jnl`	A generic security API for symmetric key management on cryptographic devices. Inf. Comput. Véronique Cortier, Graham Steel
2014	—	`conf`	Election Verifiability for Helios under Weaker Trust Assumptions. ESORICS (2) Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène
2014	A	`conf`	Electronic Voting: How Logic Can Help. IJCAR Véronique Cortier
2014	J	`jnl`	Formal Models and Techniques for Analyzing Security Protocols: A Tutorial. Found. Trends Program. Lang. Véronique Cortier, Steve Kremer
2014	J	`jnl`	Modeling and verifying ad hoc routing protocols. Inf. Comput. Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
2014	—	`ed.`	Proceedings of the Formal Methods for Security Workshop co-located with the PetriNets-2014 Conference , Tunis, Tunisia, June 23rd, 2014. FMS @ Petri Nets Véronique Cortier, Riadh Robbana
2014	B	`conf`	Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. CONCUR Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2013	J	`jnl`	A generic construction for voting correctness at minimum cost - Application to Helios. IACR Cryptol. ePrint Arch. Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène
2013	—	`conf`	Analysis of an Electronic Boardroom Voting System. VoteID Mathilde Arnaud, Véronique Cortier, Cyrille Wiedling
2013	J	`jnl`	Attacking and fixing Helios: An analysis of ballot secrecy. J. Comput. Secur. Véronique Cortier, Ben Smyth
2013	J	`jnl`	Deciding equivalence-based properties using constraint solving. Theor. Comput. Sci. Vincent Cheval, Véronique Cortier, Stéphanie Delaune
2013	J	`jnl`	Deduction Soundness: Prove One, Get Five for Free. IACR Cryptol. ePrint Arch. Florian Böhl, Véronique Cortier, Bogdan Warinschi
2013	A*	`conf`	Deduction soundness: prove one, get five for free. CCS Florian Böhl, Véronique Cortier, Bogdan Warinschi
2013	—	`conf`	Distributed ElGamal à la Pedersen: Application to Helios. WPES Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène
2013	—	`conf`	From Security Protocols to Pushdown Automata. ICALP (2) Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2013	A*	`conf`	Lengths May Break Privacy - Or How to Check for Equivalences with Length. CAV Vincent Cheval, Véronique Cortier, Antoine Plet
2013	—	`conf`	Practical Everlasting Privacy. POST Myrto Arapinis, Véronique Cortier, Steve Kremer, Mark Ryan
2013	A	`conf`	Tractable Inference Systems: An Extension with a Deducibility Predicate. CADE Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
2013	J	`jnl`	YAPA: A Generic Tool for Computing Intruder Knowledge. ACM Trans. Comput. Log. Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
2012	—	`conf`	A Formal Analysis of the Norwegian E-voting Protocol. POST Véronique Cortier, Cyrille Wiedling
2012	—	`conf`	Analysing Routing Protocols: Four Nodes Topologies Are Sufficient. POST Véronique Cortier, Jan Degrieck, Stéphanie Delaune
2012	J	`jnl`	Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. J. Autom. Reason. Véronique Cortier, Stéphanie Delaune
2012	A*	`conf`	Measuring vote privacy, revisited. CCS David Bernhard, Véronique Cortier, Olivier Pereira, Bogdan Warinschi
2012	A*	`conf`	Revoke and let live: a secure key revocation api for cryptographic devices. CCS Véronique Cortier, Graham Steel, Cyrille Wiedling
2012	—	`conf`	Security Proof with Dishonest Keys. POST Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
2012	J	`jnl`	Security proof with dishonest keys. IACR Cryptol. ePrint Arch. Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
2011	J	`jnl`	A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. J. Autom. Reason. Véronique Cortier, Steve Kremer, Bogdan Warinschi
2011	A*	`conf`	A composable computational soundness notion. CCS Véronique Cortier, Bogdan Warinschi
2011	A	`conf`	Adapting Helios for Provable Ballot Privacy. ESORICS David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi
2011	A	`conf`	Attacking and Fixing Helios: An Analysis of Ballot Secrecy. CSF Véronique Cortier, Ben Smyth
2011	—	`conf`	Ballot stuffing in a postal voting system. REVOTE Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann
2011	A	`conf`	Deciding Security for Protocols with Recursive Tests. CADE Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
2011	J	`jnl`	Deciding knowledge in security protocols under some e-voting theories. RAIRO Theor. Informatics Appl. Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier
2011	—	`book`	Formal Models and Techniques for Analyzing Security Protocols Véronique Cortier, Steve Kremer
2011	A	`conf`	How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. STACS Hubert Comon-Lundh, Véronique Cortier
2011	—	`ch.`	Introduction. Formal Models and Techniques for Analyzing Security Protocols Véronique Cortier, Steve Kremer
2011	—	`conf`	Secure Composition of Protocols. TOSCA Véronique Cortier
2010	J	`jnl`	Attacking and fixing Helios: An analysis of ballot secrecy. IACR Cryptol. ePrint Arch. Véronique Cortier, Ben Smyth
2010	J	`jnl`	Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Log. Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
2010	A	`conf`	Modeling and Verifying Ad Hoc Routing Protocols. CSF Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
2010	—	`ed.`	Proceedings 8th International Workshop on Security Issues in Concurrency, SecCo 2010, Paris, France, 30th August 2010. SecCo Konstantinos Chatzikokolakis, Véronique Cortier
2010	A	`conf`	Protocol Composition for Arbitrary Primitives. CSF Stefan Ciobaca, Véronique Cortier
2010	—	`conf`	Verification of Security Protocols. VERIFY@IJCAR Véronique Cortier
2010	J	`jnl`	YAPA: A generic tool for computing intruder knowledge CoRR Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
2009	A	`conf`	A Generic Security API for Symmetric Key Management on Cryptographic Devices. ESORICS Véronique Cortier, Graham Steel
2009	A	`conf`	A Method for Proving Observational Equivalence. CSF Véronique Cortier, Stéphanie Delaune
2009	—	`book`	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	J	`jnl`	Computationally sound implementations of equational theories against passive adversaries. Inf. Comput. Mathieu Baudet, Véronique Cortier, Steve Kremer
2009	—	`ed.`	Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration Formal to Practical Security Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada
2009	J	`jnl`	Safely composing security protocols. Formal Methods Syst. Des. Véronique Cortier, Stéphanie Delaune
2009	B	`conf`	Verification of Security Protocols. VMCAI Véronique Cortier
2009	—	`conf`	YAPA: A Generic Tool for Computing Intruder Knowledge. RTA Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
2008	A*	`conf`	Computational soundness of observational equivalence. CCS Hubert Comon-Lundh, Véronique Cortier
2007	A	`conf`	A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. ESORICS Véronique Cortier, Ralf Küsters, Bogdan Warinschi
2007	J	`jnl`	A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. IACR Cryptol. ePrint Arch. Véronique Cortier, Ralf Küsters, Bogdan Warinschi
2007	A	`conf`	A Formal Theory of Key Conjuring. CSF Véronique Cortier, Stéphanie Delaune, Graham Steel
2007	A	`conf`	Automatic Analysis of the Security of XOR-Based Key Management Schemes. TACAS Véronique Cortier, Gavin Keighren, Graham Steel
2007	—	`conf`	Combining Algorithms for Deciding Knowledge in Security Protocols. FroCoS Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
2007	B	`conf`	Deciding Knowledge in Security Protocols for Monoidal Equational Theories. LPAR Véronique Cortier, Stéphanie Delaune
2007	J	`jnl`	Deciding security properties for cryptographic protocols. Application to key cycles CoRR Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
2007	J	`jnl`	Relating two standard notions of secrecy CoRR Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
2007	J	`jnl`	Relating two standard notions of secrecy. Log. Methods Comput. Sci. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
2007	—	`conf`	Safely Composing Security Protocols. FSTTCS Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune
2007	A	`conf`	Synthesizing Secure Protocols. ESORICS Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu
2006	J	`jnl`	A note on maximally repeated sub-patterns of a point set. Discret. Math. Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na
2006	J	`jnl`	A survey of algebraic properties used in cryptographic protocols. J. Comput. Secur. Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade
2006	—	`conf`	Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
2006	J	`jnl`	Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. IACR Cryptol. ePrint Arch. Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
2006	B	`conf`	Deciding Key Cycles for Security Protocols. LPAR Véronique Cortier, Eugen Zalinescu
2006	J	`jnl`	Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci. Martín Abadi, Véronique Cortier
2006	J	`jnl`	Explicit Randomness is not Necessary when Modeling Probabilistic Encryption CoRR Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
2006	—	`conf`	Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. ICS@SYNASC Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
2006	B	`conf`	Relating Two Standard Notions of Secrecy. CSL Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
2006	—	`conf`	Relating two standard notions of secrecy. Trustworthy Software Eugen Zalinescu, Véronique Cortier, Michaël Rusinowitch
2005	C	`conf`	A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. PPDP Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
2005	A*	`conf`	Computationally Sound Implementations of Equational Theories Against Passive Adversaries. ICALP Mathieu Baudet, Véronique Cortier, Steve Kremer
2005	A	`conf`	Computationally Sound, Automated Proofs for Security Protocols. ESOP Véronique Cortier, Bogdan Warinschi
2005	J	`jnl`	Computationally sound implementations of equational theories against passive adversaries. IACR Cryptol. ePrint Arch. Mathieu Baudet, Véronique Cortier, Steve Kremer
2005	—	`conf`	Deciding Knowledge in Security Protocols under (Many More) Equational Theories. CSFW Martín Abadi, Véronique Cortier
2005	J	`jnl`	Tree automata with one memory set constraints and cryptographic protocols. Theor. Comput. Sci. Hubert Comon, Véronique Cortier
2005	J	`jnl`	Vérifier les protocoles cryptographiques. Tech. Sci. Informatiques Véronique Cortier
2004	A*	`conf`	Deciding Knowledge in Security Protocols Under Equational Theories. ICALP Martín Abadi, Véronique Cortier
2004	J	`jnl`	Security properties: two agents are sufficient. Sci. Comput. Program. Hubert Comon-Lundh, Véronique Cortier
2003	—	`conf`	New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. RTA Hubert Comon-Lundh, Véronique Cortier
2003	A	`conf`	Security Properties: Two Agents Are Sufficient. ESOP Hubert Comon-Lundh, Véronique Cortier
2002	J	`jnl`	About the decision of reachability for register machines. RAIRO Theor. Informatics Appl. Véronique Cortier
2001	—	`conf`	Proving Secrecy is Easy Enough. CSFW Véronique Cortier, Jonathan K. Millen, Harald Rueß
2001	A*	`conf`	Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. ICALP Hubert Comon, Véronique Cortier, John Mitchell
2000	B	`conf`	Flatness Is Not a Weakness. CSL Hubert Comon, Véronique Cortier
1999	A*	`conf`	Decidable Fragments of Simultaneous Rigid Reachability. ICALP Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes