Skip to main content

FAIR: Fair Audience InfeRence

  • Conference paper
Digital Rights Management (DRM 2002)

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

Included in the following conference series:

Abstract

Given the recent changes in the policy governing Internet content distribution, such as the institution of per listener royalties for Internet radio broadcasters, content distributors now have an incentive to under-report the size of their audience. Previous audience measurement schemes only protect against inflation of audience size. We present the first protocols for audience measurement that protect against both inflation and deflation attempts by content distributors. The protocols trade-off the amount of additional information the content distributors must distribute to facilitate audience inference with the amount of infrastructure required and are applicable to Internet radio, web plagiarism, and software license enforcement.

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

Access this chapter

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. Anonymizer.com, Company web page, http://www.anonymizer.com

  2. Anupam, V., Mayer, A., Nissim, K., Pinkas, B., Reiter, M.K.: On the security of pay-per-click and other Web advertising schemes. Computer Networks 31(11-16), 1091–1100 (1999)

    Article  Google Scholar 

  3. Baudes, R., Zabele, S.: RFC 1458: Requirements for multicast protocols (May 1993); Status: INFORMATIONAL

    Google Scholar 

  4. Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  5. De Bonis, A., Masuci, B.: An information thoeretical approach to metering schemes. In: Proccedings of ISIT 2000 (2001)

    Google Scholar 

  6. De Bonis, A., Blundo, C., Masuci, B.: Bounds and constructions for metering schemes. To appear in Communications in Information and Systems (2002)

    Google Scholar 

  7. Chaum, D.: Elections with unconditionally-secret ballots and disruption equivalent to breaking rsa. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 177–182. Springer, Heidelberg (1988)

    Google Scholar 

  8. Coffey, S.: Internet audience measurement: A practitioner’s view. Journal of Interactive Advertising (2001)

    Google Scholar 

  9. comScore Networks. net-score product description, http://www.comscore.com/

  10. Ipsos-RSL Broadcast Division. An introduction to the ipsos-rsl broadcast division, http://www.rslmedia.co.uk/broadcast/experience.html

  11. Dyck, T.: Yahoo chief scientist describes web attacks. EWeek (July 2002)

    Google Scholar 

  12. FAST/ARF. Principles of online media audience measurement, http://www.fastinfo.org/measurement/pages/index.egi/audiencemeasurement

  13. Franklin, M.K., Malkhi, D.: Auditable metering with lightweight security. In: Financial Cryptography, pp. 151–160 (1997)

    Google Scholar 

  14. Goldwasser, S., Bellare, M.: Lecture notes on cryptography. Summer Course “Cryptography and Computer Security” at MIT (1996/1999)

    Google Scholar 

  15. Greenman, C.: Royalty fees threaten web stations. New York Times (April 2002)

    Google Scholar 

  16. Kamath, A.P., Motwani, R., Palem, K., Spirakis, F.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms 7, 59–80 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kulm, M.G.: Probabilistic counting of large digital signature collections (2000)

    Google Scholar 

  18. Masuci, R., Stinson, D.R.: Efficient metering schemes with pricing. IEEE Transactions on Information Theory 47, 2835–2844 (2001)

    Article  Google Scholar 

  19. Inc. MeasureCast. An analysis of streaming audience measurement methods, http://www.measurecast.com/does/Audience_Measurement_Methods.pdf

  20. Mitzenmacher, M.: Compressed bloom filters. In: ACM Symposium on Principles of Distributed Computing, pp. 144–150 (2001)

    Google Scholar 

  21. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  22. Naor, M., Pinkas, B.: Secure and efficient metering. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 576–589. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  23. Ogata, W., Kurosawa, K.: Provably secure metering scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 388–398. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Reiter, M.K., Anupam, V., Mayer, A.: Detecting hit shaving in click-through payment schemes. In: Proceedings of the 3rd USENJX Workshop on Electronic Commerce, pp. 155–166 (1998)

    Google Scholar 

  25. Nielsen Media Research. Audience measurement services – the global leader for actionable internet information, http://www.nielsennetratings.com/marketing/advertising/audience_measurement/

  26. Pieneel, B., Nikov, V., Nikova, S., Vandewalle, J.: Applying general access structure to metering schemes (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johnson, R., Staddon, J. (2003). FAIR: Fair Audience InfeRence. In: Feigenbaum, J. (eds) Digital Rights Management. DRM 2002. Lecture Notes in Computer Science, vol 2696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44993-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44993-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40410-1

  • Online ISBN: 978-3-540-44993-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics