Véronique Cortier
Véronique Cortier
CNRS, LORIA
Verifierad e-postadress på loria.fr - Startsida
Titel
Citeras av
Citeras av
År
A survey of algebraic properties used in cryptographic protocols
V Cortier, S Delaune, P Lafourcade
Journal of Computer Security 14 (1), 1-43, 2006
2082006
Deciding knowledge in security protocols under equational theories
M Abadi, V Cortier
Theoretical Computer Science 367 (1-2), 2-32, 2006
1762006
Computationally sound, automated proofs for security protocols
V Cortier, B Warinschi
European Symposium on Programming, 157-171, 2005
1722005
Attacking and fixing Helios: An analysis of ballot secrecy
V Cortier, B Smyth
Journal of Computer Security 21 (1), 89-148, 2013
1712013
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
1222003
Computational soundness of observational equivalence
H Comon-Lundh, V Cortier
Proceedings of the 15th ACM conference on Computer and communications …, 2008
1122008
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
1022011
Tree automata with one memory set constraints and cryptographic protocols
H Comon, V Cortier
Theoretical Computer Science 331 (1), 143-214, 2005
992005
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
982014
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
872015
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
862011
Deciding knowledge in security protocols under equational theories
M Abadi, V Cortier
International Colloquium on Automata, Languages, and Programming, 46-58, 2004
852004
Safely composing security protocols
V Cortier, S Delaune
Formal Methods in System Design 34 (1), 1-36, 2009
812009
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
European Symposium On Programming, 99-113, 2003
802003
A method for proving observational equivalence
V Cortier, S Delaune
2009 22nd IEEE Computer Security Foundations Symposium, 266-276, 2009
782009
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
782005
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
Science of Computer Programming 50 (1-3), 51-71, 2004
782004
Flatness is not a weakness
H Comon, V Cortier
International workshop on computer science logic, 262-276, 2000
782000
Tree automata with one memory, set constraints, and ping-pong protocols
H Comon, V Cortier, J Mitchell
International Colloquium on Automata, Languages, and Programming, 682-693, 2001
722001
Deciding security properties for cryptographic protocols. application to key cycles
H Comon-Lundh, V Cortier, E Zălinescu
ACM Transactions on Computational Logic (TOCL) 11 (2), 1-42, 2010
712010
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20