Pages that link to "Item:Q5191511"

The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191511):

Displaying 25 items.

• Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
• Deducibility constraints and blind signatures (Q462488) (← links)
• An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
• Simulation relations for alternating Büchi automata (Q557801) (← links)
• A method for symbolic analysis of security protocols (Q557806) (← links)
• Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
• Deciding knowledge in security protocols under equational theories (Q860894) (← links)
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
• Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
• Easy intruder deduction problems with homomorphisms (Q1045939) (← links)
• Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
• Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
• Hierarchical combination of intruder theories (Q2482450) (← links)
• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
• The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols (Q3184787) (← links)
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
• Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
• Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (Q3636822) (← links)
• Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
• (Q4993330) (← links)
• Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
• Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
• Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)