Abstract
The recent surge in popularity of e-commerce prompted a lot of The recent surge in popularity of e-commerce prompted a lot of activity in the area of electronic payments. Solutions have been developed for cash, credit card and check-based electronic transactions. Much less attention has been paid to non-monetary commerce such as barter. In this paper we discuss the notion of “secure group barter” or multi-party fair exchange. We develop a classification of types of barter schemes and present new cryptographic protocols for multi-party exchange with fairness. These protocols assume the presence of a “semi-trusted neutral party”.
Research supported by the Defense Advanced Research Project Agency, Information Technology Office (DARPA-ITO), under contract DABT63-97-C-0031.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Asokan, V. Schoup, and M. Waidner. Optimistic fair exchange of digital signatures. Research Report RZ 2892 (# 90840), IBM Research, December 1997.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (# 90840), IBM Research, December 1996.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In ACM Conference on Computer and Communication Security, April 1997.
D. Beaver. Security, fault tolerance and communication complexity in distributed systems. Ph.D. Thesis, Harvard University, May 1990.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault tolerant distributed computation. In Proceedings of ACM STOC 1988, 1988.
M. Blum. How to exchange (secret) keys. ACM Transactions on Computer Systems, 1:175–193, 1983.
J. Camp, M. Harkavy, J. Tygar, and B. Yee. Anonymous atomic transactions. In 2nd USENIX Workshop on Electronic Commerce, pages 123–134, November 1996.
D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proceedings of ACM STOC 1988, 1988.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In IEEE Fondations of Computer Science, 1985.
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In IEEE Fondations of Computer Science, 1987.
M. Franklin and M. Reiter. Fair exchange with a semi-trusted third party. In ACM Conference on Computer and Communication Security, April 1997.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of ACM STOC 1987, 1987.
S. Ketchpel and H. Garcia-Molina. Making trust explicit in distributed commerce transactions. In IEEE ICDCS, 1996.
M. Luby, S. Micali, and C. Rackoff. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In IEEE Symposium on Foundations of Computer Science, pages 11–21, November 1984.
J. Tygar. Atomicity in electronic commerce. In ACM Symposium on Principles of Distributed Computing, pages 8–26, 1996.
U. Vazirani and V. Vazirani. Trapdoor pseudo-random number generators, with applications to protocol design. In IEEE Symposium on Foundations of Computer Science, pages 23–30, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, M., Tsudik, G. (1998). Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. In: Hirchfeld, R. (eds) Financial Cryptography. FC 1998. Lecture Notes in Computer Science, vol 1465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055475
Download citation
DOI: https://doi.org/10.1007/BFb0055475
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64951-9
Online ISBN: 978-3-540-53918-6
eBook Packages: Springer Book Archive