The following pages link to Véronique Cortier (Q391119):
Displayed 50 items.
- Deciding equivalence-based properties using constraint solving (Q391121) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- Modeling and verifying ad hoc routing protocols (Q462483) (← links)
- A generic security API for symmetric key management on cryptographic devices (Q462497) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Safely composing security protocols (Q1028731) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Security properties: two agents are sufficient (Q1887730) (← links)
- A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
- Checking trace equivalence: how to get rid of nonces? (Q2165459) (← links)
- When are three voters enough for privacy properties? (Q2165487) (← links)
- Efficiently deciding equivalence for standard primitives and phases (Q2167745) (← links)
- Belenios: a simple private and verifiable electronic voting system (Q2303376) (← links)
- Equivalence properties by typing in cryptographic branching protocols (Q2324201) (← links)
- A note on maximally repeated sub-patterns of a point set (Q2501569) (← links)
- (Q2753678) (← links)
- Explicit Randomness is not Necessary when Modeling Probabilistic Encryption (Q2866728) (← links)
- Analysing Routing Protocols: Four Nodes Topologies Are Sufficient (Q2894310) (← links)
- Security Proof with Dishonest Keys (Q2894320) (← links)
- Secure Composition of Protocols (Q2902913) (← links)
- (Q2917407) (← links)
- Deciding security properties for cryptographic protocols. application to key cycles (Q2946596) (← links)
- YAPA (Q2946688) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- (Q3113670) (← links)
- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties (Q3190130) (← links)
- Electronic Voting: How Logic Can Help (Q3192178) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
- Combining Algorithms for Deciding Knowledge in Security Protocols (Q3525004) (← links)
- Relating Two Standard Notions of Secrecy (Q3613345) (← links)
- YAPA: A Generic Tool for Computing Intruder Knowledge (Q3636824) (← links)
- About the decision of reachability for register machines (Q4405553) (← links)
- (Q4417886) (← links)
- (Q4447230) (← links)
- (Q4535056) (← links)
- Tractable Inference Systems: An Extension with a Deducibility Predicate (Q4928430) (← links)
- (Q4938629) (← links)
- Typing Messages for Free in Security Protocols (Q4972165) (← links)
- Deciding Security for Protocols with Recursive Tests (Q5200014) (← links)
- (Q5275398) (← links)
- From Security Protocols to Pushdown Automata (Q5277904) (← links)
- Programming Languages and Systems (Q5316562) (← links)
- Practical Everlasting Privacy (Q5326751) (← links)
- From Security Protocols to Pushdown Automata (Q5327429) (← links)
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions (Q5385984) (← links)
- Deciding Key Cycles for Security Protocols (Q5387901) (← links)
- Relating two standard notions of secrecy (Q5426068) (← links)
- Safely Composing Security Protocols (Q5458848) (← links)