Analyzing security protocols with secrecy types and logic programs

DOI10.1145/503272.503277zbMath1323.68259OpenAlexW2016927062MaRDI QIDQ5178896

Martín Abadi, Bruno Blanchet

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17)

Related Items (7)

Secrecy types for asymmetric communication. ⋮ Constraint Abstraction in Verification of Security Protocols ⋮ Universally composable symbolic security analysis ⋮ Modeling and Verifying Time Sensitive Security Protocols with Constraints ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ Verification of cryptographic protocols: tagging enforces termination ⋮ Pattern-matching spi-calculus

This page was built for publication: Analyzing security protocols with secrecy types and logic programs