Visible to the public CAPnet: A Defense Against Cache Accounting Attacks on Content Distribution Networks

TitleCAPnet: A Defense Against Cache Accounting Attacks on Content Distribution Networks
Publication TypeConference Paper
Year of Publication2019
AuthorsAlmashaqbeh, Ghada, Kelley, Kevin, Bishop, Allison, Cappos, Justin
Conference Name2019 IEEE Conference on Communications and Network Security (CNS)
Date PublishedJune 2019
PublisherIEEE
ISBN Number978-1-5386-7117-7
Keywordscache accounting attacks, cache participation, cache storage, CAPnet, composability, content publishers, deployment costs, hybrid systems, Internet, lightweight cache accountability puzzle, malicious caches, Metrics, modest client machine, network accountability, network infrastructure, peer-assisted CDN, peer-assisted content distribution networks, Peer-to-peer computing, peer-to-peer data transfers, pubcrawl, resilience, Resiliency, traditional infrastructure-based content delivery networks, untrusted caches, video on demand
Abstract

Peer-assisted content distribution networks (CDNs)have emerged to improve performance and reduce deployment costs of traditional, infrastructure-based content delivery networks. This is done by employing peer-to-peer data transfers to supplement the resources of the network infrastructure. However, these hybrid systems are vulnerable to accounting attacks in which the peers, or caches, collude with clients in order to report that content was transferred when it was not. This is a particular issue in systems that incentivize cache participation, because malicious caches may collect rewards from the content publishers operating the CDN without doing any useful work. In this paper, we introduce CAPnet, the first technique that lets untrusted caches join a peer-assisted CDN while providing a bound on the effectiveness of accounting attacks. At its heart is a lightweight cache accountability puzzle that clients must solve before caches are given credit. This puzzle requires colocating the data a client has requested, so its solution confirms that the content has actually been retrieved. We analyze the security and overhead of our scheme in realistic scenarios. The results show that a modest client machine using a single core can solve puzzles at a rate sufficient to simultaneously watch dozens of 1080p videos. The technique is designed to be even more scalable on the server side. In our experiments, one core of a single low-end machine is able to generate puzzles for 4.26 Tbps of bandwidth - enabling 870,000 clients to concurrently view the same 1080p video. This demonstrates that our scheme can ensure cache accountability without degrading system productivity.

URLhttps://ieeexplore.ieee.org/document/8802825
DOI10.1109/CNS.2019.8802825
Citation Keyalmashaqbeh_capnet_2019