An Efficient Multiple Merchants Payment Protocol for Secure Electronic Transactions Based on Purchase Consolidation

  • Authors:
  • Oda Sans;Gordon B. Agnew

  • Affiliations:
  • -;-

  • Venue:
  • ISEC '01 Proceedings of the Second International Symposium on Topics in Electronic Commerce
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose two payment protocols between one customer and m out of n merchants in an e-mall environment based on the SET protocol. Instead of interacting with each merchant separately (traditional SET scenario) the customer performs only one transaction paying all merchants at once. The first protocol is based on a trusted consolidator who acts on behalf of the merchants performing the cryptographic actions and distributing the information to the merchants. The computational costs of this protocol are 4m + 17 1024-bit exponentiations compared to 19n 1024-bit exponentiations in the traditional SET scenario. The communication overhead is reduced from 12m kbit to 5m + 8 kbit. The second protocol is based on a (n, k)-threshold scheme set up among the merchants which allows all sets of k merchants to perform a cryptographic action together. It does not require a trusted party. The computational costs of this protocol are 6m+2k+12 1024-bit exponentiations. The communication overhead is to 6m + 5k + 7 kbit.