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

References

Publications referenced by this paper.
Showing 1-10 of 126 references

Three applications of the oblivious transfer

1981
View 7 Excerpts
Highly Influenced

Lynch: Distributed Algorithms; Morgan Kaufmann

A Nancy
San Francisco • 1996
View 3 Excerpts
Highly Influenced

Michael Steiner

Gérard Lacoste, Birgit Pfitzmann
Michael Waidner (eds.): SEMPER: Secure Electronic Marketplace for Europe; LNCS 1854, Springer-Verlag, Berlin • 2000
View 1 Excerpt

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

Birgit Pfitzmann
IBM Research Division, Zürich, June 2000; accepted for 7th ACM Conference on Computer and Communications Security, Athens, November • 2000

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

Birgit Pfitzmann, Matthias Schunter
IBM Research Division, Zürich, May • 2000

Provably Secure Certified Mail; IBM Research Report RZ

Birgit Pfitzmann, Matthias Schunter, Michael Waidner
IBM Research Division, • 2000

Formal Fairness Proofs for Optimistic Contract Signing Protocols; Diploma thesis

Jörg Veit
Saarland University, • 1999
View 2 Excerpts

Similar Papers

Loading similar papers…