Véronique Cortier
Véronique Cortier
CNRS, LORIA
Verified email at loria.fr - Homepage
Title
Cited by
Cited by
Year
A survey of algebraic properties used in cryptographic protocols
V Cortier, S Delaune, P Lafourcade
Journal of Computer Security 14 (1), 1-43, 2006
2202006
Attacking and fixing Helios: An analysis of ballot secrecy
V Cortier, B Smyth
Journal of Computer Security 21 (1), 89-148, 2013
1902013
Deciding knowledge in security protocols under equational theories
M Abadi, V Cortier
Theoretical Computer Science 367 (1-2), 2-32, 2006
1822006
Computationally sound, automated proofs for security protocols
V Cortier, B Warinschi
European Symposium on Programming, 157-171, 2005
1802005
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D Ünay, Z Çataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2010
156*2010
New decidability results for fragments of first-order logic and application to cryptographic protocols
H Comon-Lundh, V Cortier
International Conference on Rewriting Techniques and Applications, 148-164, 2003
1272003
Election verifiability for helios under weaker trust assumptions
V Cortier, D Galindo, S Glondu, M Izabachene
European Symposium on Research in Computer Security, 327-344, 2014
1202014
Computational soundness of observational equivalence
H Comon-Lundh, V Cortier
Proceedings of the 15th ACM conference on Computer and communications …, 2008
1202008
A survey of symbolic methods in computational analysis of cryptographic systems
V Cortier, S Kremer, B Warinschi
Journal of Automated Reasoning 46 (3-4), 225-259, 2011
1142011
Sok: A comprehensive analysis of game-based ballot privacy definitions
D Bernhard, V Cortier, D Galindo, O Pereira, B Warinschi
2015 IEEE Symposium on Security and Privacy, 499-516, 2015
1122015
Tree automata with one memory set constraints and cryptographic protocols
H Comon, V Cortier
Theoretical Computer Science 331 (1), 143-214, 2005
1042005
Sok: Verifiability notions for e-voting protocols
V Cortier, D Galindo, R Küsters, J Mueller, T Truderung
2016 IEEE Symposium on Security and Privacy (SP), 779-798, 2016
1032016
Adapting Helios for provable ballot privacy
D Bernhard, V Cortier, O Pereira, B Smyth, B Warinschi
European Symposium on Research in Computer Security, 335-354, 2011
992011
Deciding knowledge in security protocols under equational theories
M Abadi, V Cortier
International Colloquium on Automata, Languages, and Programming, 46-58, 2004
872004
A method for proving observational equivalence
V Cortier, S Delaune
2009 22nd IEEE Computer Security Foundations Symposium, 266-276, 2009
852009
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
European Symposium On Programming, 99-113, 2003
842003
Flatness is not a weakness
H Comon, V Cortier
International workshop on computer science logic, 262-276, 2000
842000
Safely composing security protocols
V Cortier, S Delaune
Formal Methods in System Design 34 (1), 1-36, 2009
832009
Computationally sound implementations of equational theories against passive adversaries
M Baudet, V Cortier, S Kremer
International Colloquium on Automata, Languages, and Programming, 652-663, 2005
832005
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
Science of Computer Programming 50 (1-3), 51-71, 2004
802004
The system can't perform the operation now. Try again later.
Articles 1–20