FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5191532
DOI10.1007/b94618zbMath1205.94097OpenAlexW2246750081MaRDI QIDQ5191532
No author found.
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, A (restricted) quantifier elimination for security protocols, Deciding equivalence-based properties using constraint solving, Bounded memory Dolev-Yao adversaries in collaborative systems, Challenges in the Automated Verification of Security Protocols, Bounding messages for free in security protocols -- extension to various security properties, Verification of cryptographic protocols: tagging enforces termination, A method for symbolic analysis of security protocols, A computational interpretation of Dolev-Yao adversaries, A decidable class of security protocols for both reachability and equivalence properties, Bounding Messages for Free in Security Protocols, Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif, Bounded memory protocols
