Addressing click fraud in content delivery systems

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 240-248

  Majumdar, Saugat ^a   Kulkarni, Dhananjay ^a   Ravishankar, Chinya V ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT BASED RETRIEVAL; NETWORK PROTOCOLS; NETWORK SECURITY;

CLICK FRAUD; CONTENT DELIVERY SYSTEMS; DISHONEST INTERMEDIARIES (BROKERS); FABRICATION ATTACKS;

INFORMATION SYSTEMS;

EID: 34548364250     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.36     Document Type: Conference Paper

References (24)

1. Google click fraud, http://www.law.com/jsp/article.jsp?id=1153213525657.
2. Msnbc dataset, http://kdd.ics.uci.edu/databases/msnbc/msnbc.html.
3. B. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. Lecture Notes in Computer Science, 2045, 2001.
4. V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. K. Reiter. On the security of pay-per-click and other Web advertising schemes. Computer Networks (Amsterdam, Netherlands: 1999).
5. N. Asokan and V. Shoup. Optimistic fair exchange of digital signatures. EUROCRYPT '98, 1998.
6. M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, and M. Waidner. iKP - A family of secure electronic payment protocols, pages 89-106.
7. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
8. D. Boneh and M. K. Franklin. Identity-based encryption from the weil pairing. In CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 213-229, London, UK, 2001. Springer-Verlag.
9. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact e-cash. EUROCRYPT'05, volume 3494 of LNCS, pp. 302-321.
10. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. Crypto 2003.
11. D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash). CRYPTO '88, pp. 319-327., 1989.
12. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. LNCS, 1462, 1998.
13. F. Deng and D. Rafiei. Approximately detecting duplicates for streaming data using stable bloom filters. In ACM SIGMOD'06.
14. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Crypto '86.
15. L. Fiege, A. Zeidler, A. P. Buchmann, R. Kilián-Kehr, and G. Mühl. Security aspects in publish/subscribe systems. In Third Intl. Workshop on Distributed Event-based Systems '04.
16. M. K. Franklin and M. Yung. Secure and efficient off-line digital money. In ICALP '93, pages 265-276, London, UK. Springer-Verlag.
17. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17, 1988.
18. A. Metwally, D. Agrawal, and A. E. Abbadi. Duplicate detection in click streams. In WWW '05, pages 12-21.
19. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13, 2000.
20. C. Rackoff and D. Simon. Non-interactive zero-knowledge proofs of knowledge and chosen-ciphertext attack. LNCS, CRYPTO 91.
21. H. Stark and J. W. Woods. Probability, Random Processes, and Estimation Theory for Engineers. Prentice Hall, USA, 1994.
22. D. R. Stinson. Cryptography: theory and practice. CRC Press, 1995.
23. A. Tanner and M. A. Jaeger. Pricing in publish/subscribe systems. In ICEC '04.
24. C. Wang, A. Carzaniga, D. Evans, and A. Wolf. Security issues and requirements for internet-scale publish-subscribe systems. In HICSS'02.