Proceedings Article10.1109/SISW.2007.11
Securing Disk-Resident Data through Application Level Encryption
Ramya Prabhakar,Seung Woo Son,Christina M. Patrick,Sri Hari Krishna Narayanan,Mahmut Kandemir +4 more
- 27 Sep 2007
- pp 46-57
TL;DR: This paper proposes an application-level solution, which allows encryption of select data blocks, and quantifies the tradeoffs between confidentiality and performance, evaluating a reuse distance oriented approach for selective encryption of disk-resident data and proposing a profile-guided approach that approximates the behavior of the reuse distanceoriented approach.
read more
Abstract: Confidentiality of disk-resident data is critical for end-to-end security of storage systems. While there are several widely used mechanisms for ensuring confidentiality of data in transit, techniques for providing confidentiality when data is stored in a disk subsystem are relatively new. As opposed to prior file system based approaches to this problem, this paper proposes an application-level solution, which allows encryption of select data blocks. We make three major contributions: 1) quantifying the tradeoffs between confidentiality and performance; 2) evaluating a reuse distance oriented approach for selective encryption of disk-resident data; and 3) proposing a profile-guided approach that approximates the behavior of the reuse distance oriented approach. The experiments with five applications that manipulate disk-resident data sets clearly show that our approach enables us to study the confidentiality/performance tradeoffs. Using our approach it is possible to reduce the performance degradation due to encryption/decryption overheads on an average by 46.5%, when DES is used as the encryption mechanism, and the same by 30.63%, when AES is used as the encryption mechanism.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
An effective privacy protection scheme for cloud computing
I-Hsun Chuang,Syuan-Hao Li,Kuan-Chieh Huang,Yau-Hwang Kuo +3 more
- 07 Apr 2011
TL;DR: The Effective Privacy Protection Scheme (EPPS) is proposed to provide the appropriate privacy protection which is satisfying the user-demand privacy requirement and maintaining system performance simultaneously.
49
•Posted Content
Long Term Confidentiality: a Survey.
TL;DR: In this article, the authors overview known methods to alleviate key agreement and key management problems, whilst retaining some form of information theoretic security relevant for long-term confidentiality for sensitive electronic data.
•Journal Article
Dynamic and Verifiable Hierarchical Secret Sharing.
TL;DR: This work provides a framework for dynamic secret sharing and presents the first dynamic and verifiable hierarchical secret sharing scheme based on Birkhoff interpolation, which allows, without reconstructing the message distributed, to add and remove shareholders, to renew shares, and to modify the conditions for accessing the message.
18
Dynamic and Verifiable Hierarchical Secret Sharing
Giulia Traverso,Denise Demirel,Johannes Buchmann +2 more
- 09 Aug 2016
TL;DR: In this article, the first dynamic and verifiable hierarchical secret sharing scheme based on Birkhoff interpolation is presented, which allows to add and remove shareholders, renew shares, and modify the conditions for accessing the message.
14
Parity Check based redistribution of secret shares
Yvo Desmedt,Kirill Morozov +1 more
- 14 Jun 2015
TL;DR: This work presents an unconditionally secure solution assuming that at most t out of 3t+1 parties are actively corrupt, and uses properties of the parity-check matrix of a Generalized Reed-Solomon code.
11
References
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Security Architecture for the Internet Protocol
R. Atkinson
- 01 Aug 1995
TL;DR: The Security Architecture for the Internet Protocol describes an updated version of the security architecture for IP traffic.
•Book
Advanced Compiler Design and Implementation
Steven S. Muchnick
- 01 Jan 1997
TL;DR: Advanced Compiler Design and Implementation by Steven Muchnick Preface to Advanced Topics
2.6K
A data locality optimizing algorithm
Michael Wolf,Monica S. Lam +1 more
- 01 May 1991
TL;DR: An algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling is proposed, and is successful in optimizing codes such as matrix multiplication, successive over-relaxation, LU decomposition without pivoting, and Givens QR factorization.
•Proceedings Article
Why Johnny can't encrypt: a usability evaluation of PGP 5.0
Alma Whitten,J. D. Tygar +1 more
- 23 Aug 1999
TL;DR: It is concluded that PGP 5.0 is not usable enough to provide effective security for most computer users, despite its attractive graphical user interface, supporting the hypothesis that user interface design for effective security remains an open problem.