State and progress in strand spaces: proving fair exchange

DOI10.1007/S10817-010-9202-1zbMath1242.68100OpenAlexW2044073799MaRDI QIDQ437028

Joshua D. Guttman

Publication date: 17 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9202-1

zbMATH Keywords

verificationfair exchangecryptographic protocol analysisstrand spaces

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items (4)

Secure key management policies in strand spaces ⋮ Probabilistic annotations for protocol models. Dedicated to Joshua Guttman ⋮ Stateful applied pi calculus: observational equivalence and labelled bisimilarity ⋮ Formal modeling and analysis of fairness characterization of E-commerce protocols

Uses Software

• IMPS

Cites Work

• Unnamed Item
• Unnamed Item
• IMPS: An interactive mathematical proof system
• Authentication tests and the structure of bundles.
• Optimal efficiency of optimistic contract signing
• Cryptographic Protocol Composition via the Authentication Tests
• Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
• Optimistic fair exchange of digital signatures
• Trustworthy Global Computing
• Searching for Shapes in Cryptographic Protocols
• CONCUR 2003 - Concurrency Theory

This page was built for publication: State and progress in strand spaces: proving fair exchange