Securing Data in Storage: A Review of Current Research
Paul Stanton
Abstract
Protecting data from malicious computer users continues to grow in importance. Whether preventing unauthorized access to personal photographs, ensuring compliance with federal regulations, or ensuring the integrity of corporate secrets, all applications require increased security to protect data from talented intruders. Specifically, as more and more files are preserved on disk the requirement to provide secure storage has increased in importance. This paper presents a survey of techniques for securely storing data, including theoretical approaches, prototype systems, and existing systems currently available. Due to the wide variety of potential solutions available and the variety of techniques to arrive at a particular solution, it is important to review the entire field prior to selecting an implementation that satisfies particular requirements. This paper provides an overview of the prominent characteristics of several systems to provide a foundation for making an informed decision. Initially, the paper establishes a set of criteria for evaluating a storage solution based on confidentiality, integrity, availability, and performance. Then, using these criteria, the paper explains the relevant characteristics of select storage systems and provides a comparison of the major differences.
Create a lesson
Related papers
Netkit: Specializing Linux Packet Delivery for Container Networks
Daniel Borkmann, Paul Chaignon
Grouper: Scheduling Groups for Multi-Tenant Microsecond-Scale Microservices
Koosha Kazemi, Mohammad Siavashi, Ahmad Siavashi et al.
SeqMoE: Toward Full-Load Performance via Predictive and Graph-Compatible MoE Offloading
Zihan Wang, Yuqi Wang, Lei Gong et al.
AKTS: Sub-Microsecond Kernel Policy Switching for Language-Model Agents
Mohammadali Khodabandehlou, Mahdi Alizadeh
Violet: Enabling Full Virtualization for M-mode RTOS on RISC-V
Taro Kito, Ryosuke Yamamoto, Keisuke Horii et al.
AutoUVM: Automated Prefetching Framework for LLMs under UVM Oversubscription
Mao Lin, Hui Feng, Xianzhong Ding et al.