Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Véronique Cortier
2010 – today
- 2013
[j18]Véronique Cortier, Ben Smyth: Attacking and fixing Helios: An analysis of ballot secrecy. Journal of Computer Security 21(1): 89-148 (2013)- [j17]Vincent Cheval, Véronique Cortier, Stéphanie Delaune: Deciding equivalence-based properties using constraint solving. Theor. Comput. Sci. 492: 1-39 (2013)
- [j16]Mathieu Baudet, Véronique Cortier, Stéphanie Delaune: YAPA: A Generic Tool for Computing Intruder Knowledge. ACM Trans. Comput. Log. 14(1): 4 (2013)
- [c46]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri: Tractable Inference Systems: An Extension with a Deducibility Predicate. CADE 2013: 91-108
- [c45]Vincent Cheval, Véronique Cortier, Antoine Plet: Lengths May Break Privacy - Or How to Check for Equivalences with Length. CAV 2013: 708-723
- [c44]Rémy Chrétien, Véronique Cortier, Stéphanie Delaune: From Security Protocols to Pushdown Automata. ICALP (2) 2013: 137-149
- [c43]Myrto Arapinis, Véronique Cortier, Steve Kremer, Mark Ryan: Practical Everlasting Privacy. POST 2013: 21-40
- [c42]Mathilde Arnaud, Véronique Cortier, Cyrille Wiedling: Analysis of an Electronic Boardroom Voting System. VOTE-ID 2013: 109-126
- [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 Cryptology ePrint Archive 2013: 177 (2013)
- [i10]Florian Böhl, Véronique Cortier, Bogdan Warinschi: Deduction Soundness: Prove One, Get Five for Free. IACR Cryptology ePrint Archive 2013: 457 (2013)
- 2012
- [j15]Véronique Cortier, Stéphanie Delaune: Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. J. Autom. Reasoning 48(4): 441-487 (2012)
- [c41]Véronique Cortier, Graham Steel, Cyrille Wiedling: Revoke and let live: a secure key revocation api for cryptographic devices. ACM Conference on Computer and Communications Security 2012: 918-928
- [c40]David Bernhard, Véronique Cortier, Olivier Pereira, Bogdan Warinschi: Measuring vote privacy, revisited. ACM Conference on Computer and Communications Security 2012: 941-952
- [c39]Véronique Cortier, Jan Degrieck, Stéphanie Delaune: Analysing Routing Protocols: Four Nodes Topologies Are Sufficient. POST 2012: 30-50
- [c38]Véronique Cortier, Cyrille Wiedling: A Formal Analysis of the Norwegian E-voting Protocol. POST 2012: 109-128
- [c37]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 Cryptology ePrint Archive 2012: 8 (2012)
- 2011
- [j14]Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier: Deciding knowledge in security protocols under some e-voting theories. RAIRO - Theor. Inf. and Applic. 45(3): 269-299 (2011)
- [j13]Véronique Cortier, Steve Kremer, Bogdan Warinschi: A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. J. Autom. Reasoning 46(3-4): 225-259 (2011)
- [c36]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune: Deciding Security for Protocols with Recursive Tests. CADE 2011: 49-63
- [c35]Véronique Cortier, Bogdan Warinschi: A composable computational soundness notion. ACM Conference on Computer and Communications Security 2011: 63-74
- [c34]
- [c33]David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi: Adapting Helios for Provable Ballot Privacy. ESORICS 2011: 335-354
- [c32]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
- [c31]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
- [c30]
- 2010
- [j12]Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu: Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Log. 11(2) (2010)
- [c29]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune: Modeling and Verifying Ad Hoc Routing Protocols. CSF 2010: 59-74
- [c28]
- [e2]Konstantinos Chatzikokolakis, Véronique Cortier (Eds.): Proceedings 8th International Workshop on Security Issues in Concurrency. EPTCS 51, 2010
- [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 Cryptology ePrint Archive 2010: 625 (2010)
2000 – 2009
- 2009
- [j11]Véronique Cortier, Stéphanie Delaune: Safely composing security protocols. Formal Methods in System Design 34(1): 1-36 (2009)
- [j10]Mathieu Baudet, Véronique Cortier, Steve Kremer: Computationally sound implementations of equational theories against passive adversaries. Inf. Comput. 207(4): 496-520 (2009)
- [c27]Véronique Cortier, Stéphanie Delaune: A Method for Proving Observational Equivalence. CSF 2009: 266-276
- [c26]Véronique Cortier, Graham Steel: A Generic Security API for Symmetric Key Management on Cryptographic Devices. ESORICS 2009: 605-620
- [c25]Mathieu Baudet, Véronique Cortier, Stéphanie Delaune: YAPA: A Generic Tool for Computing Intruder Knowledge. RTA 2009: 148-163
- [c24]
- [e1]Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada (Eds.): 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
- 2008
- [c23]Hubert Comon-Lundh, Véronique Cortier: Computational soundness of observational equivalence. ACM Conference on Computer and Communications Security 2008: 109-118
- 2007
- [j9]Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. Electr. Notes Theor. Comput. Sci. 186: 49-65 (2007)
- [j8]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu: Relating two standard notions of secrecy. Logical Methods in Computer Science 3(3) (2007)
- [c22]Véronique Cortier, Stéphanie Delaune, Graham Steel: A Formal Theory of Key Conjuring. CSF 2007: 79-96
- [c21]Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu: Synthesizing Secure Protocols. ESORICS 2007: 406-421
- [c20]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
- [c19]Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune: Combining Algorithms for Deciding Knowledge in Security Protocols. FroCoS 2007: 103-117
- [c18]Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune: Safely Composing Security Protocols. FSTTCS 2007: 352-363
- [c17]Véronique Cortier, Stéphanie Delaune: Deciding Knowledge in Security Protocols for Monoidal Equational Theories. LPAR 2007: 196-210
- [c16]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 Cryptology ePrint Archive 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. Discrete Mathematics 306(16): 1965-1968 (2006)
- [j6]Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14(1): 1-43 (2006)
- [j5]Martín Abadi, Véronique Cortier: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci. 367(1-2): 2-32 (2006)
- [c15]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu: Relating Two Standard Notions of Secrecy. CSL 2006: 303-318
- [c14]Eugen Zalinescu, Véronique Cortier, Michaël Rusinowitch: Relating two standard notions of secrecy. Trustworthy Software 2006
- [c13]Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187
- [c12]
- [i3]Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. CoRR abs/cs/0606030 (2006)
- [i2]Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. IACR Cryptology ePrint Archive 2006: 218 (2006)
- 2005
- [j4]Hubert Comon, Véronique Cortier: Tree automata with one memory set constraints and cryptographic protocols. Theor. Comput. Sci. 331(1): 143-214 (2005)
- [j3]Véronique Cortier: Vérifier les protocoles cryptographiques. Technique et Science Informatiques 24(1): 115-140 (2005)
- [c11]Martín Abadi, Véronique Cortier: Deciding Knowledge in Security Protocols under (Many More) Equational Theories. CSFW 2005: 62-76
- [c10]Véronique Cortier, Bogdan Warinschi: Computationally Sound, Automated Proofs for Security Protocols. ESOP 2005: 157-171
- [c9]Mathieu Baudet, Véronique Cortier, Steve Kremer: Computationally Sound Implementations of Equational Theories Against Passive Adversaries. ICALP 2005: 652-663
- [c8]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu: A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. PPDP 2005: 12-22
- [i1]Mathieu Baudet, Véronique Cortier, Steve Kremer: Computationally sound implementations of equational theories against passive adversaries. IACR Cryptology ePrint Archive 2005: 74 (2005)
- 2004
- [j2]Hubert Comon-Lundh, Véronique Cortier: Security properties: two agents are sufficient. Sci. Comput. Program. 50(1-3): 51-71 (2004)
- [c7]Martín Abadi, Véronique Cortier: Deciding Knowledge in Security Protocols Under Equational Theories. ICALP 2004: 46-58
- 2003
- [c6]Hubert Comon-Lundh, Véronique Cortier: Security Properties: Two Agents Are Sufficient. ESOP 2003: 99-113
- [c5]Hubert Comon-Lundh, Véronique Cortier: New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. RTA 2003: 148-164
- 2002
- [j1]Véronique Cortier: About the decision of reachability for register machines. ITA 36(4): 341-358 (2002)
- 2001
- [c4]
- [c3]Hubert Comon, Véronique Cortier, John Mitchell: Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. ICALP 2001: 682-693
- 2000
- [c2]
1990 – 1999
- 1999
- [c1]Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes: Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:14 CEST by the dblp team