Search papers, labs, and topics across Lattice.
This paper investigates the vulnerabilities in web cache systems stemming from imprecise cache key definitions, which allow attackers to exploit redundant cache entries. By generating crafted requests that target the same object but use different cache keys, the authors demonstrate how this can lead to cache degradation and increased load on origin servers, ultimately facilitating denial-of-service attacks. The study empirically analyzes the impact of these vulnerabilities across five caching proxies, revealing that precise cache-key design is critical for mitigating such risks.
Redundant cache entries can be weaponized to degrade web cache performance and escalate denial-of-service risks, revealing a critical security oversight in cache key design.
Web caches support the scalability needs of contemporary web applications by storing frequently accessed objects closer to clients. Web caches are conceptually associative arrays, tracking stored objects using cache keys consisting of HTTP request fields. However, these cache keys are often imprecisely defined by website operators. This allows clients to craft a multitude of requests that target the same object, but map to different cache keys. In this work, we show that request elements included unnecessarily in cache keys can be abused to create redundant cache entries. In susceptible deployments, sustained generation of such redundant copies reduces cache effectiveness and increases origin load, facilitating eviction-dependent attacks. Our experiments reproduce cache degradation across five stand-alone caching proxies and characterize how these parameters affect attacker cost and cache hit rate, potentially resulting in denial-of-service attacks. We conclude that precise cache-key design is the most direct mitigation against this abuse vector and should be recognized as a security best practice.
