Assessing Data Usefulness for Failure Analysis in Anonymized System Logs

被引:4
|
作者
Ghiasvand, Siavash [1 ]
Ciorba, Florina M. [2 ]
机构
[1] Tech Univ Dresden, Dresden, Germany
[2] Univ Basel, Basel, Switzerland
关键词
D O I
10.1109/ISPDC2018.2018.00031
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
System logs are a valuable source of information for the analysis and understanding of systems behavior for the purpose of improving their performance. Such logs contain various types of information, including sensitive information. Information deemed sensitive can either directly be extracted from system log entries by correlation of several log entries, or can be inferred from the combination of the (non-sensitive) information contained within system logs with other logs and/or additional datasets. The analysis of system logs containing sensitive information compromises data privacy. Therefore, various anonymization techniques, such as generalization and suppression have been employed, over the years, by data and computing centers to protect the privacy of their users, their data, and the system as a whole. Privacy-preserving data resulting from anonymization via generalization and suppression may lead to significantly decreased data usefulness, thus, hindering the intended analysis for understanding the system behavior. Maintaining a balance between data usefulness and privacy preservation, therefore, remains an open and important challenge. Irreversible encoding of system logs using collision-resistant hashing algorithms, such as SHAKE-128, is a novel approach previously introduced by the authors to mitigate data privacy concerns. The present work describes a study of the applicability of the encoding approach from earlier work on the system logs of a production high performance computing system. Moreover, a metric is introduced to assess the data usefulness of the anonymized system logs to detect and identify the failures encountered in the system.
引用
收藏
页码:164 / 171
页数:8
相关论文
共 50 条
  • [1] Outsourcing security analysis with anonymized logs
    Zhang, Jianqing
    Borisov, Nikita
    Yurcik, William
    2006 SECURECOMM AND WORKSHOPS, 2006, : 418 - +
  • [2] DATA PRIVACY FOR SIMPLY ANONYMIZED SOCIAL NETWORK LOGS REPRESENTED AS GRAPHS - CONSIDERATIONS FOR GRAPH ALTERATION OPERATIONS
    Nettleton, David F.
    Torra, Vicenc
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2011, 19 : 107 - 125
  • [3] Data system for assessing probability of failure in SME reorganization
    Laitinen, Erkki K.
    INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 2008, 108 (07) : 849 - 866
  • [4] ServerRCA: Root Cause Analysis for Server Failure using Operating System Logs
    Shi, Jiahao
    Jiang, Sihang
    Xu, Bo
    Xiao, Yanghua
    2023 IEEE 34TH INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING, ISSRE, 2023, : 486 - 496
  • [5] MEASUREMENT SYSTEM LOGS ANALOG DATA
    MORLEY, RE
    ELECTRONICS, 1976, 49 (08): : 173 - 174
  • [6] Data Mining Algorithms in the Analysis of Security Logs from a Honeypot System
    Buda, Michal
    Bluemke, Ilona
    DEPENDABILITY ENGINEERING AND COMPLEX SYSTEMS, 2016, 470 : 63 - 73
  • [7] Assessing Big Data SQL Frameworks for Analyzing Event Logs
    Hinkka, Markku
    Lehto, Teemu
    Heljanko, Keijo
    2016 24TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP), 2016, : 101 - 108
  • [8] Assessing and Improving the Effectiveness of Logs for the Analysis of Software Faults
    Cinque, Marcello
    Cotroneo, Domenico
    Natella, Roberto
    Pecchia, Antonio
    2010 IEEE-IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS DSN, 2010, : 457 - 466
  • [9] Assessing Time Coalescence Techniques for the Analysis of Supercomputer Logs
    Di Martino, Catello
    Cinque, Marcello
    Cotroneo, Domenico
    2012 42ND ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2012,
  • [10] A DATA ACQUISITION SYSTEM FOR RADIATION WELL LOGS
    CROSBY, JB
    LOGAN, JD
    TRANSACTIONS-AMERICAN GEOPHYSICAL UNION, 1968, 49 (02): : 522 - &