Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yaosheng Li

dblp:294/1952 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 67% Usable security · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › attack investigation
attack reconstruction
0.512021
General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic Analysis · IEEE Trans. Inf. Forensics Secur. 2021
Usable security › security operations
audit log analysis
0.512021
General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic Analysis · IEEE Trans. Inf. Forensics Secur. 2021
Digital forensics and information hiding
digital forensics
0.512021
General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic Analysis · IEEE Trans. Inf. Forensics Secur. 2021
Storage systems
data reduction
0.112021
General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic Analysis · IEEE Trans. Inf. Forensics Secur. 2021

Methods — techniques the papers use, named apart from their topics

semantic compaction · 1.0dependency analysis · 1.0
YearPublicationVenuePosition
2021 General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic Analysis
abstract
The damage caused by Advanced Persistent Threat (APT) attacks to governments and large enterprises is gradually escalating. Once an attack event is detected, forensic analysis will use the dependencies between system audit logs to rapidly locate intrusion points and determine the impact of the attacks. Due to the high persistence of APT attacks, huge amounts of data will be stored to meet the needs of forensic analysis, which not only brings great storage overhead, but also sharply increases the computing costs. To compact data without affecting forensic analysis, several methods have been proposed. However, in real-world scenarios, we meet the problems of weak cross-platform capability, large data processing overhead, and poor real-time performance, rendering existing data compaction methods difficult to meet the usability and universality requirements jointly. To overcome these difficulties, this paper proposes a general, efficient, and real-time data compaction method at the system log level; it does not involve internal analysis of the program or depend on the specific operating system type, and it includes two strategies: 1) data compaction of maintaining global semantics (GS), which determines and deletes redundant events that do not affect global dependencies, and 2) data compaction based on suspicious semantics (SS). Given that the purpose of forensic analysis is to restore the attack chain, SS performs context analysis on the remaining events from GS and further deletes the parts that are not related to the attack. The results of the real-world experiments show that the compaction ratios of our method to system events are as high as$4.36\times $to$13.18\times $and$7.86\times $to$26.99\times $on GS and SS, respectively, which is better than state-of-the-art studies.
Tiantian Zhu 0001, Linqi Ruan, Chun-lin Xiong, Jinkai Yu, Yaosheng Li, Yan Chen 0004, Mingqi Lv, Tieming Chen
IEEE Trans. Inf. Forensics Secur.6