Secrecy types for asymmetric communication.

DOI10.1016/S0304-3975(02)00863-0zbMath1038.68081OpenAlexW2105237010MaRDI QIDQ1874278

Bruno Blanchet, Martín Abadi

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00863-0

zbMATH Keywords

security protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Linked data privacy ⋮ Secrecy and group creation ⋮ Typed ψ-calculi ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• Three systems for cryptographic protocol analysis
• Information flow inference for free
• Secrecy by typing in security protocols
• Using encryption for authentication in large networks of computers
• Analyzing security protocols with secrecy types and logic programs

This page was built for publication: Secrecy types for asymmetric communication.