Analyzing security protocols with secrecy types and logic programs
From MaRDI portal
Publication:5178896
DOI10.1145/503272.503277zbMath1323.68259MaRDI QIDQ5178896
Publication date: 17 March 2015
Published in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/503272.503277
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N17: Logic programming
Related Items
Modeling and Verifying Time Sensitive Security Protocols with Constraints, Verification of cryptographic protocols: tagging enforces termination, Secrecy types for asymmetric communication., Universally composable symbolic security analysis, A static analysis of cryptographic processes: the denotational approach, Pattern-matching spi-calculus, Constraint Abstraction in Verification of Security Protocols