Secrecy by typing in security protocols
From MaRDI portal
Publication:3158557
DOI10.1145/324133.324266zbMath1064.94542OpenAlexW1991354622MaRDI QIDQ3158557
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/324133.324266
Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (19)
Secrecy types for asymmetric communication. ⋮ Security types preserving compilation ⋮ Cryptographically-masked flows ⋮ Automated type-based analysis of injective agreement in the presence of compromised principals ⋮ Controlling file access with types ⋮ Automated verification of selected equivalences for security protocols ⋮ Secrecy and group creation ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ Types for the ambient calculus ⋮ Pattern-matching spi-calculus ⋮ Linearity and bisimulation ⋮ Typed ψ-calculi ⋮ Cryptographic Analysis in Cubic Time ⋮ Techniques for Security Checking ⋮ Analysis of security protocols as open systems ⋮ Static analysis for the \(\pi\)-calculus with applications to security ⋮ Type-based information flow analysis for the \(\pi\)-calculus ⋮ Noninterference for concurrent programs and thread systems
This page was built for publication: Secrecy by typing in security protocols
