Using Smart Cards for Fair Exchange

Vogt, Holger; Pagnia, Henning; Gärtner, Felix

doi:10.1007/3-540-45598-1_11

Cited by 17 publications

(13 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of the protocol comes from [Vogt et al, 2001], but there are some differences. A version of the protocol that has an online payment system (bank) is considered.…”

Section: Resultsmentioning

confidence: 99%

“…It has been shown that fair exchange is impossible without a trusted third party [Pagnia and Gärtner, 1999]. A protocol for fair exchange of money for an item using customer's smart card as a trusted party is described in [Vogt et al, 2001]. This protocol considers time-sensitive items and is adapted for wireless and mobile applications which lack a reliable communication channel.…”

Section: Introductionmentioning

confidence: 99%

“…Here a version of that protocol is considered. We describe, in contrast to [Vogt et al, 2001], the exact contents of all messages. The protocol is formally specified and the fairness properties are verified using a finite-state model checker.…”

Section: Introductionmentioning

confidence: 99%

“…The idea of this protocol comes from [Vogt et al, 2001], but there are some differences (see section 6). Fairness properties for this protocol are formulated in the regular alternation-free /i-calculus [Mateescu, 2000] and verified using the model checker EVALUATOR 3.0 [Mateescu, 2000] from the CADP tool set [Fernandez et al, 1996].…”

Section: Introductionmentioning

confidence: 99%

“…

AbstractWe formally specify a payment protocol described in [Vogt et al, 2001]. This protocol is intended for fair exchange of time-sensitive data.

…”

mentioning

confidence: 99%

See 4 more Smart Citations

Formal Analysis of a Fair Payment Protocol

Cederquist

Dashti

Formal Aspects in Security and Trust

View full text Add to dashboard Cite

We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the fiCKL language is used to formalize the protocol. Fair exchange properties are expressed in the regular alternation-free /x-calculus. These properties are then verified using the finite state model checker from the CADP toolset. Proving fairness without resilient communication channels is impossible. We use the Dolev-Yao intruder, but since the conventional Dolev-Yao intruder violates this assumption, it is forced to comply to the resilient communication channel assumption.

show abstract

“…The idea of the protocol comes from [Vogt et al, 2001], but there are some differences. A version of the protocol that has an online payment system (bank) is considered.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…

AbstractWe formally specify a payment protocol described in [Vogt et al, 2001]. This protocol is intended for fair exchange of time-sensitive data.

…”

mentioning

confidence: 99%

See 3 more Smart Citations

Formal Analysis of a Fair Payment Protocol

Cederquist

Dashti

Formal Aspects in Security and Trust

View full text Add to dashboard Cite

show abstract

Systematic Development of a Family of Fair Exchange Protocols

Ezhilchelvan

Shrivastava

2004

Data and Applications Security XVII

View full text Add to dashboard Cite

Abstract:Exchange protocols play an important role in application areas such as ecommerce where protocol participants require mutual guarantees that a transaction involving exchange of items has taken place in a specific manner. A protocol is fair if no protocol participant can gain any advantage over an honest participant by misbehaving. This paper presents a family of fair exchange protocols for two participants under a variety of assumptions concerning participant misbehaviour, node reliability and message delays.

show abstract

An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items

Terada

Mori

Hongo

2006

Smart Card Research and Advanced Applications

View full text Add to dashboard Cite

Fair exchange protocols are important in realizing safe electronic commerce. In particular, optimistic fair exchange protocols, which involve a trusted third party only when mutual communication between exchanging parties fails, are the most promising development because of their efficiency. Unfortunately, however, existing optimistic protocols place restrictions on the items that can be exchanged, i.e., at least one item must be a "strongly generatable" item such as a digital signature. Without this requirement, only weak fairness that requires (expensive) external dispute resolution processes (e.g. trials in court) after exchange failure can be assured. This paper proposes a novel fair exchange method that enables parties to fairly exchange arbitrary items in an optimistic manner. This is achieved by realizing an optimistic non-blocking atomic commitment (NBAC) protocol between two smartcards and adapting the known result that fair exchange can be reduced to NBAC among trusted processes.

show abstract

Using Smart Cards for Fair Exchange

Cited by 17 publications

References 3 publications

Formal Analysis of a Fair Payment Protocol

Formal Analysis of a Fair Payment Protocol

Systematic Development of a Family of Fair Exchange Protocols

An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items

Contact Info

Product

Resources

About