Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Rahaf Abdullah

dblp:343/5879 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0006-1233-4472ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Security and privacy · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Memory systems · 64% Storage systems · 16% Hardware reliability and fault tolerance · 12%
Network and information security
4 papers
Hardware security and side channels · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels › memory security
memory encryption and integrity
1.422024
Salus: Efficient Security Support for CXL-Expanded GPU Memory · HPCA 2024
Plutus: Bandwidth-Efficient Memory Security for GPUs · HPCA 2023
Hardware security and side channels
memory security
1.012026
Coeus: Secure Similarity-Aware Data Integrity Verification for Secure Memories · IEEE Trans. Dependable Secur. Comput. 2026
Storage systems › data auditing
data integrity verification
1.012026
Coeus: Secure Similarity-Aware Data Integrity Verification for Secure Memories · IEEE Trans. Dependable Secur. Comput. 2026
Memory systems
secure memory
1.012026
Coeus: Secure Similarity-Aware Data Integrity Verification for Secure Memories · IEEE Trans. Dependable Secur. Comput. 2026
Memory systems
hybrid memory
0.812024
Salus: Efficient Security Support for CXL-Expanded GPU Memory · HPCA 2024
Hardware reliability and fault tolerance
memory reliability
0.812024
RC-NVM: Recovery-Aware Reliability-Security Co-Design for Non-Volatile Memories · IEEE Trans. Dependable Secur. Comput. 2024
Memory systems
non-volatile memory
0.812024
RC-NVM: Recovery-Aware Reliability-Security Co-Design for Non-Volatile Memories · IEEE Trans. Dependable Secur. Comput. 2024
Memory systems › non-volatile memory
secure non-volatile memory
0.812024
RC-NVM: Recovery-Aware Reliability-Security Co-Design for Non-Volatile Memories · IEEE Trans. Dependable Secur. Comput. 2024
Hardware security and side channels › memory integrity
memory authentication
0.212024
RC-NVM: Recovery-Aware Reliability-Security Co-Design for Non-Volatile Memories · IEEE Trans. Dependable Secur. Comput. 2024
GPUs and heterogeneous computing
GPU memory management
0.212024
Salus: Efficient Security Support for CXL-Expanded GPU Memory · HPCA 2024

Methods — techniques the papers use, named apart from their topics

message authentication code · 3.5data similarity exploitation · 2.0write-back cache · 1.5security metadata management · 1.5integrity verification · 1.5value locality · 1.3integrity tree · 1.3encryption counters · 1.3
YearPublicationVenuePosition
2026 Coeus: Secure Similarity-Aware Data Integrity Verification for Secure Memories
abstract
As secure memory support is becoming an essential part of modern processors, minimizing its performance overheads is crucial. With the ever-increasing complexity of attacks, more users desire to enable memory security primitives in environments with minimal physical control (e.g., cloud systems and edge devices). However, the performance overheads are burdening the wide adoption of such support. In particular, the performance overheads for data integrity verification are very costly. Thus, a timely need is to revisit secure memory implementations and provide practical optimizations to bridge the performance gap between secure and non-secure memory systems. In this paper, we exploit many applications' well-known data similarity characteristics to reduce the performance overheads of integrity verification significantly. Specifically, we proposeCoeus, a secure memory implementation that allows secure exploitation of data similarity in improving the performance of integrity verification. We discuss the security challenges for exploiting data similarity and how we elegantly overcome them in well-established secure memory implementations. Our evaluation, based on memory-intensive benchmarks from SPEC2006 and SPEC2017, shows that Coeus can eliminate 33.2% (up to 99%) of the expensive MAC calculations and thus improve the performance by 21.8% (up to 90%).
Kazi Abu Zubair, Rahaf Abdullah, David Mohaisen, Tamara Silbergleit Lehman, Amro Awad
IEEE Trans. Dependable Secur. Comput.2
2024 Salus: Efficient Security Support for CXL-Expanded GPU Memory
abstract
GPUs have become indispensable accelerators for many data-intensive applications such as scientific workloads, deep learning models, and graph analytics; these applications share a common demand for increasingly large memory. As the memory capacity connected through traditional memory interfaces is reaching limits, heterogeneous memory systems have gained traction in expanding the memory pool. These systems involve dynamic data movement between different memory locations for efficient utilization, which poses challenges for existing security implementations, whose metadata are tied to the physical location of data. In this work, we propose a new security model specifically designed for systems with dynamic page migration. Our model minimizes the need for security recalculations due to data movement, optimizes security structures for efficient bandwidth utilization, and reduces the overall traffic caused by security operations. Based on our evaluation, our proposed security support improves the GPU throughput by a geometric mean of 29.94% (up to 190.43%) over the conventional security model, and it reduces the security traffic in the memory subsystem to 47.79% on average (as low as 17.71% overhead).
Rahaf Abdullah, Hyokeun Lee, Huiyang Zhou, Amro Awad
HPCA1
2024 RC-NVM: Recovery-Aware Reliability-Security Co-Design for Non-Volatile Memories
abstract
Non-Volatile Memory (NVM) technologies are now available in the form of byte-addressable and fast main memory. Despite their benefits, such memories require secure and reliable memory management to prevent malicious and spontaneous data alteration. However, in NVM security, it is still a major challenge to maintain crash consistency and reliable system recovery. In particular, Message Authentication Codes (MAC) are rarely discussed in recent recovery-aware NVM studies since they are generally not cached. MACs have outstanding sensitivity to memory errors and hence they can be used for reliability enhancement alongside their mainstream use to detect malicious tampering. However, persisting MACs is challenging and requires 2x writes and reads in a conventional secure NVM system. It is possible to cache MACs in a MAC-assisted reliability scheme; however, this brings many challenges related to crash consistency and reliability. In this paper, we present the difficulties associated with MAC recovery if they are cached, and solutions to guarantee reliable system recovery. Finally, we propose a novel scheme,Recoverable andChipkill capableNVM, RC-NVM, which can effectively use a volatile write-back cache for MACs as well as recover them quickly after a system crash. Our scheme reduces 27% of the writes and allows 18.2% performance improvement compared to the state-of-the-art, while preserving the ability to recover from a system crash.
Kazi Abu Zubair, Rahaf Abdullah, David Mohaisen, Amro Awad
IEEE Trans. Dependable Secur. Comput.2
2023 Plutus: Bandwidth-Efficient Memory Security for GPUs
abstract
Graphic-Processing Units (GPUs) are increasingly used in systems where security is a critical design requirement. Such systems include cloud computing, safety-critical systems, and edge devices, where sensitive data is processed or/and generated. Thus, the ability to reduce the attack surface while achieving high performance is of utmost importance. However, adding security features to GPUs comes at the expense of high-performance overheads due to the extra memory bandwidth required to handle security metadata. In particular, memory authentication metadata (e.g., authentication tags) along with encryption counters can lead to significant performance overheads due to the memory bandwidth used to fetch the metadata. Such metadata can lead to more than 200% extra bandwidth usage for irregular access patterns.In this work, we propose a novel design, Plutus, which enables low-overhead secure GPU memory. Plutus has three key ideas. The first is to leverage value locality to reduce authentication metadata. Our observation is that a large percentage of memory accesses could be verified without the need to bring the authentication tags. Specifically, through comparing decrypted blocks against known/verified values, we can with high confidence guarantee that no tampering occurred. Our analysis shows that the probability of the decryption of a tampered (and/or replayed) block leading to a known value is extremely low, in fact, lower than the collision probability in the most secure hash functions. Second, based on the observation that many GPU workloads have limited numbers of dirty block evictions, Plutus proposes a second layer of compact counters to reduce the memory traffic due to both the encryption counters and integrity tree. Third, by exploring the interesting tradeoff between the integrity tree organization vs. metadata fetch granularity, Plutus uses smaller block sizes for security metadata caches to optimize the number of security metadata memory requests. Based on our evaluation, Plutus can improve the GPU throughput by 16.86% (up to 58.38%) and reduce the memory bandwidth usage of secure memory by 48.14% (up to 80.30%).
Rahaf Abdullah, Huiyang Zhou, Amro Awad
HPCA1