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

Wantong Zheng

dblp:214/2506 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0003-0925-4624ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1

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 · 61% Systems and software security · 39%

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

TopicWeightPapersLastEvidence papers
Systems and software security › software protection › code obfuscation
control flow obfuscation
0.412019
Xmark: Dynamic Software Watermarking Using Collatz Conjecture · IEEE Trans. Inf. Forensics Secur. 2019
Digital forensics and information hiding › watermarking › software watermarking
dynamic watermarking
0.412019
Xmark: Dynamic Software Watermarking Using Collatz Conjecture · IEEE Trans. Inf. Forensics Secur. 2019
Digital forensics and information hiding › watermarking
software watermarking
0.412019
Xmark: Dynamic Software Watermarking Using Collatz Conjecture · IEEE Trans. Inf. Forensics Secur. 2019

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

control flow obfuscation · 0.4collatz conjecture · 0.4
YearPublicationVenuePosition
2019 Xmark: Dynamic Software Watermarking Using Collatz Conjecture
abstract
Dynamic software watermarking is one of the major countermeasures against software licensing violations. However, conventional dynamic watermarking approaches have exhibited a number of weaknesses including exploitable payload semantics, exploitable embedding/recognition procedures, and weak correlation between payload and subject software. This paper presents a novel dynamic watermarking method, Xmark, which leverages a well-known unsolved mathematical problem referred to as the Collatz conjecture. Our method works by transforming selected conditional constructs (which originally belonged to the software to be watermarked) with a control flow obfuscation technique based on Collatz conjecture. These obfuscation routines are built in a particular way such that they are able to express a watermark in the form of iteratively executed branching activities occurred during computing the aforementioned conjecture. Exploiting the one-to-one correspondence between natural numbers and their orbits computed by the conjecture (also known as the “Hailstone sequences”), Xmark's watermark-related activities are designed to be insignificant without the pre-defined secret input. Meanwhile, being integrated with obfuscation techniques, our method is able to resist attacks based on various reverse engineering techniques on both syntax and semantic levels. Analyses and simulations indicated that Xmark could evade detections via pattern matching and model checking, and meanwhile effectively prohibit dynamic symbolic execution. We have also shown that our method could remain robust even if a watermarked software is compromised via re-obfuscation using approaches like control flow flattening.
Chunfu Jia, Shijia Li, Wantong Zheng, Dinghao Wu
IEEE Trans. Inf. Forensics Secur.4
2018 K-Anonymity Algorithm Based on Improved Clustering
Wantong Zheng, Zhongyue Wang, Tongtong Lv, Chunfu Jia
ICA3PP (2)1