# Optimistic Fair Exchange

@inproceedings{SchunterOptimisticFE, title={Optimistic Fair Exchange}, author={Matthias Schunter} }

A fair exchange guarantees that a participant only reveals its items (such as signatures, payments, or data) if it receives the expected items in exchange. Efficient fair exchange requires a so-called third party, which is assumed to be correct. Optimistic fair exchange involves this third party only if needed, i.e., if the participants cheat or disagree. In Part I, we prove lower bounds on the message and time complexity of two particular instances of fair exchange in varying models, namely… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

Showing 1-10 of 21 extracted citations

## SEMPER - Secure Electronic Marketplace for Europe

View 20 Excerpts

Highly Influenced

## Keeping Fairness Alive Design and formal verification of optimistic fair exchange protocols

View 4 Excerpts

Highly Influenced

## Fair Exchange

View 4 Excerpts

Highly Influenced

## Optimal Fair Computation

View 3 Excerpts

## Generalizing Multi-party Contract Signing

View 1 Excerpt

## FairCASH based on loss resistant teleportation

View 3 Excerpts

## Risk Balance in Optimistic Non-repudiation Protocols

View 1 Excerpt

#### References

##### Publications referenced by this paper.

Showing 1-10 of 126 references

## Three applications of the oblivious transfer

View 7 Excerpts

Highly Influenced

## Lynch: Distributed Algorithms; Morgan Kaufmann

View 3 Excerpts

Highly Influenced

## Michael Steiner

View 1 Excerpt

## Michael Waidner: Composition and Integrity Preservation of Secure Reactive Systems; IBM Research Report RZ 3234 (#93280) 06/12/00

## Michael Waidner: Secure Reactive Systems; IBM Research Report RZ 3206 (#93252) 02/14/2000

## Provably Secure Certified Mail; IBM Research Report RZ

## Formal Fairness Proofs for Optimistic Contract Signing Protocols; Diploma thesis

View 2 Excerpts