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

Dongming Zhang 0002

dblp:96/5692-2 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0008-0648-4188ORCID · verified

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

Security and privacy · 1 · 1 first-author · 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 · 50% Security and privacy of machine learning · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
copyright protection
0.912025
NMFT: A Copyrighted Data Trading Protocol Based on NFT and AI-Powered Merkle Feature Tree · IEEE Trans. Inf. Forensics Secur. 2025
Security and privacy of machine learning › training data protection
dataset ownership verification
0.912025
NMFT: A Copyrighted Data Trading Protocol Based on NFT and AI-Powered Merkle Feature Tree · IEEE Trans. Inf. Forensics Secur. 2025

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

merkle feature tree · 1.7locality-sensitive hashing · 1.7AI-powered feature extraction · 1.7
YearPublicationVenuePosition
2025 NMFT: A Copyrighted Data Trading Protocol Based on NFT and AI-Powered Merkle Feature Tree
abstract
With the rapid growth of blockchain-based Non-Fungible Tokens (NFTs), data trading has evolved to incorporate NFTs for ownership verification. However, the NFT ecosystem faces significant challenges in copyright protection, particularly when malicious buyers slightly modify the purchased data and remint it as a new NFT, infringing upon the original owner’s rights. In this paper, we propose a copyright-preserving data trading protocol to address this challenge. First, we introduce the Merkle Feature Tree (MFT), an enhanced version of the traditional Merkle Tree that incorporates an AI-powered feature layer above the data layer. Second, we design a copyright challenge phase during the trading process, which recognizes the data owner with highly similar feature vectors and earlier on-chain timestamp as the legitimate owner. Furthermore, to achieve efficient and low-gas feature vector similarity computation on blockchain, we employ Locality-Sensitive Hashing (LSH) to compress high-dimensional floating-point feature vectors into single uint256 integers. Experiments across multiple image feature extraction models show that LSH maintains a high F1 score after compression, effectively supporting similarity-based copyright challenges. Experimental results on the Ethereum Sepolia testnet demonstrate NMFT’s scalability with sublinear growth in gas consumption while maintaining stable latency.
Dongming Zhang 0002, Yu Tao 0004, Zhe Liu 0001
IEEE Trans. Inf. Forensics Secur.1