Compositional analysis of contract-signing protocols
type: Item
instance of: scholarly article
title: Compositional analysis of contract-signing protocols
zbMATH Open document ID: 1153.94447
author: Michael Backes
author: Anupam Datta
author: Ante Derek
author: John Mitchell
author: Mathieu Turuani
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5083533
zbMATH Keywords: security protocols
zbMATH Keywords: contract signing
zbMATH Keywords: logic
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.08.039
OpenAlex ID: W2015985434
cites work: Optimistic fair exchange of digital signatures
cites work: CONCUR 2003 - Concurrency Theory
cites work: Secure protocol composition
cites work: Automata, Languages and Programming
cites work: Q4941873
cites work: Q2762894
cites work: Q4739526
cites work: Finite-state analysis of two contract signing protocols
cites work: Q4250644
DOI: 10.1016/J.TCS.2006.08.039
Recommended article: Formal analysis of multiparty contract signing
Recommended article: STACS 2005
Recommended article: Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
Recommended article: Finite-state analysis of two contract signing protocols
Recommended article: CONCUR 2005 – Concurrency Theory
Recommended article: Synthesizing Protocols for Digital Contract Signing
Recommended article: Programming Languages and Systems
Recommended article: Deciding strategy properties of contract-signing protocols
Recommended article: Formal analysis of fairness for optimistic multiparty contract signing protocol
description: scientific article; zbMATH DE number 5083533