Compositional analysis of contract-signing protocols

DOI10.1016/j.tcs.2006.08.039zbMath1153.94447OpenAlexW2015985434MaRDI QIDQ860896

Anupam Datta, John C. Mitchell, Ante Derek, Michael Backes, Mathieu Turuani

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.039

zbMATH Keywords

logicsecurity protocolscontract signing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Deductive verification of alternating systems ⋮ A framework for compositional verification of security protocols ⋮ The Layered Games Framework for Specifications and Analysis of Security Protocols ⋮ Protocol Composition Logic (PCL)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure protocol composition
• Finite-state analysis of two contract signing protocols
• Optimistic fair exchange of digital signatures
• Automata, Languages and Programming
• CONCUR 2003 - Concurrency Theory