Skip to main content

Omnify: Investigating the Visibility and Effectiveness of Copyright Monitors

  • Conference paper
Book cover Passive and Active Measurement (PAM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6579))

Included in the following conference series:

Abstract

The arms race between copyright agencies and P2P users is an ongoing and evolving struggle. On the one hand, content providers are using several techniques to stealthily find unauthorized distribution of copyrighted work in order to deal with the problem of Internet piracy. On the other hand, P2P users are relying increasingly on blacklists and anonymization methods in order to avoid detection. In this work, we propose a number of techniques to reveal copyright monitors’ current approaches and evaluate their effectiveness. We apply these techniques on data we collected from more than 2.75 million BitTorrent swarms containing 71 million IP addresses. We provide strong evidence that certain nodes are indeed copyright monitors, show that monitoring is a world-wide phenomenon, and devise a methodology for generating blacklists for paranoid and conservative P2P users.

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. Cohen, B.: Incentives build robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer systems (2003)

    Google Scholar 

  2. Matei, R., Iamnitchi, A., Foster, P.: Mapping the Gnutella network. IEEE Internet Computing 6(1), 50–57 (2002)

    Article  Google Scholar 

  3. Baset, S., Schulzrinne, H.: An analysis of the skype peer-to-peer internet telephony protocol. Arxiv preprint cs/0412017 (2004)

    Google Scholar 

  4. Huang, Y., Fu, T.Z., Chiu, D.-M., Lui, J.C., Huang, C.: Challenges, design and analysis of a large-scale p2p-vod system. In: SIGCOMM (2008)

    Google Scholar 

  5. Cho, K., Fukuda, K., Esaki, H., Kato, A.: Observing slow crustal movement in residential user traffic. In: CONEXT (2008)

    Google Scholar 

  6. Kao, A.: RIAA v. Verizon: Applying the Subpoena Provision of the DMCA. Sch. L. Rev. 63, 64 (2003)

    Google Scholar 

  7. Piatek, M., Kohno, T., Krishnamurthy, A.: Challenges and directions for monitoring P2P file sharing networks–or–Why my printer received a DMCA takedown notice. In: 3rd USENIX Workshop on Hot Topics in Security, HotSec (2008)

    Google Scholar 

  8. Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: an overlay testbed for broad-coverage services. ACM SIGCOMM Computer Communication Review 33(3), 3–12 (2003)

    Article  Google Scholar 

  9. TBG Blocklist, http://tbg.iblocklist.com/

  10. Siganos, G., Pujol, J.M., Rodriguez, P.: Monitoring the bittorrent monitors: A bird’s eye view. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds.) PAM 2009. LNCS, vol. 5448, pp. 175–184. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. OpenBittorrent, http://www.openbittorrent.com

  12. Yahoo! Search Boss, http://developer.yahoo.com/search/boss/

  13. Hirschberg, D.: Algorithms for the longest common subsequence problem. Journal of the ACM (JACM) 24(4), 664–675 (1977)

    Article  MATH  Google Scholar 

  14. Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the web. Computer Networks and ISDN Systems 29(8-13), 1157–1166 (1997)

    Article  Google Scholar 

  15. Tan, P., Steinbach, M., Kumar, V.: Introduction to data mining. Pearson Addison Wesley, Boston (2006)

    Google Scholar 

  16. Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Approximation Algorithms for NP-hard Problems, pp. 236–265 (1996)

    Google Scholar 

  17. MaxMind, L.: GeoIP (2006)

    Google Scholar 

  18. Project Honey Pot, http://www.projecthoneypot.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Potharaju, R., Seibert, J., Fahmy, S., Nita-Rotaru, C. (2011). Omnify: Investigating the Visibility and Effectiveness of Copyright Monitors. In: Spring, N., Riley, G.F. (eds) Passive and Active Measurement. PAM 2011. Lecture Notes in Computer Science, vol 6579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19260-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19260-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19259-3

  • Online ISBN: 978-3-642-19260-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics