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 ex- ponentiations in the traditional SET scenario. The communication over- head 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 crypto- graphic action together. It does not require a trusted party. The compu- tational costs of this protocol are 6m+2k+12 1024-bit exponentiations. The communication overhead is to 6m + 5k + 7 kbit.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneh, D. and Franklin, M.: Efficient Generation of Shared RSA Keys. In: Burton, S. and Kalinski, J. (eds.): Advances in Cryptology-Proceedings of Crypto '97. Lecture Notes in Computer Science, Vol. 1294. Springer-Verlag, Berlin Heidelberg New York (1997) 425–439
Hanaoka, G., Zheng, Y. and Imai, H.: LiteSET: a Light-Weight Secure Electronic Transaction Protocol. In: Boyd, C. and Dawson, E. (eds.): Proceedings of the Con-ference on Information Security and Privacy. Lecture Notes in Computer Science, Vol. 1438. Springer-Verlag, Berlin Heidelberg New York (1998) 215–226
RSA Security Inc.: FAQ-Frequently Asked Questions about Today’s Cryptography (Version 4.1), http://www.rsasecurity.com/rsalabs/faq, May (2000)
Langford, S. K.: Threshold DSS Signatures without a Trusted Party. In: Coppersmith, D.(eds.): Advances of Cryptology-Proceedings of Crypto '96. Lecture Notes in Computer Science, Vol. 963. Springer-Verlag, Berlin Heidelberg New York (1996) 397–409
Loeb, L.: SET-Secure Electronic Transaction. Artech House Publisher, Bosten (1998)
Menezes, A. J., Oorschot, P. C., and Vanstone, S. A.: Handbook of Applied Cryptography. CRC Press LLC (1997)
MasterCard and Visa: SET Secure Electronic Transaction Specification-Book 1: Business Description, Version 1.0 (1997)
MasterCard and Visa: SET Secure Electronic Transaction Specification-Book 3: Formal Protocol Definition, Version 1.0 (1997)
Seo, M. and Kim, K.: Another Improved SET: SlimSET. In: Proceedings of the 2000 Symposium on Cryptography and Information Security (2000)
Seo, M. and Kim, K.: Electronic Funds Transfer Protocol Using Domain-Verifiable SignCryption Scheme. In: Song, J.-S. (ed.): Proceedings of the International Conference on Security and Cryptography (ICISC '99). Lecture Notes in Computer Science, Vol. 1787. Springer-Verlag, Berlin Heidelberg New York (2000) 269–277
Zheng, Y.: Digital SignCryption or How to Achieve Cost(Signature & Encryption) <<Cost(Signature) + Cost(Encryption). In: Burton, S. and Kalinski, J. (eds.): Advances in Cryptology-Proceedings of Crypto '97. Lecture Notes in Computer Science, Vol. 1294. Springer Verlag, Berlin Heidelberg New York (1997) 165–179.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sans, O., Agnew, G.B. (2001). An Efficient Multiple Merchants Payment Protocol for Secure Electronic Transactions Based on Purchase Consolidation. In: Kou, W., Yesha, Y., Tan, C.J. (eds) Electronic Commerce Technologies. ISEC 2001. Lecture Notes in Computer Science, vol 2040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45415-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-45415-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41963-1
Online ISBN: 978-3-540-45415-1
eBook Packages: Springer Book Archive