CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMATH Open1134.68441OpenAlexW1737342522MaRDI QIDQ5897484FDOQ5897484

Authors: Christian Haack, Alan Jeffrey 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Recommendations

• scientific article; zbMATH DE number 1832233
• Secrecy by typing in security protocols
• CONCUR 2005 – Concurrency Theory
• Modelling and checking timed authentication of security protocols
• A calculus for cryptographic protocols: The spi calculus

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
• Pattern-matching spi-calculus
• Automated type-based analysis of injective agreement in the presence of compromised principals
• CONCUR 2005 – Concurrency Theory
• Linked data privacy

This page was built for publication: CONCUR 2005 – Concurrency Theory

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