Secrecy by typing in security protocols

DOI10.1145/324133.324266MaRDI QIDQ3158557zbMATH OpenOpenAlexFDO

Authors Martín Abadi

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1701344
• Analyzing security protocols with secrecy types and logic programs
• Analyzing security protocols with secrecy types and logic programs
• Secrecy types for asymmetric communication.
• Typing messages for free in security protocols

Cited in

(36)

• Noninterference for concurrent programs and thread systems
• Controlling file access with types
• Secrecy and group creation
• Analysing input/output-capabilities of mobile processes with a generic type system
• Analysis of security protocols as open systems
• Static analysis for the \(\pi\)-calculus with applications to security
• Secrecy types for asymmetric communication.
• Typing and compositionality for security protocols: a generalization to the geometric fragment
• Automated verification of selected equivalences for security protocols
• Types for the ambient calculus
• Pattern-matching spi-calculus
• Type-based information flow analysis for the \(\pi\)-calculus
• Cryptographic analysis in cubic time
• Techniques for security checking: non-interference vs control flow analysis
• Relating two standard notions of secrecy
• Typed ψ-calculi
• Secrecy for security protocols
• Inductive Proofs of Computational Secrecy
• Analyzing security protocols with secrecy types and logic programs
• Relating Two Standard Notions of Secrecy
• scientific article; zbMATH DE number 1330433 (Why is no real title available?)
• scientific article; zbMATH DE number 1956551 (Why is no real title available?)
• scientific article; zbMATH DE number 1927556 (Why is no real title available?)
• Automated type-based analysis of injective agreement in the presence of compromised principals
• Typing messages for free in security protocols
• Verifying secrets and relative secrecy
• Analyzing security protocols with secrecy types and logic programs
• Computational Secrecy by Typing for the Pi Calculus
• Relating two standard notions of secrecy
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Computational Science and Its Applications – ICCSA 2004
• CONCUR 2005 – Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Security types preserving compilation
• Cryptographically-masked flows
• Linearity and bisimulation

This page was built for publication: Secrecy by typing in security protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158557)