Skeletons, homomorphisms, and shapes: characterizing protocol executions

DOI10.1016/J.ENTCS.2007.02.029zbMATH Open1316.94067OpenAlexW2127951578MaRDI QIDQ5262932FDOQ5262932

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

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

zbMATH Keywords

protocol analysisstrand spacesenumerating protocol executionsmechanizing protocol analysis

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Using encryption for authentication in large networks of computers
• Title not available (Why is that?)
• Authentication tests and the structure of bundles.
• Searching for Shapes in Cryptographic Protocols
• Title not available (Why is that?)

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)