default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVéronique Cortier
Person information
- affiliation: CNRS, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c91]Véronique Cortier, Pierrick Gaudry, Quentin Yang:
Is the JCJ voting system really coercion-resistant? CSF 2024: 186-200- [c90]Véronique Cortier, Alexandre Debant, Florian Moser:
Code Voting: When Simplicity Meets Security. ESORICS (2) 2024: 410-429 - [c89]Véronique Cortier, Pierrick Gaudry, Anselme Goetschmann, Sophie Lemonnier:
Belenios with Cast-as-Intended: Towards a Usable Interface. E-Vote-ID 2024: 1-19 - [c88]Véronique Cortier, Alexandre Debant, Anselme Goetschmann, Lucca Hirschi:
Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility. USENIX Security Symposium 2024 - [i24]Véronique Cortier, Alexandre Debant, Anselme Goetschmann, Lucca Hirschi:
Election Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility. IACR Cryptol. ePrint Arch. 2024: 261 (2024) - [i23]Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Léo Louistisserand:
Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. IACR Cryptol. ePrint Arch. 2024: 1951 (2024) - 2023
- [c87]Vincent Cheval, Véronique Cortier, Alexandre Debant:
Election Verifiability with ProVerif. CSF 2023: 43-58 - [c86]Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Stéphane Glondu:
Belenios with Cast as Intended. FC Workshops 2023: 3-18 - 2022
- [j26]Véronique Cortier, Stéphanie Delaune, Jannik Dreier, Elise Klein
:
Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols. J. Comput. Secur. 30(4): 573-598 (2022) - [c85]Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani:
Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. CCS 2022: 397-410 - [c84]Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
A small bound on the number of sessions for security protocols. CSF 2022: 33-48 - [c83]Véronique Cortier, Pierrick Gaudry, Quentin Yang:
A Toolbox for Verifiable Tally-Hiding E-Voting Systems. ESORICS (2) 2022: 631-652 - [c82]Bruno Blanchet, Vincent Cheval, Véronique Cortier:
ProVerif with Lemmas, Induction, Fast Subsumption, and Much More. SP 2022: 69-86 - [i22]Véronique Cortier, Pierrick Gaudry, Quentin Yang:
Is the JCJ voting system really coercion-resistant? IACR Cryptol. ePrint Arch. 2022: 430 (2022) - 2021
- [j25]Véronique Cortier, Stéphanie Delaune, Vaishnavi Sundararajan:
A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. J. Autom. Reason. 65(4): 479-520 (2021) - [c81]Véronique Cortier, Itsaka Rakotonirina:
How to Explain Security Protocols to Your Children. Protocols, Strands, and Logic 2021: 112-123 - [i21]Véronique Cortier, Pierrick Gaudry, Quentin Yang:
A toolbox for verifiable tally-hiding e-voting systems. IACR Cryptol. ePrint Arch. 2021: 491 (2021) - 2020
- [j24]Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
Typing Messages for Free in Security Protocols. ACM Trans. Comput. Log. 21(1): 1:1-1:52 (2020) - [c80]Véronique Cortier, Joseph Lallemand, Bogdan Warinschi:
Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. CSF 2020: 17-32 - [c79]Véronique Cortier:
Verification of Security Protocols (Invited Talk). CSL 2020: 1:1-1:2 - [c78]Véronique Cortier, Stéphanie Delaune, Jannik Dreier:
Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. ESORICS (2) 2020: 3-22 - [i20]Véronique Cortier, Joseph Lallemand, Bogdan Warinschi:
Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. IACR Cryptol. ePrint Arch. 2020: 127 (2020)
2010 – 2019
- 2019
- [c77]Véronique Cortier, Pierrick Gaudry, Stéphane Glondu:
Belenios: A Simple Private and Verifiable Electronic Voting System. Foundations of Security, Protocols, and Equational Reasoning 2019: 214-238 - [c76]Véronique Cortier, Alicia Filipiak, Joseph Lallemand:
BeleniosVS: Secrecy and Verifiability Against a Corrupted Voting Device. CSF 2019: 367-381 - [e6]Robert Krimmer, Melanie Volkamer, Véronique Cortier, Bernhard Beckert, Ralf Küsters, Uwe Serdült, David Duenas-Cid:
Electronic Voting - 4th International Joint Conference, E-Vote-ID 2019, Bregenz, Austria, October 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11759, Springer 2019, ISBN 978-3-030-30624-3 [contents] - 2018
- [c75]Véronique Cortier, Joseph Lallemand:
Voting: You Can't Have Privacy without Individual Verifiability. CCS 2018: 53-66 - [c74]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Bogdan Warinschi:
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. CSF 2018: 298-312 - [c73]Vincent Cheval, Véronique Cortier, Mathieu Turuani:
A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif. CSF 2018: 344-358 - [c72]Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
Efficiently Deciding Equivalence for Standard Primitives and Phases. ESORICS (1) 2018: 491-511 - [c71]Véronique Cortier, David Galindo, Mathieu Turuani:
A Formal Analysis of the Neuchatel e-Voting Protocol. EuroS&P 2018: 430-442 - [c70]Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei:
Equivalence Properties by Typing in Cryptographic Branching Protocols. POST 2018: 160-187 - [e5]Robert Krimmer, Melanie Volkamer, Véronique Cortier, Rajeev Goré, Manik Hapsara, Uwe Serdült, David Duenas-Cid:
Electronic Voting - Third International Joint Conference, E-Vote-ID 2018, Bregenz, Austria, October 2-5, 2018, Proceedings. Lecture Notes in Computer Science 11143, Springer 2018, ISBN 978-3-030-00418-7 [contents] - [i19]David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi:
Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. 2018: 1052 (2018) - 2017
- [j23]Véronique Cortier, Cyrille Wiedling:
A formal analysis of the Norwegian E-voting protocol. J. Comput. Secur. 25(1): 21-57 (2017) - [c69]Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei:
A Type System for Privacy Properties. CCS 2017: 409-423 - [c68]Vincent Cheval, Véronique Cortier, Bogdan Warinschi:
Secure Composition of PKIs with Public Key Protocols. CSF 2017: 144-158 - [c67]Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
SAT-Equiv: An Efficient Tool for Equivalence Properties. CSF 2017: 481-494 - [c66]Véronique Cortier, Alicia Filipiak, Jan Florent, Said Gharout, Jacques Traoré:
Designing and Proving an EMV-Compliant Payment Protocol for Mobile Devices. EuroS&P 2017: 467-480 - [c65]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Benedikt Schmidt, Pierre-Yves Strub, Bogdan Warinschi:
Machine-Checked Proofs of Privacy for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2017: 993-1008 - [c64]Véronique Cortier:
Electronic Voting: How Logic Can Help. CIAA 2017: xi-xii - [i18]Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei:
A Type System for Privacy Properties (Technical Report). CoRR abs/1708.08340 (2017) - 2016
- [c63]Pyrros Chaidos, Véronique Cortier, Georg Fuchsbauer, David Galindo:
BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme. CCS 2016: 1614-1625 - [c62]Myrto Arapinis, Véronique Cortier, Steve Kremer:
When Are Three Voters Enough for Privacy Properties? ESORICS (2) 2016: 241-260 - [c61]Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
Bounding the Number of Agents, for Equivalence Too. POST 2016: 211-232 - [c60]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
SoK: Verifiability Notions for E-Voting Protocols. IEEE Symposium on Security and Privacy 2016: 779-798 - [p2]Véronique Cortier, Steve Kremer:
Formal Models for Analyzing Security Protocols: Some Lecture Notes. Dependable Software Systems Engineering 2016: 33-58 - [i17]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
Verifiability Notions for E-Voting Protocols. IACR Cryptol. ePrint Arch. 2016: 287 (2016) - [i16]Myrto Arapinis, Véronique Cortier, Steve Kremer:
When Are Three Voters Enough for Privacy Properties? IACR Cryptol. ePrint Arch. 2016: 690 (2016) - [i15]David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi:
Adapting Helios for provable ballot privacy. IACR Cryptol. ePrint Arch. 2016: 756 (2016) - 2015
- [j22]Véronique Cortier:
Formal verification of e-voting: solutions and challenges. ACM SIGLOG News 2(1): 25-34 (2015) - [j21]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. ACM Trans. Comput. Log. 17(1): 3 (2015) - [c59]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
Decidability of Trace Equivalence for Protocols with Nonces. CSF 2015: 170-184 - [c58]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
Checking Trace Equivalence: How to Get Rid of Nonces? ESORICS (2) 2015: 230-251 - [c57]Vincent Cheval, Véronique Cortier, Eric le Morvan:
Secure Refinements of Communication Channels. FSTTCS 2015: 575-589 - [c56]Vincent Cheval, Véronique Cortier:
Timing Attacks in Security Protocols: Symbolic Framework and Proof Techniques. POST 2015: 280-299 - [c55]Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, Cyrille Wiedling:
Type-Based Verification of Electronic Voting Protocols. POST 2015: 303-323 - [c54]David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi:
SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. IEEE Symposium on Security and Privacy 2015: 499-516 - [i14]Véronique Cortier, Fabienne Eigner, Steve Kremer, Matteo Maffei, Cyrille Wiedling:
Type-Based Verification of Electronic Voting Protocols. IACR Cryptol. ePrint Arch. 2015: 39 (2015) - [i13]David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi:
A comprehensive analysis of game-based ballot privacy definitions. IACR Cryptol. ePrint Arch. 2015: 255 (2015) - [i12]Véronique Cortier, Georg Fuchsbauer, David Galindo:
BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme. IACR Cryptol. ePrint Arch. 2015: 629 (2015) - 2014
- [j20]Véronique Cortier, Steve Kremer:
Formal Models and Techniques for Analyzing Security Protocols: A Tutorial. Found. Trends Program. Lang. 1(3): 151-267 (2014) - [j19]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
Modeling and verifying ad hoc routing protocols. Inf. Comput. 238: 30-67 (2014) - [j18]Véronique Cortier, Graham Steel:
A generic security API for symmetric key management on cryptographic devices. Inf. Comput. 238: 208-232 (2014) - [c53]Véronique Cortier:
Electronic Voting: How Logic Can Help. IJCAR 2014: 16-25 - [c52]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. CONCUR 2014: 372-386 - [c51]Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène:
Election Verifiability for Helios under Weaker Trust Assumptions. ESORICS (2) 2014: 327-344 - [e4]Véronique Cortier, Riadh Robbana:
Proceedings of the Formal Methods for Security Workshop co-located with the PetriNets-2014 Conference , Tunis, Tunisia, June 23rd, 2014. CEUR Workshop Proceedings 1158, CEUR-WS.org 2014 [contents] - 2013
- [j17]Véronique Cortier, Ben Smyth:
Attacking and fixing Helios: An analysis of ballot secrecy. J. Comput. Secur. 21(1): 89-148 (2013) - [j16]Vincent Cheval, Véronique Cortier, Stéphanie Delaune:
Deciding equivalence-based properties using constraint solving. Theor. Comput. Sci. 492: 1-39 (2013) - [j15]Mathieu Baudet, Véronique Cortier, Stéphanie Delaune:
YAPA: A Generic Tool for Computing Intruder Knowledge. ACM Trans. Comput. Log. 14(1): 4:1-4:32 (2013) - [c50]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Tractable Inference Systems: An Extension with a Deducibility Predicate. CADE 2013: 91-108 - [c49]Vincent Cheval, Véronique Cortier, Antoine Plet:
Lengths May Break Privacy - Or How to Check for Equivalences with Length. CAV 2013: 708-723 - [c48]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction soundness: prove one, get five for free. CCS 2013: 1261-1272 - [c47]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. ICALP (2) 2013: 137-149 - [c46]Myrto Arapinis, Véronique Cortier, Steve Kremer, Mark Ryan:
Practical Everlasting Privacy. POST 2013: 21-40 - [c45]Mathilde Arnaud, Véronique Cortier, Cyrille Wiedling:
Analysis of an Electronic Boardroom Voting System. VoteID 2013: 109-126 - [c44]Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène:
Distributed ElGamal à la Pedersen: Application to Helios. WPES 2013: 131-142 - [i11]Véronique Cortier, David Galindo, Stéphane Glondu, Malika Izabachène:
A generic construction for voting correctness at minimum cost - Application to Helios. IACR Cryptol. ePrint Arch. 2013: 177 (2013) - [i10]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction Soundness: Prove One, Get Five for Free. IACR Cryptol. ePrint Arch. 2013: 457 (2013) - 2012
- [j14]Véronique Cortier, Stéphanie Delaune:
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. J. Autom. Reason. 48(4): 441-487 (2012) - [c43]Véronique Cortier, Graham Steel, Cyrille Wiedling:
Revoke and let live: a secure key revocation api for cryptographic devices. CCS 2012: 918-928 - [c42]David Bernhard, Véronique Cortier, Olivier Pereira, Bogdan Warinschi:
Measuring vote privacy, revisited. CCS 2012: 941-952 - [c41]Véronique Cortier, Jan Degrieck, Stéphanie Delaune:
Analysing Routing Protocols: Four Nodes Topologies Are Sufficient. POST 2012: 30-50 - [c40]Véronique Cortier, Cyrille Wiedling:
A Formal Analysis of the Norwegian E-voting Protocol. POST 2012: 109-128 - [c39]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Security Proof with Dishonest Keys. POST 2012: 149-168 - [i9]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Security proof with dishonest keys. IACR Cryptol. ePrint Arch. 2012: 8 (2012) - 2011
- [j13]Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier:
Deciding knowledge in security protocols under some e-voting theories. RAIRO Theor. Informatics Appl. 45(3): 269-299 (2011) - [j12]Véronique Cortier, Steve Kremer, Bogdan Warinschi:
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. J. Autom. Reason. 46(3-4): 225-259 (2011) - [c38]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
Deciding Security for Protocols with Recursive Tests. CADE 2011: 49-63 - [c37]Véronique Cortier, Bogdan Warinschi:
A composable computational soundness notion. CCS 2011: 63-74 - [c36]Véronique Cortier, Ben Smyth:
Attacking and Fixing Helios: An Analysis of Ballot Secrecy. CSF 2011: 297-311 - [c35]David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi:
Adapting Helios for Provable Ballot Privacy. ESORICS 2011: 335-354 - [c34]Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann:
Ballot stuffing in a postal voting system. REVOTE 2011: 27-36 - [c33]Hubert Comon-Lundh, Véronique Cortier:
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. STACS 2011: 29-44 - [c32]Véronique Cortier:
Secure Composition of Protocols. TOSCA 2011: 29-32 - [p1]Véronique Cortier, Steve Kremer:
Introduction. Formal Models and Techniques for Analyzing Security Protocols 2011: 1-12 - [e3]Véronique Cortier, Steve Kremer:
Formal Models and Techniques for Analyzing Security Protocols. Cryptology and Information Security Series 5, IOS Press 2011, ISBN 978-1-60750-713-0 [contents] - 2010
- [j11]Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Log. 11(2): 9:1-9:42 (2010) - [c31]Véronique Cortier:
Verification of Security Protocols. VERIFY@IJCAR 2010: 1 - [c30]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
Modeling and Verifying Ad Hoc Routing Protocols. CSF 2010: 59-74 - [c29]Stefan Ciobaca, Véronique Cortier:
Protocol Composition for Arbitrary Primitives. CSF 2010: 322-336 - [e2]Konstantinos Chatzikokolakis, Véronique Cortier:
Proceedings 8th International Workshop on Security Issues in Concurrency, SecCo 2010, Paris, France, 30th August 2010. EPTCS 51, 2010 [contents] - [i8]Mathieu Baudet, Véronique Cortier, Stéphanie Delaune:
YAPA: A generic tool for computing intruder knowledge. CoRR abs/1005.0737 (2010) - [i7]Véronique Cortier, Ben Smyth:
Attacking and fixing Helios: An analysis of ballot secrecy. IACR Cryptol. ePrint Arch. 2010: 625 (2010)
2000 – 2009
- 2009
- [b1]Véronique Cortier:
Analyse des protocoles cryptographiques: des modèles symboliques aux modèles calculatoires. (Analysis of cryptographic protocols: from symbolic to computational models). National Polytechnic Institute of Lorraine, Nancy, France, 2009 - [j10]Véronique Cortier, Stéphanie Delaune:
Safely composing security protocols. Formal Methods Syst. Des. 34(1): 1-36 (2009) - [j9]Mathieu Baudet, Véronique Cortier, Steve Kremer:
Computationally sound implementations of equational theories against passive adversaries. Inf. Comput. 207(4): 496-520 (2009) - [c28]Véronique Cortier, Stéphanie Delaune:
A Method for Proving Observational Equivalence. CSF 2009: 266-276 - [c27]Véronique Cortier, Graham Steel:
A Generic Security API for Symmetric Key Management on Cryptographic Devices. ESORICS 2009: 605-620 - [c26]Mathieu Baudet, Véronique Cortier, Stéphanie Delaune:
YAPA: A Generic Tool for Computing Intruder Knowledge. RTA 2009: 148-163 - [c25]Véronique Cortier:
Verification of Security Protocols. VMCAI 2009: 5-13 - [e1]Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada:
Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration. Lecture Notes in Computer Science 5458, Springer 2009, ISBN 978-3-642-02001-8 [contents] - 2008
- [c24]Hubert Comon-Lundh, Véronique Cortier:
Computational soundness of observational equivalence. CCS 2008: 109-118 - 2007
- [j8]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating two standard notions of secrecy. Log. Methods Comput. Sci. 3(3) (2007) - [c23]Véronique Cortier, Stéphanie Delaune, Graham Steel:
A Formal Theory of Key Conjuring. CSF 2007: 79-96 - [c22]Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu:
Synthesizing Secure Protocols. ESORICS 2007: 406-421 - [c21]Véronique Cortier, Ralf Küsters, Bogdan Warinschi:
A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. ESORICS 2007: 422-437 - [c20]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
Combining Algorithms for Deciding Knowledge in Security Protocols. FroCoS 2007: 103-117 - [c19]Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune:
Safely Composing Security Protocols. FSTTCS 2007: 352-363 - [c18]Véronique Cortier, Stéphanie Delaune:
Deciding Knowledge in Security Protocols for Monoidal Equational Theories. LPAR 2007: 196-210 - [c17]Véronique Cortier, Gavin Keighren, Graham Steel:
Automatic Analysis of the Security of XOR-Based Key Management Schemes. TACAS 2007: 538-552 - [i6]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating two standard notions of secrecy. CoRR abs/0706.0502 (2007) - [i5]Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
Deciding security properties for cryptographic protocols. Application to key cycles. CoRR abs/0708.3564 (2007) - [i4]Véronique Cortier, Ralf Küsters, Bogdan Warinschi:
A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. IACR Cryptol. ePrint Arch. 2007: 251 (2007) - 2006
- [j7]Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na:
A note on maximally repeated sub-patterns of a point set. Discret. Math. 306(16): 1965-1968 (2006) - [j6]