scientific article; zbMATH DE number 7559487

DOI10.4230/LIPIcs.CONCUR.2020.31MaRDI QIDQ5089298

Felix Stutz, Emanuele D'Osualdo

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1911.05430

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

security protocolsideal completions for WSTSinfinite-state verification

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Branch-well-structured transition systems and extensions

Cites Work

• Unnamed Item
• Bounding messages for free in security protocols -- extension to various security properties
• An NP decision procedure for protocol insecurity with XOR
• Handling infinitely branching well-structured transition systems
• Verification of cryptographic protocols: tagging enforces termination
• Approaching the coverability problem continuously
• Automated verification of selected equivalences for security protocols
• Ideal Abstractions for Well-Structured Transition Systems
• Type-Based Automated Verification of Authenticity in Asymmetric Cryptographic Protocols
• SPEC: An Equivalence Checker for Security Protocols
• Bounds on Mobility
• Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
• Forward Analysis of Depth-Bounded Processes
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• From Security Protocols to Pushdown Automata
• Automated Verification of Equivalence Properties of Cryptographic Protocols
• Computer Aided Verification
• A Proof Theoretic Analysis of Intruder Theories

This page was built for publication: