Skeletons, homomorphisms, and shapes: characterizing protocol executions

DOI10.1016/J.ENTCS.2007.02.029MaRDI QIDQ5262932zbMATH OpenOpenAlexFDO

Authors

Publication date 10 July 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2007.02.029

zbMATH Keywords

protocol analysisstrand spacesenumerating protocol executionsmechanizing protocol analysis

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Searching for Shapes in Cryptographic Protocols
• Transformations between Cryptographic Protocols
• Cryptographic Protocol Composition via the Authentication Tests
• scientific article; zbMATH DE number 3965967
• scientific article; zbMATH DE number 7301460

Cites work

• scientific article; zbMATH DE number 1956510 (Why is no real title available?)
• scientific article; zbMATH DE number 1884407 (Why is no real title available?)
• Authentication tests and the structure of bundles.
• Searching for Shapes in Cryptographic Protocols
• Using encryption for authentication in large networks of computers

Cited in

(4)

• Searching for Shapes in Cryptographic Protocols
• Choreographies with secure boxes and compromised principals
• On weakly cut-stable maps
• Transformations between Cryptographic Protocols

This page was built for publication: Skeletons, homomorphisms, and shapes: characterizing protocol executions

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