Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Security of Cached Content in NDN

Published:01 December 2017Publication History
Skip Abstract Section

Abstract

In Named-Data Networking (NDN), content is cached in network nodes and served for future requests. This property of NDN allows attackers to inject poisoned content into the network and isolate users from valid content sources. Since a digital signature is embedded in every piece of content in NDN architecture, poisoned content is discarded if routers perform signature verification; however, if every content is verified by every router, it would be overly expensive to do. In our preliminary work, we have suggested a content verification scheme that minimizes unnecessary verification and favors already verified content in the content store, which reduces the verification overhead by as much as 90&#x0025; without failing to detect every piece of poisoned content. Under this scheme, however, routers are vulnerable to <italic>verification attack</italic>, in which a large amount of unverified content is accessed to exhaust system resources. In this paper, we carefully look at the possible concerns of our preliminary work, including <italic>verification attack</italic>, and present a simple but effective solution. The proposed solution mitigates the weakness of our preliminary work and allows this paper to be deployed for real-world applications.

References

  1. [1] Kim D., Nam S., Junbi , and Yeom I., “Efficient content verification in named data networking,” in Proc. 2nd Int. Conf. Inf.-Centric Netw., Sep. 2015, pp. 109116.Google ScholarGoogle Scholar
  2. [2] Jacobson V., Smetters D. K., Thornton J. D., Plass M. F., Briggs N. H., and Braynard R. L., “Networking named content,” in Proc. ACM CoNEXT, 2009, pp. 112.Google ScholarGoogle Scholar
  3. [3] Gasti P., Tsudik G., Uzun E., and Zhang L., “DoS and DDoS in named data networking,” in Proc. IEEE ICCCN, Aug. 2012, pp. 17.Google ScholarGoogle Scholar
  4. [4] Ghali C., Tsudik G., and Uzun E., “Needle in a haystack: Mitigating content poisoning in named-data networking,” in Proc. NDSS Workshop Secur. Emerg. Netw. Technol. (SENT), Feb. 2014.Google ScholarGoogle Scholar
  5. [5] Ghali C., Tsudik G., and Uzun E., “Network-layer trust in named-data networking,” ACM Comput. Commun. Rev., vol. 44, no. 5, pp. 1219, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Ns-3 network simulator, accessed on Jan. 21, 2016. [Online]. Available: http://www.nsnam.orgGoogle ScholarGoogle Scholar
  7. [7] Xie M., Widjaja I., and Wang H., “Enhancing cache robustness for content-centric networking,” in Proc. IEEE INFOCOM, Mar. 2012, pp. 24262434.Google ScholarGoogle Scholar
  8. [8] Conti M., Gasti P., and Teoli M., “A lightweight mechanism for detection of cache pollution attacks in named data networking,” Elsevier Comput. Netw., vol. 57, no. 16, pp. 31783191, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Ghali G., Tsudik G., and Uzun E.. (Feb. 2014). “Elements of trust in named-data networking.” [Online]. Available: https://arxiv.org/abs/1402.3332Google ScholarGoogle Scholar
  10. [10] DiBenedetto S. and Papadopoulos C., “Mitigating poisoned content with forwarding strategy,” Colorado State Univ., Fort Collins, CO, USA, Tech. Rep. 15-101, 2015. [Online]. Available: http://www.cs.colostate.edu/TechReports/Reports/2015/tr15–101.pdfGoogle ScholarGoogle Scholar
  11. [11] Tourani R., Mick T., Misra S., and Panwar G.. (Mar. 2016). “Security, privacy, and access control in information-centric networking: A survey.” [Online]. Available: https://arxiv.org/abs/1603.03409Google ScholarGoogle Scholar
  12. [12] Compagno A., Conti M., Ghali C., and Tsudik G., “To NACK or not to NACK? Negative acknowledgments in information-centric networking,” in Proc. IEEE Int. Conf. Comput. Commun. Netw. (ICCCN), Aug. 2015, pp. 110.Google ScholarGoogle Scholar
  13. [13] Bianchi G., Detti A., Caponi A., and Blefari-Melazzi N., “Check before storing: What is the performance price of content integrity verification in LRU caching?ACM SIGCOMM Comput. Commun. Rev., vol. 43, no. 3, pp. 5967, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Yu Y., “Public key management in named data networking,” NDN, Univ. California, Los Angeles, CA, USA, Tech. Rep. NDN-0029, 2015.Google ScholarGoogle Scholar
  15. [15] Lee M., Song J., Cho K., Pack S., Kangasharju J., and Choi Y., “Content discovery for information-centric networking,” Comput. Netw., vol. 83, pp. 114, 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Chiocchetti R., Perino D., Carofiglio G., Rossi D., and Rossini G., “Inform: A dynamic interest forwarding mechanism for information centric networking,” in Proc. ACM SIGCOMM Workshop Inf.-Centric Netw., 2013, pp. 914.Google ScholarGoogle Scholar
  17. [17] Zhang L., Estrin D., Burke J., and Yeh E., “Named data networking (NDN) project,” NDN Project, Los Angeles, CA, USA, Tech. Rep. NDN-0001, 2010.Google ScholarGoogle Scholar
  18. [18] Afanasyev A.et al., “NFD developers guide,” NDN Project, Los Angeles, CA, USA, Tech. Rep. NDN-0021, 2014.Google ScholarGoogle Scholar
  19. [19] Afanasyev A., Moiseenko I., and Zhang L., “ndnSIM: NDN simulator for NS-3,” Univ. California, Los Angeles, CA, USA, Tech. Rep. NDN-0005, 2012.Google ScholarGoogle Scholar
  20. [20] Silagadze Z., “Citations and the Zipf–Mandelbrot’s law,” Complex Syst., vol. 11, pp. 487499, 1997.Google ScholarGoogle Scholar
  21. [21] Fricker C., Robert P., Roberts J., and Sbihi N., “Impact of traffic mix on caching performance in a content-centric network,” in Proc. IEEE Conf. Comput. Commun. Workshops (INFOCOM WKSHPS), Jul. 2012, pp. 310315.Google ScholarGoogle Scholar
  22. [22] Karedla R., Love J. S., and Wherry B. G., “Caching strategies to improve disk system performance,” Computer, vol. 27, no. 3, pp. 3846, Mar. 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [23] Che H., Tung Y., and Wang Z., “Hierarchical Web caching systems: Modeling, design and experimental results,” IEEE J. Sel. Areas Commun., vol. 20, no. 7, pp. 13051314, Sep. 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. [24] Kin-Yeung W., “Web cache replacement policies: A pragmatic approach,” IEEE Netw., vol. 20, no. 1, pp. 2834, Jan./Feb. 2006.Google ScholarGoogle Scholar
  25. [25] (2008). Youtube Traces From the Campus Network. [Online]. Available: http://traces.cs.umass.edu/index.php/NetworkGoogle ScholarGoogle Scholar
  26. [26] Cherkasova L. and Gianfranco C., “Characterizing temporal locality and its impact on Web server performance,” in Proc. IEEE Int. Conf. Comput. Commun. Netw. (ICCCN), Nov. 2000, pp. 434441.Google ScholarGoogle Scholar
  27. [27] Almeida V., Bestavros A., Crovella M., and Oliveria A. D., “Impact of traffic mix on caching performance in a content-centric network,” in Proc. IEEE Conf. Parallel Distrib. Inf. Syst., Mar. 1996, pp. 92103.Google ScholarGoogle Scholar

Index Terms

  1. Security of Cached Content in NDN
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image IEEE Transactions on Information Forensics and Security
        IEEE Transactions on Information Forensics and Security  Volume 12, Issue 12
        Dec. 2017
        294 pages

        1556-6013 © 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.

        Publisher

        IEEE Press

        Publication History

        • Published: 1 December 2017

        Qualifiers

        • research-article