Abstract
Atomicity and anonymity are two important attributes for electronic commerce, especially in payment systems. Atomicity guarantees justice and coincidence for each participant. However traditional atomicity either bias to SELLER or CUSTOMER. Anonymity is also intractable, unanonymous or anonymity both leads to dissatisfying ending. Therefore, it is important to design a system in which satisfying atomicity and revocable anonymity are both enabled. In this paper, based on AFAP(Atomic and Fair Anonymous Protocol), we propose an approach to realize satisfying atomicity. In this method, not only SELLER’s satisfying atomicity but also CUSTOMER’s satisfying atomicity is supported. At the same time, based on Brands’ fair signature model, this method satisfies both anonymity and owner-trace or money-trace.
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
Loeb, L.: Secure Electronic Transactions Introduction and Technical Reference. ARTECH HOUSE,INC. (1998)
Cox, B., Tygar, J.D., Sirbu, M.: Netbill security and transaction protocol. In: Proceedings of the 1st USENIX Workshop on Electronic Commerce, pp. 77–88 (1995)
Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 200–212. Springer, Heidelberg (1990)
Jie, T., Juan-Zi, L., Ke-Hong, W., Yue-Ru, C.: Research of Atomic and Anonymous Electronic Commerce Protocol. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 711–714. Springer, Heidelberg (2003)
Tygar, J.D.: Atomicity versus Anonymity: Distributed Transactions for Electronic Commerce. In: Proceedings of the 24th VLDB Conference, New York, USA, pp. 1–12 (1998)
Tygar, J.D.: Atomicity in Electronic Commerce. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing 5, 8–26 (1996)
Camp, L., Harkavy, M., Tygar, J.D., Yee, B.: Anonymous Atomic Transactions. Proceedings of 2nd Usenix Workshop on Electronic Commerce 11, 123–133 (1996)
von Solms, S., Naccache, D.: On blind signatures and perfect crimes. Computers and Security 11(6), 581–583 (1992)
Chaum, D., Evertse, J.H., van de Graff, J., Peralta, R.: Demonstrating Possession of a Discrete Logarithm without Revealing It. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 200–212. Springer, Heidelberg (1987)
Brands, S.: Untraceable Off-line Cash in Wallets with Observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302–318. Springer, Heidelberg (1994)
Stadler, M., Piveteau, M.M., Camenisch, J.: Fair blind signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 209–219. Springer, Heidelberg (1995)
Sander, T., Ta-Shma, A.: Auditable, Anonymous Electronic Cash. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 555–571. Springer, Heidelberg (1999)
Jie, T.: The Research of Atomic and Fair Anonymous Electronic Transaction Protocol, YanShan University, pp. 35–59 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, J., Li, JZ., Wang, KH., Cai, YR. (2004). Research of Satisfying Atomic and Anonymous Electronic Commerce Protocol. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive