Travelled to:
1 × Austria
1 × Brazil
1 × Czech Republic
1 × Finland
1 × Germany
1 × Greece
1 × Hungary
1 × Latvia
1 × Russia
1 × Spain
1 × United Kingdom
2 × Poland
2 × USA
3 × Portugal
Collaborated with:
∅ H.Comon-Lundh S.Delaune H.Comon M.Baudet M.Rusinowitch E.Zalinescu B.Warinschi M.Abadi G.Scerri V.Cheval A.Plet R.Chrétien M.Arnaud G.Keighren G.Steel S.Kremer J.Mitchell H.Ganzinger F.Jacquemard M.Veanes
Talks about:
protocol (9) secur (8) decid (4) comput (3) cryptograph (2) knowledg (2) fragment (2) automata (2) theori (2) length (2)
Person: Véronique Cortier
DBLP: Cortier:V=eacute=ronique
Contributed to:
Wrote 19 papers:
- IJCAR-2014-Cortier #how #logic
- Electronic Voting: How Logic Can Help (VC), pp. 16–25.
- CADE-2013-Comon-LundhCS #deduction
- Tractable Inference Systems: An Extension with a Deducibility Predicate (HCL, VC, GS), pp. 91–108.
- CAV-2013-ChevalCP #how #privacy
- Lengths May Break Privacy — Or How to Check for Equivalences with Length (VC, VC, AP), pp. 708–723.
- ICALP-v2-2013-ChretienCD #automaton #protocol #security
- From Security Protocols to Pushdown Automata (RC, VC, SD), pp. 137–149.
- CADE-2011-ArnaudCD #protocol #recursion #security #testing
- Deciding Security for Protocols with Recursive Tests (MA, VC, SD), pp. 49–63.
- RTA-2009-BaudetCD #named
- YAPA: A Generic Tool for Computing Intruder Knowledge (MB, VC, SD), pp. 148–163.
- VMCAI-2009-Cortier #protocol #security #verification
- Verification of Security Protocols (VC), pp. 5–13.
- TACAS-2007-CortierKS #analysis #automation #security
- Automatic Analysis of the Security of XOR-Based Key Management Schemes (VC, GK, GS), pp. 538–552.
- CSL-2006-CortierRZ #standard
- Relating Two Standard Notions of Secrecy (VC, MR, EZ), pp. 303–318.
- ESOP-2005-CortierW #automation #protocol #proving #security
- Computationally Sound, Automated Proofs for Security Protocols (VC, BW), pp. 157–171.
- ICALP-2005-BaudetCK #equation #implementation
- Computationally Sound Implementations of Equational Theories Against Passive Adversaries (MB, VC, SK), pp. 652–663.
- PPDP-2005-CortierRZ #encryption #protocol #verification
- A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures (VC, MR, EZ), pp. 12–22.
- ICALP-2004-AbadiC #equation #protocol #security
- Deciding Knowledge in Security Protocols Under Equational Theories (MA, VC), pp. 46–58.
- ESOP-2003-Comon-LundhC #security
- Security Properties: Two Agents Are Sufficient (HCL, VC), pp. 99–113.
- RTA-2003-Comon-LundhC #decidability #encryption #first-order #logic #protocol
- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (HCL, VC), pp. 148–164.
- ICALP-2001-ComonCM #automaton #constraints #memory management #protocol #set
- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
- CSL-2000-ComonC
- Flatness Is Not a Weakness (HC, VC), pp. 262–276.
- ICALP-1999-CortierGJV #decidability #reachability
- Decidable Fragments of Simultaneous Rigid Reachability (VC, HG, FJ, MV), pp. 250–260.
- CSL-2020-Cortier #protocol #security #verification
- Verification of Security Protocols (Invited Talk) (VC), p. 2.