ERASE- EntRopy-based SAnitization of SEnsitive Data for Privacy Preservation

被引:0
|
作者
Medsger, Jeffrey [1 ]
Srinivasan, Avinash [1 ]
机构
[1] George Mason Univ, Dept Comp Sci, Fairfax, VA 22030 USA
关键词
Computer Drive Sanitization; Information Security; Digital Forensics;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Effective and efficient sanitization of digital storage media is essential from both an information security as well as a digital forensics standpoint. The method proposed in this paper, ERASE, unlike brute force methods, computes the entropy of each data block in the target area, and if the entropy is within the specified sensitivity range, then that block is wiped with a user specified number of passes and pattern. ERASERS, an enhancement to ERASE that employs random sampling, is also proposed. ERASERS divides the given population into numerous subpopulations and uses random sampling to sample blocks from each subpopulation. Then, it computes the entropy of each sampled block, and if the entropy of any sampled block in the subpopulation is within the sensitive entropy range, which is a tunable parameter, then the entire subpopulation is wiped. The random sampling component of ERASERS gives organizations an alternative for a faster wipe as compared to regular brute force methods of overwriting. Our research resulted in different levels of sanitization for different time windows, a factor most organizations will consider when wiping large disks. According to Seagate, in 2011, the average size of hard drives they shipped that year was 590 GB [1]. Overwriting a 590 GB hard drive with one pass of random data, takes approximately 14.6 hours using dd. However, ERASE optimizes the data overwriting process allowing it to sanitize a 590GB hard drive in 9 : 5 hours, assuming 50% of the data on the drive is within the sensitive entropy range, thereby achieving a performance improvement of approximately 34.8%. If a wipe pattern of 1 pass using /dev/zero as the source is used, dd takes approximately 1.584 hours and ERASERS takes 0.85 hours in its best case performance and 1.580 hours in its worst case performance, assuming 50% of the data is within the sensitive entropy range. Thus, achieving a performance improvement in the range of 0.2% - 46.6%.
引用
下载
收藏
页码:427 / 432
页数:6
相关论文
共 50 条
  • [41] Entropy-Based Robust Fuzzy Clustering of Relational Data
    Mei Jian-Ping
    Chen Li-Hui
    2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), VOLS 1-6, 2008, : 385 - 390
  • [42] A First Look at Information Entropy-Based Data Pricing
    Li, Xijun
    Yao, Jianguo
    Liu, Xue
    Guan, Haibing
    2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017), 2017, : 2053 - 2060
  • [43] ENTROPY-BASED ANALYSIS OF CHIP-SEQUENCING DATA
    Zare, Hossein
    Kaveh, Mostafa
    Khodursky, Arkady B.
    2009 IEEE INTERNATIONAL WORKSHOP ON GENOMIC SIGNAL PROCESSING AND STATISTICS (GENSIPS 2009), 2009, : 88 - +
  • [44] Increasing Yields with Entropy-based Analysis of Test Data
    Engler, Joseph
    2010 IEEE AUTOTESTCON, 2010, : 138 - 143
  • [45] Entropy-Based Learning of Compositional Models from Data
    Jirousek, Radim
    Kratochvil, Vaclav
    Shenoy, Prakash P.
    BELIEF FUNCTIONS: THEORY AND APPLICATIONS (BELIEF 2021), 2021, 12915 : 117 - 126
  • [46] Relative Entropy-Based Similarity for Patterns in Graph Data
    Liu, Shihu
    Deng, Li
    Gao, Haiyan
    Ma, Xueyu
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2022, 2022
  • [47] FlashGhost: Data Sanitization with Privacy Protection Based on Frequent Colliding Hash Table
    Zhu, Yan
    Yang, Shuai
    Chu, William Cheng-Chung
    Feng, Rongquan
    2019 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (IEEE SCC 2019), 2019, : 90 - 99
  • [48] An entropy-based subspace clustering algorithm for categorical data
    Carbonera, Joel Luis
    Abel, Mara
    2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 272 - 277
  • [49] Unified entropy-based sorting for reversible data hiding
    Xu, Jiajia
    Zhang, Weiming
    Jiang, Ruiqi
    Yu, Nenghai
    MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (03) : 3829 - 3850
  • [50] An anonymous entropy-based location privacy protection scheme in mobile social networks
    Lina Ni
    Fulong Tian
    Qinghang Ni
    Yan Yan
    Jinquan Zhang
    EURASIP Journal on Wireless Communications and Networking, 2019