Indrajit Ray
Abstract
Many business transactions over the Internet involve the exchange of digital products between two parties - electronic mails, digital audio and video, electronic contract signing and digital signatures, to name a few. Often these transactions occur between players that do not trust each other. To facilitate such transactions, a number of secure protocols have been proposed. The main objective of these protocols is: either both the parties obtain each other's items or none do. Sometimes it is not possible to meet the above objective and researchers have aimed for a weaker objective: gather evidence during protocol execution using which an honest party can prove his case. Protocols which meet any of the two objectives are collectively termed fair exchange protocols. In this paper we review some of the work done on such fair exchange protocols and identify areas that still need to be addressed.
- ASOKAN, N., SCHUNTER, M., AND WAIDNER, M. 1997. Optimistic Protocols for Fair Exchange. In Proceedings of the 4th ACM Conference on Computer and Communications Security, T. Matsumoto, Ed. Zurich, Switzerland, 7-17.]] Google Scholar
Digital Library
- ASOKAN, N., SHOUP, V., AND WAIDNER, M. 1998. Optimistic Fair Exchange of Digital Signatures. In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Eurocrypt '98. Helsinki, Finland, 591-606.]]Google ScholarCross Ref
- BAHREMAN, A. AND TYGAR, J. D. 1994. Certified Electronic Mail. In Proceedings of the Internet Society Symposium on Network and Distributed Systems Security. 3-19.]]Google Scholar
- BAO, F., DENG, R.H., AND MAO, W. 1998. Efficient and Practical Fair Exchange Protocols with Off-line TTP. In Proceedings of the IEEE Symposium on Security and Privacy. Oakland, California.]]Google Scholar
- BEN-OR, M., GOLDRICH, O., MICALI, S., AND RIVEST, R. 1990. "a fair protocol for signing contracts". IEEE Transactions on Information Theory 36, 1, 40-46.]]Google ScholarDigital Library
- BLUM, M. 1983. How to Exchange (Secret) Keys. ACM Transactions on Computer Systems 1, 2 (May), 175-193.]] Google ScholarDigital Library
- CHAUM, D. 1985. "security without identification: Transaction systems to make big brother obsolete". Communications of the ACM 28, 10 (Oct.), 1030-1044.]] Google ScholarDigital Library
- COX, B., TYGAR, J.D., AND SIRBU, M. 1995. NetBill Security and Transaction Protocol. In Proceedings of the 1st USENIX Workshop in Electronic Commerce. 77-88.]] Google ScholarDigital Library
- DENG, R. H., GONG, L., LAZAR, A. A., AND WANG, W. 1996. Practical Protocols for Certified Electronic Mail. Journal of Network and System Management 4, 3, 279-297.]]Google ScholarCross Ref
- EVEN, S., GOLDREICH, O., AND LEMPEL, A. 1985. A Randomized Protocol for Signing Contracts. Communications of the ACM 28, 6 (June), 637-647.]] Google ScholarDigital Library
- FRANKLIN, M. K. AND REITER, M. K. 1997. Fair Exchange with a semi-trusted Third Party. In Proceedings of the 4th ACM Conference on Computer and Communications Security, T. Matsumoto, Ed. Zurich, Switzerland, 1-6.]] Google ScholarDigital Library
- KETCHPEL, S. 1995. Transaction Protection for Information Buyers and Sellers. In Proceedings of the Dartmouth Institute for Advanced Graduate Studies '95: Electronic Publishing and the Information Superhighway.]]Google Scholar
- LOW, S., MAXEMCHUK, N., AND PAUL, S. 1994. Anonymous Credit Cards. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, J. Stern, Ed. Fairfax, Virginia, 108-117.]] Google ScholarDigital Library
- LOW, S. H., MAXEMCHUK, N. F., AND PAUL, S. 1996. Anonymous Credit Cards and Their Collusion Analysis. IEEE/ACM Transactions on Networking 4, 6 (Dec.), 809-816.]] Google ScholarDigital Library
- MEDVINSKY, G. AND NEUMAN, B. 1993. Netcash: A design for practical electronic currency on the internet. In Proceedings of the 1st ACM Conference on Computer and Communications Security, Fair fax, VA. 102-106.]] Google ScholarDigital Library
- RAY, I. AND RAY, I. 2000. An Optimistic Fair Exchange E-commerce Protocol with Automated Dispute Resolution. In Proceedings of the 1st International Conference on Electronic Commerce and Web Technologies. London, U. K.]] Google ScholarDigital Library
- RAY, I. AND RAY, I. 2001. "an anonymous fair-exchange e-commerce protocol". In Proceedings of the 1st International Workshop on Internet Computing and E-Commerce, San Francisco, CA.]]Google ScholarCross Ref
- RAY, I., RAY, I., AND NARASIMHAMURTHI, N. 2000. A Fair-Exchange Protocol with Automated Dispute Resolution. In Proceedings of the 14th Annual IFIP WG 11.3 Working Conference on Database Security. Schoorl, The Netherlands.]] Google ScholarDigital Library
- SANDHOLM, T. AND LESSER, V. 1996. Advantages of a leveled commitment contracting protocol. In Proceedings of the 13th National Conference on Artificial Intelligence. 126-133.]]Google Scholar
- ZHOU, J. AND GOLLMANN, D. 1996. A Fair Non-repudiation Protocol. In Proceedings of the IEEE Symposium on Security and Privacy. Oakland, California, 55-61.]] Google ScholarDigital Library
Index Terms
- Fair exchange in E-commerce
Recommendations
An anonymous and failure resilient fair-exchange e-commerce protocol
In an electronic commerce environment, the merchant and the customer are unlikely to trust each other. This problem has motivated researchers to propose fair-exchange protocols based on using an on-line trusted third party; the third party receives the ...
An optimistic fair exchange protocol and its security in the universal composability framework
Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by ...
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either each of them obtains the other's signature, or ...
Comments