Asynchronous protocols for optimistic fair exchange

Asokan, N.; Shoup, Victor; Waidner, Michael

doi:10.1109/secpri.1998.674826

Cited by 206 publications

(197 citation statements)

References 7 publications

Supporting

Mentioning

194

Contrasting

Unclassified

Order By: Relevance

“…Accountability and verifiability are properties relevant for protocols involving trusted parties, e.g., voting [KRS10], auctions [PRST08], contract signing [ASW98], identity-based encryption etc. In [KTV10a], a formal definition of accountability is given that is independent of the specific application.…”

Section: Accountability and Verifiabilitymentioning

confidence: 99%

Deciding Epistemic and Strategic Properties of Cryptographic Protocols

Schnoor

2012

Computer Security – ESORICS 2012

View full text Add to dashboard Cite

Abstract. We propose a new, widely applicable model for analyzing knowledge-based (epistemic) and strategic properties of cryptographic protocols. We prove that the corresponding model checking problem with respect to an expressive epistemic strategic logic is decidable. As corollaries, we obtain decidability of complex security properties including coercion-resistance of voting protocols, accountability of protocols using a trusted third party, and abuse-freeness of contract signing protocols.

show abstract

Section: Accountability and Verifiabilitymentioning

confidence: 99%

Deciding Epistemic and Strategic Properties of Cryptographic Protocols

Schnoor

2012

Computer Security – ESORICS 2012

View full text Add to dashboard Cite

show abstract

“…The ASW protocol is an optimistic fair-exchange protocol for contract signing, proposed by Asokan, Shoup and Waidner in [ASW98]. Figure 1 shows the slightly simplified version of the Exchange Subprotocol of ASW (that we will simply refer afterwards as the ASW protocol) that Caleiro, Viganò and Basin have used in [CVB06] to illustrate that a direct interpretation of protocol narrations would be too naive.…”

Section: The Protocolmentioning

confidence: 99%

A Formal Semantics for Protocol Narrations

Briais

Nestmann

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

Protocol narrations are a widely-used informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also been informally "turned into" a number of formal protocol descriptions, e.g., using the spi-calculus. In this paper, we propose a direct formal operational semantics for protocol narrations that fixes a particular and, as we argue, well-motivated interpretation on how the involved protocol participants are supposed to execute. Based on this semantics, we explain and formally justify a natural and precise translation of narrations into spi-calculus. An optimised translation has been implemented in OCaml, and we report on case studies that we have carried out using the tool.

show abstract

“…Another approach focuses on increasing the overall efficiency by using T T P s. Notable works in this direction are the three-message off-line protocol for certified e-mail presented in [18] and the efficient off-line fair exchange protocols in [1,2,7]. The protocol in [1] makes use of verifiable escrow schemes implemented via a cut and choose interactive proof.…”

Section: Related Workmentioning

confidence: 99%

“…Some of the off-line protocols are not monotonic, for instance, the protocol in [2] requires signatures to be revoked in order to guarantee fairness. Among monotonic and off-line protocols, we believe those in [18,1] represent the state-of-the-art in the field.…”

Section: Analysis and Comparisonsmentioning

confidence: 99%

Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption

Ateniese

Nita-Rotaru

2002

Topics in Cryptology — CT-RSA 2002

View full text Add to dashboard Cite

Abstract. In this paper we present a certified e-mail system which provides fairness while making use of a T T P only in exceptional circumstances. Our system guarantees that the recipient gets the content of the e-mail if and only if the sender receives an incontestable proof-of-receipt. Our protocol involves two communicating parties, a sender and a recipient, but only the recipient is allowed to misbehave. Therefore, in case of dispute, the sender solicits T T P 's arbitration without involving the recipient. This feature makes our protocols very attractive in real-world environments in which recipients would prefer to assume a passive role rather than being actively involved in dispute resolutions caused by malicious senders. In addition, in our protocol, the recipient can be stateless, i.e., it does not need to keep state to ensure fairness.

show abstract

Asynchronous protocols for optimistic fair exchange

Cited by 206 publications

References 7 publications

Deciding Epistemic and Strategic Properties of Cryptographic Protocols

Deciding Epistemic and Strategic Properties of Cryptographic Protocols

A Formal Semantics for Protocol Narrations

Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption

Contact Info

Product

Resources

About