Blind sales in electronic commerce

ACM International Conference Proceeding Series

Volumn 60, Issue , 2004, Pages 148-157

  Aimeur E ^a   Brassard, G ^a   Mani Onana, F S ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

anonymous surfing; CAPTCHA; cryptography; customer buying behaviour; electronic commerce; oblivious transfer; private information retrieval

Indexed keywords

ANONYMOUS SURFING; BUYING BEHAVIOUR; CAPTCHAS; OBLIVIOUS TRANSFER; PRIVATE INFORMATION RETRIEVAL;

COMPETITION; CRYPTOGRAPHY; CUSTOMER SATISFACTION; INFORMATION RETRIEVAL; LIBRARIES; SALES;

ELECTRONIC COMMERCE;

EID: 77954502613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1052220.1052239     Document Type: Conference Paper

References (43)

1. B. Aiello, Y. Ishai and O. Reingold, "Priced oblivious transfer: How to sell digital goods", Advances in Cryptology: Proceedings of Eurocrypt 01, pages 119-135, Springer-Verlag, 2001.
2. D. Asonov and J.-C. Freytag, "Almost optimal private information retrieval", Technical report HUB-IB-156, Humboldt University, Berlin, 2001.
3. F. Bao, R. H. Deng and P. Feng, "An efficient and practical scheme for privacy protection in the e-commerce of digital goods", Proceedings of 13th International Conference on Information Security and Cryptology, pages 162-170, December 2000.
4. D. Beaver, J. Feigenbaum, J. Kilian and P. Rogaway, "Locally random reductions: Improvements and applications", Journal of Cryptology 10(1):17-36, 1997.
5. F. Boudot, "Efficient proofs that a committed number lies in an interval", Advances in Cryptology: Proceedings of Eurocrypt 00, pages 431-444, Springer-Verlag, 2000.
6. G. Brassard, C. Crépeau and J.-M. Robert, "All-or-nothing disclosure of secrets", Advances in Cryptology: Proceedings of Crypto 86, pages 234-238, Springer-Verlag, 1987.
7. C. Cachin, S. Micali and M. Stadler, "Computationally private information retrieval with polylogarithmic communication", Advances in Cryptology: Proceedings of Eurocrypt 99, pages 402-414, Springer-Verlag, 1999.
8. Y.-C. Chang, "Single database private information retrieval with logarithmic communication", Available at URL: http://eprint.iacr.org/2004/ 036/, 2004.
9. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms", Communications of the ACM 24(2):84-90, February 1981.
10. D. Chaum, "Security without identification: Transaction systems to make Big Brother obsolete", Communications of the ACM 28(10):1030-1044, October 1985.
11. B. Chor and N. Gilboa, "Computational private information retrieval", Proceedings of 29th Annual ACM Symposium on the Theory of Computing, pages 304-313, 1997.
12. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, "Private information retrieval", Proceedings of 36th Annual IEEE Symposium on Foundations of Computer Science, pages 41-51, 1995.
13. R. Clarke, Fundamentals of negotiation. URL: www.anu.edu.au/people/Roger. Clarke/SOS/FundasNeg.html, 1993, accessed 8 September 2004.
14. C. Crépeau, "Equivalence between two flavours of oblivious transfers", Advances in Cryptology: Proceedings of Crypto 87, pages 350-354, Springer-Verlag, 1988.
15. W. Diffie and M.E. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory 22(6):644-654, October 1976.
16. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Transactions on Information Theory 31:469-472, 1985.
17. S. Even, O. Goldreich and A. Lempel, "A randomized protocol for signing contracts", Communications of the ACM 28:637-647, 1985.
18. Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin, "Protecting data privacy in private information retrieval schemes", Proceedings of 30th Annual ACM Symposium on the Theory of Computing, pages 151-160, 1998.
19. Guardster, Ltd., "Anonymous web surfing", URL: www.guardster.com, accessed 8 September 2004.
20. R. H. Guttman, A. G. Moukas and P. Maes, "Agent-mediated electronic commerce: A survey", Knowledge Engineering Review Journal 13(3):985-1003, June 1998.
21. J. Kilian, "Founding cryptography on oblivious transfer", Proceedings of 20th Annual Symposium on Theory of Computing, pages 20-31, 1988.
22. E. Kushilevitz and R. Ostrovsky, "Replication is not needed: Single database, computationally-private information retrieval", Proceedings of 38th Annual IEEE Symposium on Foundations of Computer Science, pages 364-373, 1997.
23. E. Kushilevitz and R. Ostrovsky, "One-way trapdoor permutations are sufficient for single-server private information retrieval", Technical report CS0962, Computer Science Department, Technion, 1999.
24. H. Lipmaa, "Computationally private information retrieval with quasilogarithmic total communication", Available at URL: http://eprint.iacr.org/2004/063/, 2004.
25. T. G. Malkin, "A study of secure database access and general two-party computation", PhD thesis, Massachusetts Institute of Technology, 2000.
26. U. M. Maurer and S. Wolf, "The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms", SIAM Journal of Computing 28(5):1689-1721, 1999.
27. R. C. Merkle, "Secure communications over insecure channels", Communications of the ACM 21:294-299, 1978.
28. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation", Proceedings of 31st Annual ACM Symposium on the Theory of Computing, pages 294-303, 1997.
29. M. Naor and B. Pinkas, "Oblivious transfer with adaptive queries", Advances in Cryptology: Proceedings of Crypto 99, pages 573-590, Springer-Verlag, 1999.
30. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols", Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448-457, January 2001.
31. Office of the High Commissioner for Human Rights, "Universal Declaration of Human Rights", URL: http://www.unhchr.ch/udhr/lang/eng.htm, accessed 8 September 2004.
32. R. Ostrovsky and V. Shoup, "Private information storage", Proceedings of 29th Annual ACM Symposium on the Theory of Computing, pages 294-303, 1999.
33. M. Rabin, "How to exchange secrets by oblivious transfer", Technical memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
34. C.P. Schnorr and M. Jakobsson, "Security of signed ElGamal encryption", Advances in Cryptology: Proceedings of Asiacrypt 00, pages 73-89, Springer-Verlag, December 2000.
35. S. W. Smith and D. Safford, "Practical server privacy with secure coprocessors", IBM Systems Journal 40(3):683-695, September 2001.
36. D.R. Stinson, Cryptography: Theory and Practice, CRC Press, 1995.
37. C. Tobias, "Practical oblivious transfer protocols", Proceedings of 5th International Workshop on Information Hiding, pages 415-426, Springer-Verlag, 2002.
38. Network-Tools.com, Tools to trace a user, URL: www.Network-Tools.com, accessed 8 September 2004.
39. E. Turban, E. Mclean, J. Wetherbe, N. Bolloju and R. Davison, Electronic Commerce, A Managerial Perspective, Prentice Hall, 2002.
40. L. von Ahn, M. Blum, N. J. Hopper and J. Langford, "Captcha: Telling humans and computers apart", Advances in Cryptology: Proceedings of Eurocrypt 03, pages 294-311, Springer-Verlag, 2003.
41. S. Wiesner, "Conjugate coding", Manuscript written circa 1970; Unpublished until it appeared in Sigact News 15(1):78-88, 1983.
42. A.C.-C. Yao, "Protocols for secure computation", Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
43. A.C.-C. Yao, "How to generate and exchange secrets", Proceedings of 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.