FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B94618zbMath1205.94078OpenAlexW2246750081MaRDI QIDQ5191511

Yannick Chevalier, Mathieu Turuani, Ralf Küsters, Michaël Rusinowitch

Publication date: 6 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94618

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (25)

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

This page was built for publication: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science