Publications

by type | by year

Edited Books and Proceedings

  • Formal Models and Techniques for Analyzing Security Protocols. Véronique Cortier and Steve Kremer, editors. Cryptology and Information Security Series 5, IOS Press, 2011.
    Details     BibTeX     Download: [DOI] 
  • Formal to practical Security. Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, and Hideki Sakurada, editors. Lecture Notes in Computer Science 5458, Springer, 2009.
    Details     BibTeX     Download: [DOI] 

Journals

  • A formal analysis of the Norwegian E-voting protocol. Véronique Cortier and Cyrille Wiedling. Journal of Computer Security, 25(15777):21–57, 2017.
    Details     BibTeX     Download: [pdf] [DOI] 
  • From security protocols to pushdown automata. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. ACM Transactions on Computational Logic, 17(3), November 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Formal verification of E-voting: solutions and challenges. Véronique Cortier. 3rd SigLog Newsletter, ACM Special Interest Group on Logic and Computation, 2(1):25–34, January 2015.
    Details     BibTeX     Download: [DOI] 
  • Modeling and Verifying Ad Hoc Routing Protocols. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. Information and Computation, 238(0):30–67, Elsevier Science Publishers, 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Formal Models and Techniques for Analyzing Security Protocols: A Tutorial. Véronique Cortier and Steve Kremer. Foundations and Trends in Programming Languages, 1(3):151–267, 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Generic Security API for Symmetric Key Management on Cryptographic Devices. Véronique Cortier and Graham Steel. Information and Computation, 238:208–232, Elsevier Science Publishers, 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • YAPA: A generic tool for computing intruder knowledge. Mathieu Baudet, Véronique Cortier, and Stéphanie Delaune. ACM Transactions on Computational Logic, 14, ACM Press, 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding equivalence-based properties using constraint solving. Vincent Cheval, Véronique Cortier, and Stéphanie Delaune. Theoretical Computer Science, 492:1–39, Elsevier, 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Attacking and fixing Helios: An analysis of ballot secrecy. Véronique Cortier and Ben Smyth. Journal of Computer Security, 21(1):89–148, IOS Press, 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Decidability and combination results for two notions of knowledge in security protocols. Véronique Cortier and Stéphanie Delaune. Journal of Automated Reasoning, 48, Springer, 2012.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding knowledge in security protocols under some e-voting theories. Mouhebeddine Berrima, Narjes Ben Rajeb, and Véronique Cortier. Theoretical Informatics and Applications (RAIRO-ITA), 45:269–299, EDP Sciences, 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding security properties for cryptographic protocols. Application to key cycles. Hubert Comon-Lundh, Véronique Cortier, and Eugen Zălinescu. ACM Transactions on Computational Logic, 11(2), ACM Press, January 2010.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. Véronique Cortier, Steve Kremer, and Bogdan Warinschi. Journal of Automated Reasoning, 46(3-4):225–259, Springer, April 2010.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Computationally Sound Implementations of Equational Theories against Passive Adversaries. Mathieu Baudet, Véronique Cortier, and Steve Kremer. Information and Computation, 207(4):496–520, Elsevier Science Publishers, April 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Safely Composing Security Protocols. Véronique Cortier and Stéphanie Delaune. Formal Methods in System Design, 34(1):1–36, Kluwer Academic Publishers, February 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Relating two standard notions of secrecy. Véronique Cortier, Michael Rusinowitch, and Eugen Zalinescu. Logical Methods in Computer Science, 3(3), July 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding knowledge in security protocols under equational theories. Martin Abadi and Véronique Cortier. Theoretical Computer Science, 387(1-2):2–32, November 2006. Top cited article 2005-2010 TCS paper award.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A note on maximally repeated sub-patterns of a point set. Véronique Cortier, Xavier Goaoc, Mira Lee, and Hyeon-Suk Na. Discrete Mathematics, 306(16):1965–1968, August 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Survey of Algebraic Properties Used in Cryptographic Protocols. Véronique Cortier, Stéphanie Delaune, and Pascal Lafourcade. Journal of Computer Security, 14(1):1–43, IOS Press, 2006.
    Details     BibTeX     Download: [pdf] [ps] 
  • Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Hubert Comon and Véronique Cortier. Theoretical Computer Science, 331(1):143–214, Elsevier Science Publishers, February 2005.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Security Properties: Two Agents are Sufficient. Hubert Comon-Lundh and Véronique Cortier. Science of Computer Programming, 50(1-3):51–71, Elsevier Science Publishers, March 2004.
    Details     BibTeX     Download: [pdf] [ps] 
  • About the Decision of Reachability for Register Machines. Véronique Cortier. Theoretical Informatics and Applications, 36(4):341–358, Oct. - Dec. 2002.
    Details     BibTeX     Download: [pdf] [ps] 

National Journals

  • Vérifier les protocoles cryptographiques. Véronique Cortier. Technique et Science Informatique, Hermes Science, 24(1):115–140, 2005.
    Details     BibTeX     Download: [pdf] [ps] 

Scientific popularization (in French)

  • Vote électronique. Véronique Cortier. In 1024 -- Bulletin de la société informatique de France, number 9 in November 2016.
    Details     BibTeX     Download: [pdf] 
  • Vote électronique : un scrutin à sécuriser. Véronique Cortier. La Recherche, 504:70–73, October 2015.
    Details     BibTeX     Download: [DOI] 
  • Attaque à l'italienne. Véronique Cortier. In Blog Binaire, Le Monde, August 2015.
    Details     BibTeX     Download: [DOI] 
  • Les bonnes propriétés d'un système de vote électronique - exemple d'Helios. Véronique Cortier and Steve Kremer. In Blog Binaire, Le Monde, March 2015.
    Details     BibTeX     Download: [DOI] 
  • Le vote papier est-il réellement plus sûr que l'électronique ?. Véronique Cortier. In Blog Binaire, Le Monde, January 2015.
    Details     BibTeX     Download: [DOI] 
  • Qu'est-ce qu'un bon système de vote ?. Véronique Cortier. In Blog Binaire, Le Monde, January 2015.
    Details     BibTeX     Download: [DOI] 
  • Vote par Internet. Véronique Cortier and Steve Kremer. In Interstices, January 2013.
    Details     BibTeX     Download: [DOI] 
  • Ces protocoles qui nous protègent. Véronique Cortier. Tangente, Hors-série 26:42–44, July 2006.
    Details     BibTeX     Download: (unavailable)
  • Divers protocoles couramment utilisés en informatique. Véronique Cortier. Tangente, Hors-série 26:45, July 2006.
    Details     BibTeX     Download: (unavailable)
  • Protocoles cryptographiques : analyse par méthodes formelles. Véronique Cortier. In Techniques de l'ingénieur, April 2006.
    Details     BibTeX     Download: (unavailable)
  • Cryptographie et codes secrets. Véronique Cortier. pp. 106–113, Bibliothèque Tangente, 2006. Hors-série 26.
    Details     BibTeX     Download: (unavailable)
  • Sur les chemins de la découverte. Véronique Cortier. pp. 107–118, Presses Universitaires de France, January 2006.
    Details     BibTeX     Download: (unavailable)

Conferences

  • Secure composition of PKIs with public key protocols. Vincent Cheval, Véronique Cortier, and Bogdan Warinschi. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), IEEE Computer Society Press, August 2017.
    Details     BibTeX     Download: (unavailable)
  • SAT-Equiv: an efficient tool for equivalence properties. Véronique Cortier, Stéphanie Delaune, and Antoine Dallon. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), IEEE Computer Society Press, August 2017.
    Details     BibTeX     Download: (unavailable)
  • Machine-Checked Proofs of Privacy for Electronic Voting Protocols. Véronique Cortier, Benedikt Schmidt, Constantin Catalin Dragan, Pierre-Yves Strub, Francois Dupressoir, and Bogdan Warinschi. In Proceedings of the 37th IEEE Symposium on Security and Privacy (S&P'17), IEEE Computer Society Press, 2017. To appear.
    Details     BibTeX     Download: [pdf] 
  • Designing and proving an EMV-compliant payment protocol for mobile devices. Véronique Cortier, Alicia Filipiak, Jan Florent, Said Gharout, and Jacques Traoré. In 2nd IEEE European Symposium on Security and Privacy (EuroSP'17), 2017. To appear.
    Details     BibTeX     Download: [pdf] 
  • When are three voters enough for privacy properties?. Myrto Arapinis, Véronique Cortier, and Steve Kremer. In Proceedings of the 21st European Symposium on Research in Computer Security (ESORICS'16), pp. 241–260, Lecture Notes in Computer Science, Springer, Heraklion, Crete, September 2016.
    Details     BibTeX     Download: [pdf] [DOI] 
  • BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme. Pyrros Chaidos, Véronique Cortier, Georg Fuschbauer, and David Galido. In 23rd ACM Conference on Computer and Communications Security (CCS'16), ACM, Vienna, Austria, October 2016. To appear.
    Details     BibTeX     Download: [pdf] [DOI] 
  • SoK: Verifiability Notions for E-Voting Protocols. Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, and Tomasz Truderung. In Proceedings of the 36th IEEE Symposium on Security and Privacy (S&P'16), IEEE Computer Society Press, San Jose, CA, USA, May 2016.
    Details     BibTeX     Download: [pdf] [long version] [DOI] 
  • Bounding the number of agents, for equivalence too. Véronique Cortier, Antoine Dallon, and Stéphanie Delaune. In Proceedings of the 5th International Conference on Principles of Security and Trust (POST'16), pp. 211–232, Lecture Notes in Computer Science 9635, Springer, Eindhoven, The Netherlands, April 2016. EASST best paper award of the ETAPS conference.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A comprehensive analysis of game-based ballot privacy definitions. David Bernhard, Veronique Cortier, David Galindo, Olivier Pereira, and Bogdan Warinschi. In Proceedings of the 36th IEEE Symposium on Security and Privacy (S&P'15), pp. 499–516, IEEE Computer Society Press, San Jose, CA, USA, May 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Secure Refinements of Communication Channels. Vincent Cheval, Véronique Cortier, and Eric le Morvan. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), pp. 575–589, Leibniz International Proceedings in Informatics (LIPIcs) 45, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Timing attacks in security protocols: symbolic framework and proof techniques. Vincent Cheval and Véronique Cortier. In Proceedings of the 4th Conference on Principles of Security and Trust (POST'15), pp. 280–299, Lecture Notes in Computer Science 9036, Springer, London, UK, April 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Decidability of trace equivalence for protocols with nonces. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 28th IEEE Computer Security Foundations Symposium (CSF'15), IEEE Computer Society Press, July 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Checking trace equivalence: How to get rid of nonces?. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS'15), Lecture Notes in Computer Science, Springer, Vienna, Austria, 2015.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Type-Based Verification of Electronic Voting Protocols. Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, and Cyrille Wiedling. In Proceedings of the 4th Conference on Principles of Security and Trust (POST'15), pp. 303–323, Lecture Notes in Computer Science 9036, Springer, London, UK, April 2015.
    Details     BibTeX     Download: [pdf] [long version] [DOI] 
  • Typing messages for free in security protocols: the case of equivalence properties. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pp. 372–386, Lecture Notes in Computer Science 8704, Springer, Rome, Italy, September 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Election Verifiability for Helios under Weaker Trust Assumptions. Véronique Cortier, David Galindo, Stéphane Glondu, and Malika Izabachene. In Proceedings of the 19th European Symposium on Research in Computer Security (ESORICS'14), pp. 327–344, LNCS 8713, Springer, Wroclaw, Poland, September 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Electronic Voting: How Logic Can Help. Véronique Cortier. In Proceegings of the 12th International Joint Conference on Automated Reasoning (IJCAR 2014), pp. 16–26, LNAI 8562, Vienna, Austria, 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Practical Everlasting Privacy. Myrto Arapinis, Véronique Cortier, Steve Kremer, and Mark D. Ryan. In Proceedings of the 2nd Conferences on Principles of Security and Trust (POST'13), pp. 21–40, Lecture Notes in Computer Science 7796, Springer, Rome, Italy, March 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Analysis of an Electronic Boardroom Voting System. Mathilde Arnaud, Véronique Cortier, and Cyrille Wiedling. In 4th International Conference on e-Voting and Identity (VoteID'13), Lecture Notes in Computer Science 7985, Springer, Surrey, UK, July 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deduction Soundness: Prove One, Get Five for Free. Florian Böhl, Véronique Cortier, and Bogdan Warinschi. In 20th ACM Conference on Computer and Communications Security (CCS'13), Berlin, Germany, 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Lengths may break privacy -- or how to check for equivalences with length. Vincent Cheval, Véronique Cortier, and Antoine Plet. In Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), pp. 708–723, Lecture Notes in Computer Science 8043, Springer, St Petersburg, Russia, July 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • From security protocols to pushdown automata. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13), pp. 137–149, Lecture Notes in Computer Science 7966, Springer, Riga, Lituania, July 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Tractable inference systems: an extension with a deducibility predicate. Hubert Comon-Lundh, Véronique Cortier, and Guillaume Scerri. In Proceedings of the 25th International Conference on Automated Deduction (CADE'13), pp. 91–108, Lecture Notes in Computer Science 7898, Springer, Lake Placid, USA, June 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Distributed ElGamal à la Pedersen - Application to Helios. Véronique Cortier, David Galindo, Stéphane Glondu, and Malika Izabachene. In Workshop on Privacy in the Electronic Society (WPES 2013), Berlin, Germany, 2013.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Measuring Vote Privacy, Revisited. David Bernhard, Véronique Cortier, Olivier Pereira, and Bogdan Warinschi. In 19th ACM Conference on Computer and Communications Security (CCS'12), pp. 941–952, ACM, Raleigh, USA, October 2012.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Security proof with dishonest keys. Hubert Comon-Lundh, Véronique Cortier, and Guillaume Scerri. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), pp. 149–168, Lecture Notes in Computer Science 7215, Springer, Tallinn, Estonia, March 2012.
    Details     BibTeX     Download: [pdf] [long version] [DOI] 
  • Revoke and Let Live: A Secure Key Revocation API for Cryptographic Devices. Véronique Cortier, Graham Steel, and Cyrille Wiedling. In 19th ACM Conference on Computer and Communications Security (CCS'12), pp. 918–928, ACM, Raleigh, USA, October 2012.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A formal analysis of the Norwegian E-voting protocol. Véronique Cortier and Cyrille Wiedling. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), pp. 109–128, Lecture Notes in Computer Science 7215, Springer, Tallinn, Estonia, March 2012.
    Details     BibTeX     Download: [pdf] [long version] [DOI] 
  • Analysing routing protocols: four nodes topologies are sufficient. Véronique Cortier, Jan Degrieck, and Stéphanie Delaune. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), pp. 30–50, Lecture Notes in Computer Science 7215, Springer, Tallinn, Estonia, March 2012.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding security for protocols with recursive tests. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 23rd International Conference on Automated Deduction (CADE'11), pp. 49–63, Lecture Notes in Artificial Intelligence, Springer, Wrocław, Poland, July 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Adapting Helios for provable ballot secrecy. David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, and Bogdan Warinschi. In Proceedings of the 16th European Symposium on Research in Computer Security (ESORICS'11), Lecture Notes in Computer Science 6879, 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. Hubert Comon-Lundh and Véronique Cortier. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), pp. 29–44, Leibniz International Proceedings in Informatics 9, Leibniz-Zentrum für Informatik, Dortmund, Germany, March 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Composable Computational Soundness Notion. Véronique Cortier and Bogdan Warinschi. In 18th ACM Conference on Computer and Communications Security (CCS'11), pp. 63–74, ACM, Chicago, USA, October 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Attacking and fixing Helios: An analysis of ballot secrecy. Véronique Cortier and Ben Smyth. In Proceedings of the 24th IEEE Computer Security Foundations Symposium (CSF'11), IEEE Computer Society Press, June 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Modeling and Verifying Ad Hoc Routing Protocols. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), pp. 59–74, IEEE Computer Society Press, Edinburgh, Scotland, UK, July 2010.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Protocol composition for arbitrary primitives. Ștefan Ciobâcă and Véronique Cortier. In Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), pp. 322–336, IEEE Computer Society Press, Edinburgh, Scotland, UK, July 2010. Erratum.
    Details     BibTeX     Download: [pdf] [DOI] 
  • YAPA: A generic tool for computing intruder knowledge. Mathieu Baudet, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), pp. 148–163, Lecture Notes in Computer Science 5595, Springer, Brasília, Brazil, Jun. - Jul. 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A generic security API for symmetric key management on cryptographic devices. Véronique Cortier and Graham Steel. In Proceedings of the 14th European Symposium on Research in Computer Security (ESORICS'09), pp. 605–620, Lecture Notes in Computer Science 5789, Springer, Saint Malo, France, September 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A method for proving observational equivalence. Véronique Cortier and Stéphanie Delaune. In Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF'09), pp. 266–276, IEEE Computer Society Press, Port Jefferson, NY, USA, July 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Verification of Security Protocols. Véronique Cortier. In 10th Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'09), pp. 5–13, Lecture Notes in Computer Science 5403, Springer, Savanah, USA, January 2009. (Invited Tutorial).
    Details     BibTeX     Download: [pdf] [DOI] 
  • Computational Soundness of Observational Equivalence. Hubert Comon-Lundh and Véronique Cortier. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS'08), pp. 109–118, ACM Press, Alexandria, Virginia, USA, October 2008.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Combining algorithms for deciding knowledge in security protocols. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS'07), pp. 103–117, Lecture Notes in Artificial Intelligence 4720, Springer, Liverpool, UK, September 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Safely Composing Security Protocols. Véronique Cortier, Jérémie Delaitre, and Stéphanie Delaune. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), pp. 352–363, Lecture Notes in Computer Science 4855, Springer, New Delhi, India, December 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding Knowledge in Security Protocols for Monoidal Equational Theories. Véronique Cortier and Stéphanie Delaune. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'07), pp. 196–210, Lecture Notes in Artificial Intelligence 4790, Springer, Yerevan, Armenia, October 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Synthetizing secure protocols. Véronique Cortier, Bogdan Warinschi, and Eugen Zalinescu. In Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS'07), pp. 406–421, 4734, Springer, Dresden, Germany, September 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Cryptographic Model for Branching Time Security Properties -- the Case of Contract Signing Protocols. Véronique Cortier, Ralf Küsters, and Bogdan Warinschi. In Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS'07), pp. 422–437, 4734, Springer, Dresden, Germany, September 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Formal Theory of Key Conjuring. Véronique Cortier, Stéphanie Delaune, and Graham Steel. In Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF'07), pp. 79–93, IEEE Computer Society Press, Venice, Italy, July 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Automatic Analysis of the Security of XOR-Based Key Management Schemes. Véronique Cortier, Gavin Keighren, and Graham Steel. In Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), pp. 538–552, Lecture Notes in Computer Science 4424, Springer, Braga, Portugal, March 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. Véronique Cortier, Steve Kremer, Ralf Küsters, and Bogdan Warinschi. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), pp. 176–187, Lecture Notes in Computer Science 4337, Springer, Kolkata, India, December 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding key cycles for security protocols. V. Cortier and E. Zalinescu. In Proceedings of the 13th Int. Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), pp. 317–331, Lecture Notes in Artificial Intelligence 4246, Springer, Phnom Penh, Cambodia, November 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Relating two standard notions of secrecy. V. Cortier, M. Rusinowitch, and E. Zalinescu. In Proceedings of 20th Int. Conference on Computer Science Logic (CSL'06), pp. 303–318, Lecture Notes in Computer Science 4207, Springer, Szeged, Hungary, September 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding knowledge in security protocols under (many more) equational theories. M. Abadi and V. Cortier. In Proc. 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp. 62–76, IEEE Comp. Soc. Press, Aix-en-Provence, France, June 2005.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Computationally Sound Implementations of Equational Theories against Passive Adversaries. Mathieu Baudet, Véronique Cortier, and Kremer,Steve. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pp. 652–663, Lecture Notes in Computer Science 3580, Springer, Lisboa, Portugal, July 2005.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A resolution Strategy for Verifying Cryptographic Protocols with CBC Encryption and Blind Signatures. V. Cortier, M. Rusinowitch, and E. Zalinescu. In Proceedings of the 7th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'05), pp. 12–22, ACM press, Lisboa, Portugal, July 2005.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Computationally Sound, Automated Proofs for Security Protocols. V. Cortier and B. Warinschi. In Proceedings of the 14th European Symposium on Programming (ESOP'05), pp. 157–171, Lecture Notes in Computer Science 3444, Springer, Edinburgh, U.K, April 2005.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Deciding knowledge in security protocols under equational theories. M. Abadi and V. Cortier. In Proceedings of the 31st Int. Coll. Automata, Languages, and Programming (ICALP'2004), pp. 46–58, Lecture Notes in Computer Science 3142, Springer, Turku, Finland, July 2004.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Security properties: two agents are sufficient. Hubert Comon-Lundh and Véronique Cortier. In Proceedings of the 12th European Symposium on Programming (ESOP'03), pp. 99–113, Lecture Notes in Computer Science 2618, Springer, Warsaw, Poland, April 2003.
    Details     BibTeX     Download: [pdf] [ps] 
  • New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. Hubert Comon-Lundh and Véronique Cortier. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA'03), pp. 148–164, Lecture Notes in Computer Science 2706, Springer, Valencia, Spain, June 2003.
    Details     BibTeX     Download: [pdf] [ps] [DOI] 
  • Tree Automata with One Memory, Set Constraints and Ping-Pong Protocols. Hubert Comon, Véronique Cortier, and John Mitchell. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), pp. 682–693, Lecture Notes in Computer Science 2076, Springer, Heraklion, Crete, Grece, July 2001.
    Details     BibTeX     Download: [pdf] [ps] 
  • Proving Secrecy is Easy Enough. Véronique Cortier, Jonathan K. Millen, and Harald Rueß. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW'01), pp. 97–110, IEEE Computer Society Press, Cape Breton, Nova Scotia, Canada, June 2001.
    Details     BibTeX     Download: [pdf] [ps] 
  • Flatness is not a Weakness. Hubert Comon and Véronique Cortier. In Proceedings of the 14th International Workshop on Computer Science Logic (CSL 2000), pp. 262–276, Lecture Notes in Computer Science 1862, Springer, Fischbachau, Germany, August 2000.
    Details     BibTeX     Download: [pdf] [ps] 
  • Decidable Fragments of Simultaneous Rigid Reachability. Véronique Cortier, Harald Ganzinger, Florent Jacquemard, and Margus Veanes. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), pp. 250–260, Lecture Notes in Computer Science 1644, Springer, Prague, Czech Republic, July 1999.
    Details     BibTeX     Download: [pdf] [ps] 

Workshops

  • A tool for automating the computationally complete symbolic attacker (Extended Abstract). Hubert Comon-Lundh, Véronique Cortier, and Guillaume Scerri. In Joint Workshop on Foundations of Computer Security and Formal and Computational Cryptography (FCS-FCC'14), Vienna, Austria, July 2014.
    Details     BibTeX     Download: [pdf] 
  • Ballot stuffing in a postal voting system. Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, and Paul Zimmermann. In Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, IEEE, Trento, Italie, 2011.
    Details     BibTeX     Download: [pdf] 
  • A composable computational soundness notion (Abstract). Véronique Cortier and Bogdan Warinschi. In 7th Workshop on Formal and Computational Cryptography (FCC 2011), Paris, France, June 2011.
    Details     BibTeX     Download: [pdf] 
  • Modeling and Verifying Ad Hoc Routing Protocol. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. In Preliminary Proceedings of the 4th International Workshop on Security and Rewriting Techniques (SecReT'09), pp. 33–46, Port Jefferson, NY, USA, July 2009.
    Details     BibTeX     Download: [pdf] 
  • Deciding knowledge in security protocols for monoidal equational theories. Véronique Cortier and Stéphanie Delaune. In Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'07), pp. 63–80, Wrocław, Poland, July 2007.
    Details     BibTeX     Download: [pdf] 
  • A Cryptographic Model for Branching Time Security Properties -- the Case of Contract Signing Protocols. Véronique Cortier, Ralf Küsters, and Bogdan Warinschi. In 3rd Workshop on Formal and Computational Cryptography (FCC 2007), Venice, Italy, July 2007.
    Details     BibTeX     Download: (unavailable)
  • Deciding key cycles for security protocols. Véronique Cortier and Eugen Zalinescu. In 3rd Workshop on Formal and Computational Cryptography (FCC 2007), Venice, Italy, July 2007.
    Details     BibTeX     Download: (unavailable)
  • Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. Véronique Cortier, Heinrich Hördegen, and Bogdan Warinschi. In Workshop on Information and Computer Security (ICS 2006), pp. 49–65, Electronic Notes Theoretical Computer Science 186, Timisoara, Romania, September 2007.
    Details     BibTeX     Download: [pdf] 
  • On the Decidability of a Class of XOR-based Key-management APIs. Véronique Cortier and Graham Steel. In Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'06), Seattle, Washington, August 2006.
    Details     BibTeX     Download: [pdf] 

Research Reports

  • Verifiability Notions for E-Voting Protocols. Veronique Cortier, David Galindo, Ralf Kuesters, Johannes Mueller, and Tomasz Truderung. Cryptology ePrint Archive, Report 2016/287, 2016. http://eprint.iacr.org/.
    Details     BibTeX     Download: [DOI] 
  • A comprehensive analysis of game-based ballot privacy definitions. David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, and Bogdan Warinschi. Cryptology ePrint Archive, Report 2015/255, 2015.
    Details     BibTeX     Download: [DOI] 
  • BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme. Véronique Cortier, Georg Fuchsbauer, and David Galindo. Cryptology ePrint Archive, Report 2015/629, 2015.
    Details     BibTeX     Download: [DOI] 
  • Type-Based Verification of Electronic Voting Protocols. Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, and Cyrille Wiedling. Cryptology ePrint Archive, Report 2015/039, 2015.
    Details     BibTeX     Download: [DOI] 
  • Typing messages for free in security protocols: the case of equivalence properties. Rémy Chrétien, Véronique Cortier, and Stéphanie Delaune. Rapport de recherche RR-8546, INRIA, 2014.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deduction Soundness: Prove One, Get Five for Free. Florian Böhl, Véronique Cortier, and Bogdan Warinschi. Cryptology ePrint Archive, Report 2013/457, 2013.
    Details     BibTeX     Download: [DOI] 
  • A generic construction for voting correctness at minimum cost - Application to Helios. Véronique Cortier, David Galindo, Stephane Glondu, and Malika Izabachene. Cryptology ePrint Archive, Report 2013/177, 2013.
    Details     BibTeX     Download: [DOI] 
  • Security proof with dishonest keys. Hubert Comon-Lundh, Véronique Cortier, and Guillaume Scerri. Cryptology ePrint Archive, Report 2012/008, 2012.
    Details     BibTeX     Download: [DOI] 
  • Modeling and Verifying Ad Hoc Routing Protocols. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. Research Report LSV-11-24, Laboratoire Spécification et Vérification, ENS Cachan, France, 2011. 68 pages.
    Details     BibTeX     Download: [pdf] 
  • Analysing routing protocols: four nodes topologies are sufficient. Véronique Cortier, Jan Degrieck, and Stéphanie Delaune. Research Report LSV-11-25, Laboratoire Spécification et Vérification, ENS Cachan, France, 2011. 28 pages.
    Details     BibTeX     Download: [pdf] 
  • A formal analysis of the Norwegian e-voting protocol. Véronique Cortier and Cyrille Wiedling. Rapport de recherche RR-7781, INRIA, 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A note on replay attacks that violate privacy in electronic voting schemes. Ben Smyth and Véronique Cortier. Rapport de recherche RR-7643, INRIA, 2011.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding knowledge in security protocols under some e-voting theories. Mouhebeddine Berrima, Narjes Ben Rajeb, and Véronique Cortier. Rapport de recherche RR-6903, INRIA, 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. Véronique Cortier, Steve Kremer, and Bogdan Warinschi. Rapport de recherche RR-6912, INRIA, 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Synthesising Secure APIs. Véronique Cortier and Graham Steel. Rapport de recherche RR-6882, INRIA, 2009.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Computational soundness of observational equivalence. Hubert Comon-Lundh and Véronique Cortier. Rapport de recherche RR-6508, INRIA, 2008.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Combining algorithms for deciding knowledge in security protocols. Mathilde Arnaud, Véronique Cortier, and Stéphanie Delaune. Rapport de recherche RR-6118, INRIA, 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Safely composing security protocols. Véronique Cortier, Jérémie Delaitre, and Stéphanie Delaune. Rapport de recherche RR-6234, INRIA, 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Synthesizing secure protocols. Véronique Cortier, Bogdan Warinschi, and Eugen Zalinescu. Rapport de recherche RR-6166, INRIA, 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A Formal Theory of Key Conjuring. Véronique Cortier, Stéphanie Delaune, and Graham Steel. Rapport de recherche RR-6134, INRIA, 2007.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. Véronique Cortier, Heinrich Hördegen, and Bogdan Warinschi. Rapport de recherche RR-5928, INRIA, 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Relating two Standard Notions of Secrecy. Eugen Zalinescu, Véronique Cortier, and Michaël Rusinowitch. Rapport de recherche RR-5908, INRIA, 2006.
    Details     BibTeX     Download: [pdf] [DOI] 
  • A note on maximally repeated sub-patterns of a point set. Véronique Cortier, Xavier Goaoc, Mira Lee, and Hyeon-Suk Na. Rapport de recherche RR-5773, INRIA, 2005.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Deciding knowledge in security protocols under equational theories. Martin Abadi and Véronique Cortier. Rapport de recherche RR-5169, INRIA, 2004.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Computationally Sound, Automated Proofs for Security Protocols. Véronique Cortier and Bogdan Warinschi. Rapport de recherche RR-5341, INRIA, 2004.
    Details     BibTeX     Download: [pdf] [DOI] 
  • Observational Equivalence and Trace Equivalence in an Extension of Spi-calculus. Application to Cryptographic Protocols Analysis. Extended Version. Véronique Cortier. Research Report LSV-02-3, Laboratoire Spécification et Vérification, ENS Cachan, France, 2002. 33 pages.
    Details     BibTeX     Download: [ps] 

Theses

  • Analysis of cryptographic protocols: from symbolic to computational models. Véronique Cortier. Habilitation à diriger des recherches (Habilitation to conduct research), Institut National Polytechnique de Lorraine, 2009.
    Details     BibTeX     Download: [pdf] 
  • Vérification automatique des protocoles cryptographiques. Véronique Cortier. Thèse de doctorat (PhD thesis), Laboratoire Spécification et Vérification, ENS Cachan, France, 2003.
    Details     BibTeX     Download: [pdf] [ps] 
  • Vérification de systèmes à compteurs. Véronique Cortier. Master's Thesis, DEA de Logique, Paris, France,1999.
    Details     BibTeX     Download: [pdf] [ps] 

Other Publications

  • Computational soundness of static equivalence. Véronique Cortier, Steve Kremer, and Pascal Lafourcade. Deliverable AVOTE 3.1, (ANR-07-SESU-002), March 2010. 106 pages.
    Details     BibTeX     Download: [pdf] 
  • Sufficient conditions on properties for an automated verification: theoretical report on the verification of protocols for an extended model of the intruder. Vincent Bernat, Hubert Comon-Lundh, Véronique Cortier, Stéphanie Delaune, Florent Jacquemard, Pascal Lafourcade, Yassine Lakhnech, and Laurent Mazaré. Technical Report 4, projet RNTL PROUVÉ, 2004. 33 pages.
    Details     BibTeX     Download: [pdf] 
  • A Survey of Algebraic Properties Used in Cryptographic Protocols. Véronique Cortier, Stéphanie Delaune, and Pascal Lafourcade. Technical Report 2, projet RNTL PROUVÉ, 2004. 19 pages.
    Details     BibTeX     Download: [pdf] 
  • A Guide for SECURIFY. Véronique Cortier. Technical Report 13, projet RNTL EVA, 2003. 9 pages.
    Details     BibTeX     Download: [pdf]