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.

Shengyao Zhang

dblp:265/5635 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Digital forensics and information hiding · 30% Security and privacy of machine learning · 30% Network security · 18%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
steganography
1.422025
Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission · IEEE Trans. Pattern Anal. Mach. Intell. 2025
House of Cans: Covert Transmission of Internal Datasets via Capacity-Aware Neuron Steganography · NeurIPS 2022
Network security
covert channel
0.912025
Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission · IEEE Trans. Pattern Anal. Mach. Intell. 2025
Systems and software security › insider threat
insider attack
0.912025
Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission · IEEE Trans. Pattern Anal. Mach. Intell. 2025
Security and privacy of machine learning
model privacy
0.912025
Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission · IEEE Trans. Pattern Anal. Mach. Intell. 2025
Security and privacy of machine learning
model stealing
0.612022
House of Cans: Covert Transmission of Internal Datasets via Capacity-Aware Neuron Steganography · NeurIPS 2022
Privacy and data protection › information leakage
privacy breach
0.312025
Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission · IEEE Trans. Pattern Anal. Mach. Intell. 2025

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

parameter sharing · 2.0information hiding · 0.9
YearPublicationVenuePosition
2025 Matryoshka: Exploiting the Over-Parametrization of Deep Learning Models for Covert Data Transmission
abstract
High-quality private machine learning (ML) data stored in local data centers becomes a key competitive factor for AI corporations. In this paper, we present a novel insider attack called Matryoshka to reveal the possibility of breaking the privacy of ML data even with no exposed interface. Our attack employs a scheduled-to-publish DNN model as a carrier model for covert transmission of secret models which memorize the information of private ML data that otherwise has no interface to the outsider. At the core of our attack, we present a novel parameter sharing approach which exploits the learning capacity of the carrier model for information hiding. Our approach simultaneously achieves: (i) High Capacity - With almost no utility loss of the carrier model, Matryoshka can transmit over 10,000 real-world data samples within a carrier model which has less parameters than the total size of the stolen data, and simultaneously transmit multiple heterogeneous datasets or models within a single carrier model under a trivial distortion rate, neither of which can be done with existing steganography techniques; (ii) Decoding Efficiency - once downloading the published carrier model, an outside colluder can exclusively decode the hidden models from the carrier model with only several integer secrets and the knowledge of the hidden model architecture; (iii) Effectiveness - Moreover, almost all the recovered models either have similar performance as if it is trained independently on the private data, or can be further used to extract memorized raw training data with low error; (iv) Robustness - Information redundancy is naturally implemented to achieve resilience against common post-processing techniques on the carrier before its publishing; (v) Covertness - A model inspector with different levels of prior knowledge could hardly differentiate a carrier model from a normal model.
Xudong Pan, Mi Zhang 0001, Shengyao Zhang, Min Yang 0002
IEEE Trans. Pattern Anal. Mach. Intell.4
2022 House of Cans: Covert Transmission of Internal Datasets via Capacity-Aware Neuron Steganography
abstract
In this paper, we present a capacity-aware neuron steganography scheme (i.e., Cans) to covertly transmit multiple private machine learning (ML) datasets via a scheduled-to-publish deep neural network (DNN) as the carrier model. Unlike existing steganography schemes which treat the DNN parameters as bit strings, \textit{Cans} for the first time exploits the learning capacity of the carrier model via a novel parameter sharing mechanism. Extensive evaluation shows, Cans is the first working scheme which can covertly transmit over $10000$ real-world data samples within a carrier model which has $220\times$ less parameters than the total size of the stolen data, and simultaneously transmit multiple heterogeneous datasets within a single carrier model, under a trivial distortion rate ($<10^{-5}$) and with almost no utility loss on the carrier model ($<1\%$). Besides, Cans implements by-design redundancy to be resilient against common post-processing techniques on the carrier model before the publishing.
Xudong Pan, Shengyao Zhang, Mi Zhang 0001, Min Yang 0002
NeurIPS2
2020 Matching Questions and Answers in Dialogues from Online Forums
abstract
Matching question-answer relations between two turns in conversations is not only the first step in analyzing dialogue structures, but also valuable for training dialogue systems.This paper presents a QA matching model considering both distance information and dialogue history by two simultaneous attention mechanisms called mutual attention.Given scores computed by the trained model between each non-question turn with its candidate questions, a greedy matching strategy is used for final predictions.Because existing dialogue datasets such as the Ubuntu dataset are not suitable for the QA matching task, we further create a dataset with 1,000 labeled dialogues and demonstrate that our proposed model outperforms the state-of-the-art and other strong baselines, particularly for matching long-distance QA pairs.
Qi Jia 0003, Mengxue Zhang, Shengyao Zhang, Kenny Q. Zhu
ECAI3
2020 Automatic Classification and Comparison of Words by Difficulty
Shengyao Zhang, Qi Jia 0003, Libin Shen, Yinggong Zhao
ICONIP (4)1