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 条
  • [1] A privacy preservation data collection and access control using entropy-based conic curve
    Kumar, M. Venkatesh
    Lakshmi, C.
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (05) : 7629 - 7642
  • [2] Data Sanitization for Privacy Preservation on Social Network
    Tambe, Prajakta
    Vora, Deepali
    [J]. 2016 INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL AND DYNAMIC OPTIMIZATION TECHNIQUES (ICACDOT), 2016, : 972 - 976
  • [3] Robust and lossless data privacy preservation: optimal key based data sanitization
    G. K. Shailaja
    C. V. Guru Rao
    [J]. Evolutionary Intelligence, 2022, 15 : 1123 - 1134
  • [4] Robust and lossless data privacy preservation: optimal key based data sanitization
    Shailaja, G. K.
    Rao, C. V. Guru
    [J]. EVOLUTIONARY INTELLIGENCE, 2022, 15 (02) : 1123 - 1134
  • [5] Proposed Data Sanitization for Privacy Preservation in Mobile Computing
    Awasthi, Sameer
    Rizvi, Syed Wajahat Abbas
    [J]. CYBERNETICS AND SYSTEMS, 2024, 55 (07) : 1729 - 1756
  • [6] Privacy Preservation on Social Network using Data Sanitization
    Tambe, Prajakta
    Vora, Deepali
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON RECENT TRENDS IN ELECTRONICS, INFORMATION & COMMUNICATION TECHNOLOGY (RTEICT), 2016, : 751 - 753
  • [7] Lossless and robust privacy preservation of association rules in data sanitization
    Navale, Geeta S.
    Mali, Suresh N.
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 1415 - 1428
  • [8] Lossless and robust privacy preservation of association rules in data sanitization
    Geeta S. Navale
    Suresh N. Mali
    [J]. Cluster Computing, 2019, 22 : 1415 - 1428
  • [9] An Entropy-based Analytic Model for the Privacy-Preserving in Open Data
    Kim, Soo-Hyung
    Jung, Changwook
    Lee, Yoon-Joon
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2016, : 3676 - 3684
  • [10] Novel entropy-based approach for cost-effective privacy preservation of intermediate datasets in cloud
    Begum, R. Sabin
    Sugumar, R.
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 4): : S9581 - S9588