Targeted advertising … and privacy too

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 408-424

  Juels, Ari ^a  

^a RSA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MARKETING;

COMMERCIAL DEPLOYMENT; CONSUMER INFORMATION; ECONOMIC AND SOCIAL BENEFITS; PRIVACY PROTECTION; PRIVATE INFORMATION RETRIEVAL; TARGETED ADVERTISING; TECHNICAL SCHEME;

CONSUMER PROTECTION;

EID: 84937572541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_30     Document Type: Conference Paper

References (41)

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.
7. M. Abe. A mix-network on permutation networks. In ASIACRYPT '99, pages 258-273, 1999.
8. Reuters News Agency. DoubleClick awaits FTC OK: CEO says Web ad firm will wait for privacy policy before it uses ad tracking. 2 March 2000.
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.
10. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT '99, pages 402-414, 1999.
11. J. Camenisch and M. Michels. Proving that a number is the product of two safe primes. In EUROCRYPT '99, pages 107-122, 1999.
12. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
13. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. JACM, 45(6):965-981, 1998.
14. Y. Desmedt and K. Kurosawa. How to break a practical mix and design a new one. In EUROCRYPT '00, pages 557-572, 2000.
15. W. Diffe and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, (22):644-654, 1976.
16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In EUROCRYPT '86, pages 186-194, 1986.
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.
18. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key gene-ration for d-log based cryptosystems. In EUROCRYPT '99, pages 295-310, 1999.
19. Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for PIR. In RANDOM '98, pages 200-217, 1998.
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.
21. J. Goldman, Z. Hudson, and R. M. Smith. Report on the privacy policies and practices of health Web sites, 2000.
22. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC '87, pages 218-229, 1987.
23. M. Jakobsson. A practical mix. In EUROCRYPT '98, pages 448-461, 1998.
24. M. Jakobsson. Flash mixing. In PODC '99, pages 83-89, 1999.
25. M. Jakobsson. On quorum controlled asymmetric proxy re-encryption. In PKC '99, pages 112-121, 1999.
26. M. Jakobsson and A. Juels. Millimix: Mixing in small batches, 1999. DIMACS Technical Report 99-33.
27. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via cipher-texts. In ASIACRYPT '00, 2000. To appear.
28. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS '97, pages 364-373, 1997.
29. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1995.
30. M. Mitomo and K. Kurosawa. Attack for flash mix. In ASIACRYPT '00, 2000. To appear.
31. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS '97, pages 440-444, 1997.
32. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In ASIACRYPT '00, 2000. To appear.
33. R. Ostrovsky and V. Shoup. Private information storage. In STOC '97, pages 294-303, 1997.
34. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, pages 129-140, 1991.
35. T. Pedersen. A threshold cryptosystem without a trusted third party. In EU-ROCRYPT '91, pages 522-526, 1991.
36. A. Pfitzmann and B. Pfitzmann. How to break the direct RSA-implementation of MIXes. In EUROCRYPT '89, pages 373-381, 1989.
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.
38. M. K. Reiter and A. D. Rubin. Anonymous Web transactions with Crowds. Com-munications of the ACM, 42(2):32-38, 1999.
39. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161-174, 1991.
40. B. Tedeschi. E-commerce report; Critics press legal assault on tracking of Web users. New York Times. 7 February 2000.
41. Y. Tsiounis and M. Yung. On the security of ElGamal-based encryption. In PKC '98, pages 117-134, 1998.