VLDB 2026 Research / reviewers in the wild / expert
Shan Jiang 0023
dblp:04/2910-23
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0008-4108-5588ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Rethinking Query Choices for Differential Privacy AuditingabstractAuditing differential privacy (DP) guarantees often relies on querying trained models with specially crafted queries, such as canaries, examples differing between two neighboring datasets. However, in this work, we revisit this common approach and identify a fundamental limitation: canary-based queries may not capture the strongest privacy leakage, as the most informative queries can shift during the training process. This mismatch can result in loose lower bounds on the privacy parameter$\varepsilon$, underestimating potential risks from query-based adversaries. To address this issue, we propose two methods. First, we introduce a consistent and optimizable surrogate privacy loss function that better aligns with the true privacy loss, called Privacy-loss Maximization Method (PMM), enabling systematic discovery of stronger queries through optimization. Second, we analyze how the optimal queries evolve with model training and propose a gradient-aligned query generation algorithm, called Gradient-Guided Querying (GGQ), that rapidly identifies high-risk queries by aligning their gradients with the distribution of model parameters. Empirical evaluations across multiple tasks demonstrate that our methods consistently produce stronger privacy audit results, offering a more accurate assessment of the privacy risks associated with training algorithms. Zehang Deng, Shan Jiang 0023, Wanlun Ma, Sheng Wen, Tianqing Zhu, Yang Xiang 0001 |
IEEE Trans. Dependable Secur. Comput. | 3 |
| 2026 | A Blockchain-Based Efficient, Verifiable, and Weighted Multidimensional Data Aggregation Scheme in Smart GridsabstractThe widespread deployment of smart grids has brought significant convenience to residential life. However, it also presents key challenges for data aggregation in smart grids.M1: The hierarchical structure of smart grid consumers (e.g., residential, industrial, commercial) requires differentiated allocation strategies to meet varying electricity demands while protecting consumer privacy.M2: The existing methods, such as superincreasing sequence, often face efficiency challenges, particularly when dealing with multidimensional data.M3: Smart meters continuously collect diverse power consumption data containing users' private information, which is vulnerable to tampering or loss, compromising data integrity and impacting power dispatch decisions. To address these challenges, this paper proposes a blockchain-based, efficient, verifiable, and weighted multidimensional data aggregation scheme for smart grids. First, a novel five-layer cloud-chain-assisted multiscenario data security aggregation model is proposed. Second, instead of using superincreasing sequences, we introduce the Chinese Remainder Theorem to process multidimensional data, thereby reducing communication complexity. Additionally, the property of quadratic reciprocity is leveraged to enhance the decryption method of the Paillier cryptosystem, reducing computational overhead. A weighted aggregation function is implemented to accurately aggregate data based on different user attributes. Furthermore, we propose two sample configurations to address distinct scenario requirements. Security analysis and experimental results demonstrate that the proposed scheme meets practical requirements in terms of both security and efficiency. Chen Wang 0015, Shan Jiang 0023, Wenying Zheng, Q. M. Jonathan Wu, Debiao He |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2026 | Reverse Engineering of Industrial Protocols From Network TrafficabstractReliable protocol knowledge is often difficult to obtain in industrial networks, as industrial communications come with limited documentation, vendor-specific encodings, and opaque payloads. This lack of transparency hinders message interpretation and protocol analysis. To recover this missing protocol knowledge, network-trace-based protocol reverse engineering (PRE) infers message structure, field roles, and interaction logic directly from recorded traces. This enables protocol-aware intrusion detection, process monitoring, and protocol testing and fuzzing without access to device internals. Although PRE has advanced rapidly, existing techniques are developed under diverse objectives and assumptions. As a result, it is often unclear how isolated results relate to an end-to-end reverse-engineering workflow, and how evaluation outcomes should be compared across tasks and protocols. In this article, we cast reverse engineering of industrial protocols from network traces as a task-driven pipeline and articulate a unified task decomposition spanning message type identification, protocol syntax and semantic inference, payload pattern recognition and semantic inference, and protocol state machine reconstruction. For each task, we describe key methodological themes, common evaluation practices, and practical limitations that affect robustness and deployability in industrial settings. We further discuss security, privacy, and ethical risks that accompany increasingly capable PRE, and identify promising research directions toward more systematic, dependable, and deployment-oriented PRE methodologies. Chuan Sheng, Shan Jiang 0023, Qing-Long Han, Wei Zhou 0044, Wanlun Ma, Xiaogang Zhu 0001, Sheng Wen, Yang Xiang 0001 |
IEEE Trans. Ind. Informatics | 2 |
| 2025 | Consistency Regularization Semisupervised Learning for PolSAR Image ClassificationabstractPolarimetric Synthetic Aperture Radar (PolSAR) images have emerged as an important data source for land cover classification research due to their all‐weather, all‐day monitoring capabilities. Deep learning‐based classification methods have recently gained significant attention in PolSAR image classification since they have demonstrated excellent performance in the computer vision field. However, the main issue with deep learning‐based methods is that they require large amounts of training data. Additionally, the scarcity of labeled data is a significant challenge in the PolSAR image field. Therefore, in this article, we proposed an advanced semisupervised deep self‐training algorithm for PolSAR image classification, which utilized both labeled and unlabeled data in a semisupervised way. Then, a training optimization method and a high‐confidence sample selection strategy are proposed by integrating consistency regularization. In addition, to achieve stronger feature extraction capabilities, we designed a deep learning‐based classifier that combines residual blocks with an efficient multiscale attention module. We have conducted experiments on three popular real PolSAR datasets: 1989 Flevoland, 1991 Flevoland, and Oberpfaffenhofen. The classification results on these datasets demonstrated that the proposed method outperforms several other comparison algorithms, with overall accuracy up to 99.3%, 99.15%, and 94.12%, respectively. These results demonstrated the effectiveness of the proposed method for PolSAR image classification. Yu Wang 0017, Shan Jiang 0023 |
Int. J. Intell. Syst. | 2 |