Breaking The Buffer : Covert Channel Attacks by Overrunning Buffer and Countermeasures

The large capacity and energy-efficient shared Last Level Caches play a vital role in improving system performance with a relatively low power consumption in the modern processors. Unfortunately, this highly utilized shared resource often turns out to be a primary target for some malicious attackers. In particular, depending on the inherent timing difference between a cache hit and a miss, attackers in the form of malicious applications running on different cores can exchange information in an indirect manner, creating a so-called covert channel. Although many such attacks and their countermeasures have been proposed in the literature, the possibility of a newer variant cannot be underestimated. This article presents a novel covert channel attack that exploits the vulnerabilities in the existing buffer-based defence mechanism against Last Level Cache (LLC) timing attacks. Building upon the Flush+earlyReload (F+eR) attack mechanism, we demonstrate a new attack that targets the fixed buffer size limitations in the current defence implementation against F+eR. Our attack, termed “Buffer Saturation Attack” (BSA), exploits the predictability of buffer capacity and the already in-place First In First Out (FIFO) eviction policy to create reliable covert channels for transmission of confidential information between malicious applications called spy and trojan . Furthermore, we propose a defence mechanism called Request Capping (ReCap) that identifies and subsequently prevents the malicious activities by limiting the number of consecutive requests from each individual core. Through experimental analysis, we show that BSA can achieve high transmission accuracy by strategically overwhelming the buffer with carefully timed requests.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Design Automation of Electronic Systems
Published
2025-11-20
DOI
https://doi.org/10.1145/3777554
Primary Topic
Security and Verification in Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Breaking The Buffer : Covert Channel Attacks by Overrunning Buffer and Countermeasures

Arijit Nath, Arun Srivastava
ACM Transactions on Design Automation of Electronic Systems
Security and Verification in Computing
article

Breaking The Buffer : Covert Channel Attacks by Overrunning Buffer and Countermeasures

Arijit Nath, Arun Srivastava
article en

Abstract

The large capacity and energy-efficient shared Last Level Caches play a vital role in improving system performance with a relatively low power consumption in the modern processors. Unfortunately, this highly utilized shared resource often turns out to be a primary target for some malicious attackers. In particular, depending on the inherent timing difference between a cache hit and a miss, attackers in the form of malicious applications running on different cores can exchange information in an indirect manner, creating a so-called covert channel. Although many such attacks and their countermeasures have been proposed in the literature, the possibility of a newer variant cannot be underestimated. This article presents a novel covert channel attack that exploits the vulnerabilities in the existing buffer-based defence mechanism against Last Level Cache (LLC) timing attacks. Building upon the Flush+earlyReload (F+eR) attack mechanism, we demonstrate a new attack that targets the fixed buffer size limitations in the current defence implementation against F+eR. Our attack, termed “Buffer Saturation Attack” (BSA), exploits the predictability of buffer capacity and the already in-place First In First Out (FIFO) eviction policy to create reliable covert channels for transmission of confidential information between malicious applications called spy and trojan . Furthermore, we propose a defence mechanism called Request Capping (ReCap) that identifies and subsequently prevents the malicious activities by limiting the number of consecutive requests from each individual core. Through experimental analysis, we show that BSA can achieve high transmission accuracy by strategically overwhelming the buffer with carefully timed requests.

ACM Transactions on Design Automation of Electronic SystemsVol. 31(2)
Indian Institute of Technology Guwahati (IN), Indian Institute of Information Technology Guwahati (IN)
Openalex Percentile: Top 81%
Security and Verification in Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Breaking The Buffer : Covert Channel Attacks by Overrunning Buffer and Countermeasures — Arijit Nath, Arun Srivastava · ACM Transactions on Design Automation of Electronic Systems (2025) | TGRS Research Map | TGRS