An anonymous electronic commerce scheme with an off-line authority and untrusted agents
Abstract
In the last years, the exponential growth of computer networks has created an incredibly large offer of products and services in the net. Such a huge amount of information makes it impossible for a single person to analyze all existing offers of a product on the net and decide which of them fits better her requirements. This problem is solved with the intelligent trade agents (ITA), which are programs that have the ability to roam a network, collect business-related data and use them to make decisions to buy goods on their owners' behalf. Known ITA systems do not provide anonymity in transactions, require an on-line trusted third party and implicitly assume that the user trusts the ITA. We present a new scheme for an intelligent untrusted trade agent system allowing anonymous electronic transactions with an off-line trusted third party.
References
[1]
{1} S. Y. Bennet, "A sanctuary for mobile agents". DARPA Workshop on Fundations for Secure Mobile Code Workshop, Mar. 1997, Monterrey, California, U.S.A.
[2]
{2} R. Berger, R. Peralta and T. Tedrick, "A provably secure oblivious transfer protocol". Advances in Cryptology-EUROCRYPT'84, LNCS 209. Springer-Verlag, 1985, pp. 408-416.
[3]
{3} B. N. Bershad, S. Savage, P. Pardyak, E. G. Sirer, M. E. Fiuczynski, D. Becker, C. Chambers and S. Eggers, "Extensibility safety and performance in the spin operating system". In Proceedings of the Fifteenth Symposium on Operating System Principles, Dec. 1995.
[4]
{4} S. Brands, "Untraceable off-line cash in wallets with observers". Advances in Cryptology-CRYPTO'93, LNCS 773. Springer-Verlag, 1993, pp. 302-318.
[5]
{5} D. Chaum, "Blind signatures for untraceable payments". Advances in Cryptology-CRYPTO'82, Plenum Press, 1983, pp. 199-203.
[6]
{6} D. Chaum, "Security without identification: Transaction systems to make big brother obsolete". Communications of the ACM, vol. 28 no. 5, Oct. 1985, pp. 1030-1044.
[7]
{7} S. Even, O. Golderich and A. Lempel, "A randomizing protocol for signing contracts". Communications of the ACM, vol. 28, no. 6, Jun. 1985, pp. 637-647.
[8]
{8} W. C. Hsieh, M. E. Fiuczynski, C. Garrett, S. Savage, D. Becker and B. N. Bershad, "Language support for extensible operating systems". In Proceedings of the Workshop on Compiler Support for System Software, Feb. 1996.
[9]
{9} F. Hohl, "An approach to solve the problem of malicious hosts". Technical Report Number TR- 1997-03, Fakultät Informatik, Universität Stuttgart, Mar. 1997.
[10]
{10} J. Merwe and S.H. von Solms, "Electronic commerce with secure intelligent trade agents". Information and Communications Security, LNCS 1334. Springer-Verlag, 1997, pp. 452-462.
[11]
{11} G. Necula and P. Lee, "Safe kernel extensions without run-time checks". In Proceedings of the Second Sumposium on Operating Systems Design and Implementation, Oct. 1996.
[12]
{12} T. Sander and C.F. Tschudin, "Protecting mobile agent against malicious hosts". Mobile Agents and Security, LNCS 1419. Springer-Verlag, 1998, pp. 44- 60.
[13]
{13} T. Tedrick, "Fair exchange of secrets". Advances in Cryptology-CRYPTO'84, LNCS 196. Springer-Verlag, 1985, pp. 434-438.
Index Terms
- An anonymous electronic commerce scheme with an off-line authority and untrusted agents
Recommendations
(α, k)-anonymous data publishing
Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the ...
Anonymous k-show credentials
EuroPKI'07: Proceedings of the 4th European conference on Public Key Infrastructure: theory and practicePrivacy-preserving digital credentials are cryptographic tools that allow a user to prove a predicate about his/her identity or qualifications, without the verifying party learning additional information beyond the status of that predicate. The Identity ...
Anonymous Asynchronous Payment Channel from k-Time Accountable Assertion
Cryptology and Network SecurityAbstractAccountable assertion enables a payer to make off-chain payments to a payee, and at the same time, the payer’s secret credentials can be revealed if she equivocates (i.e., makes conflicting statements to others). In this paper, we introduce a new ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1998 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1998
Published in SIGMOD Volume 27, Issue 4
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 148Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)9
Reflects downloads up to 02 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in