The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Véronique Cortier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martín Abadi, Véronique Cortier
    Deciding Knowledge in Security Protocols under (Many More) Equational Theories. [Citation Graph (0, 0)][DBLP]
    CSFW, 2005, pp:62-76 [Conf]
  2. Véronique Cortier, Jonathan K. Millen, Harald Rueß
    Proving Secrecy is Easy Enough. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:97-0 [Conf]
  3. Hubert Comon, Véronique Cortier
    Flatness Is Not a Weakness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:262-276 [Conf]
  4. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    Relating Two Standard Notions of Secrecy. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:303-318 [Conf]
  5. Hubert Comon-Lundh, Véronique Cortier
    Security Properties: Two Agents Are Sufficient. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:99-113 [Conf]
  6. Véronique Cortier, Bogdan Warinschi
    Computationally Sound, Automated Proofs for Security Protocols. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:157-171 [Conf]
  7. Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
    Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:176-187 [Conf]
  8. Martín Abadi, Véronique Cortier
    Deciding Knowledge in Security Protocols Under Equational Theories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:46-58 [Conf]
  9. Mathieu Baudet, Véronique Cortier, Steve Kremer
    Computationally Sound Implementations of Equational Theories Against Passive Adversaries. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:652-663 [Conf]
  10. Hubert Comon, Véronique Cortier, John Mitchell
    Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:682-693 [Conf]
  11. Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Decidable Fragments of Simultaneous Rigid Reachability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:250-260 [Conf]
  12. Véronique Cortier, Eugen Zalinescu
    Deciding Key Cycles for Security Protocols. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:317-331 [Conf]
  13. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. [Citation Graph (0, 0)][DBLP]
    PPDP, 2005, pp:12-22 [Conf]
  14. Hubert Comon-Lundh, Véronique Cortier
    New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:148-164 [Conf]
  15. Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na
    A note on maximally repeated sub-patterns of a point set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1965-1968 [Journal]
  16. Véronique Cortier
    About the decision of reachability for register machines. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:4, pp:341-358 [Journal]
  17. Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade
    A survey of algebraic properties used in cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2006, v:14, n:1, pp:1-43 [Journal]
  18. Hubert Comon-Lundh, Véronique Cortier
    Security properties: two agents are sufficient. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2004, v:50, n:1-3, pp:51-71 [Journal]
  19. Martín Abadi, Véronique Cortier
    Deciding knowledge in security protocols under equational theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:367, n:1-2, pp:2-32 [Journal]
  20. Hubert Comon, Véronique Cortier
    Tree automata with one memory set constraints and cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:143-214 [Journal]
  21. Véronique Cortier
    Vérifier les protocoles cryptographiques. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2005, v:24, n:1, pp:115-140 [Journal]
  22. Véronique Cortier, Ralf Küsters, Bogdan Warinschi
    A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2007, pp:422-437 [Conf]
  23. Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu
    Synthesizing Secure Protocols. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2007, pp:406-421 [Conf]
  24. Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
    Combining Algorithms for Deciding Knowledge in Security Protocols. [Citation Graph (0, 0)][DBLP]
    FroCos, 2007, pp:103-117 [Conf]
  25. Véronique Cortier, Stéphanie Delaune
    Deciding Knowledge in Security Protocols for Monoidal Equational Theories. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:196-210 [Conf]
  26. Véronique Cortier, Gavin Keighren, Graham Steel
    Automatic Analysis of the Security of XOR-Based Key Management Schemes. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:538-552 [Conf]
  27. Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu
    Relating two standard notions of secrecy [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  28. Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
    Explicit Randomness is not Necessary when Modeling Probabilistic Encryption [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  29. Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
    Deciding security properties for cryptographic protocols. Application to key cycles [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi
    Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:186, n:, pp:49-65 [Journal]

  31. Computational soundness of observational equivalence. [Citation Graph (, )][DBLP]


  32. A Formal Theory of Key Conjuring. [Citation Graph (, )][DBLP]


  33. A Method for Proving Observational Equivalence. [Citation Graph (, )][DBLP]


  34. Modeling and Verifying Ad Hoc Routing Protocols. [Citation Graph (, )][DBLP]


  35. Protocol Composition for Arbitrary Primitives. [Citation Graph (, )][DBLP]


  36. Relating two standard notions of secrecy. [Citation Graph (, )][DBLP]


  37. A Generic Security API for Symmetric Key Management on Cryptographic Devices. [Citation Graph (, )][DBLP]


  38. Safely Composing Security Protocols. [Citation Graph (, )][DBLP]


  39. YAPA: A Generic Tool for Computing Intruder Knowledge. [Citation Graph (, )][DBLP]


  40. Verification of Security Protocols. [Citation Graph (, )][DBLP]


  41. YAPA: A generic tool for computing intruder knowledge [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002