Skip to main content
SpringerLink
Log in

Targeted Advertising ... and Privacy Too

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2001 (CT-RSA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2020))

Included in the following conference series:

Abstract

The Web presents a rich and powerful tool for aggregation of consumer information. A flurry of recent articles in the popular press has documented aggressive manipulation of such information by some companies for the purposes of targeted advertising. While advertisers tout the economic and social benefits of such advertising, consumer privacy groups have expressed grave concerns about its potential abuses, and called for legislative policies to protect sensitive consumer data. In this paper, we explore the notion that targeted advertising and privacy protection need not necessarily be conflicting goals. We describe some conceptually simple technical schemes that facilitate targeted advertising, but also offer protection for sensitive consumer data. Some simple proposals do not even require the use of cryptography. (As an example, we mention an existing scheme in commercial deployment.) We also consider some more sophisticated protocols offering greater assurance of privacy. These involve cryptographic constructions that may be thought of as partial, practical PIR (private information retrieval) schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Crowds homepage. AT&T Labs. http://www.research.att.com/projects/crowds.

  2. Encirq, Inc. http://www.encirq.com.

  3. Microsoft ActiveX resource page. Microsoft Corporation. http://www.microsoft.com/com/tech/ActiveX.asp.

  4. Platform for privacy preferences (P3P) project. World Wide Web Consortium (W3C). http://www.w3.org/p3p.

  5. Zero-Knowledge Systems, Inc. http://www.zeroknowledge.com.

  6. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In EUROCRYPT’ 98, pages 437–447, 1998.

    Google Scholar 

  7. M. Abe. A mix-network on permutation networks. In ASIACRYPT’ 99, pages 258–273, 1999.

    Google Scholar 

  8. Reuters News Agency. DoubleClick awaits FTC OK: CEO says Web adfirm will wait for privacy policy before it uses ad tracking. 2 March 2000.

    Google Scholar 

  9. R.M. Arlien, B. Jai, M. Jakobsson, F. Monrose, and M. K. Reiter. Privacy-preserving global customization. In ACM E-Commerce’ 00, 2000. To appear.

    Google Scholar 

  10. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT’ 99, pages 402–414, 1999.

    Google Scholar 

  11. J. Camenisch and M. Michels. Proving that a number is the product of two safe primes. In EUROCRYPT’ 99, pages 107–122, 1999.

    Google Scholar 

  12. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, 1981.

    Article  Google Scholar 

  13. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. JACM, 45(6):965–981, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  14. Y. Desmedt and K. Kurosawa. How to break a practical mix and design a new one. In EUROCRYPT’ 00, pages 557–572, 2000.

    Google Scholar 

  15. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, (22):644–654, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In EUROCRYPT’ 86, pages 186–194, 1986.

    Google Scholar 

  17. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469–472, 1985.

    Article  MATH  Google Scholar 

  18. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for d-log based cryptosystems. In EUROCRYPT’ 99, pages 295–310, 1999.

    Google Scholar 

  19. Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for PIR. In RANDOM’ 98, pages 200–217, 1998.

    Google Scholar 

  20. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In STOC’ 98, pages 151–160, 1998.

    Google Scholar 

  21. J. Goldman, Z. Hudson, and R.M. Smith. Report on the privacy policies and practices of health Web sites, 2000.

    Google Scholar 

  22. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC’ 87, pages 218–229, 1987.

    Google Scholar 

  23. M. Jakobsson. A practical mix. In EUROCRYPT’ 98, pages 448–461, 1998.

    Google Scholar 

  24. M. Jakobsson. Flash mixing. In PODC’ 99, pages 83–89, 1999.

    Google Scholar 

  25. M. Jakobsson. On quorum controlled asymmetric proxy re-encryption. In PKC’ 99, pages 112–121, 1999.

    Google Scholar 

  26. M. Jakobsson and A. Juels. Millimix: Mixing in small batches, 1999. DIMACS Technical Report 99-33.

    Google Scholar 

  27. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via cipher-texts. In ASIACRYPT’ 00, 2000. To appear.

    Google Scholar 

  28. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS’ 97, pages 364–373, 1997.

    Google Scholar 

  29. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1995.

    Google Scholar 

  30. M. Mitomo and K. Kurosawa. Attack for flash mix. In ASIACRYPT’ 00, 2000. To appear.

    Google Scholar 

  31. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS’ 97, pages 440–444, 1997.

    Google Scholar 

  32. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In ASIACRYPT’ 00, 2000. To appear.

    Google Scholar 

  33. R. Ostrovsky and V. Shoup. Private information storage. In STOC’ 97, pages 294–303, 1997.

    Google Scholar 

  34. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO’ 91, pages 129–140, 1991.

    Google Scholar 

  35. T. Pedersen. A threshold cryptosystem without a trusted third party. In EU-ROCRYPT’ 91, pages 522–526, 1991.

    Google Scholar 

  36. A. Pfitzmann and B. Pfitzmann. How to break the direct RSA-implementation of MIXes. In EUROCRYPT’ 89, pages 373–381, 1989.

    Google Scholar 

  37. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web transactions. ACM Transactions on Information and System Security, 1(1):66–92, 1998.

    Article  Google Scholar 

  38. M. K. Reiter and A. D. Rubin. Anonymous Web transactions with Crowds. Communications of the ACM, 42(2):32–38, 1999.

    Article  Google Scholar 

  39. C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161–174, 1991.

    Article  MATH  Google Scholar 

  40. B. Tedeschi. E-commerce report; Critics press legal assault on tracking of Web users. New York Times. 7 February 2000.

    Google Scholar 

  41. Y. Tsiounis and M. Yung. On the security of ElGamal-based encryption. In PKC’ 98, pages 117–134, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RSA Laboratories, Bedford, MA, 01730, USA

    Ari Juels

Authors
  1. Ari Juels
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gemplus Card International, 34 rue Guynemer, 92447, Issy les Moulineaux, France

    David Naccache

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Juels, A. (2001). Targeted Advertising ... and Privacy Too. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45353-9_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41898-6

  • Online ISBN: 978-3-540-45353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation