Demo Data from EDBT 2026 / reviewers in the wild / expert
Chuanghong Weng
dblp:360/6188
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-3721-1963ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 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
2 papers |
Privacy and data protection · 87% Network security · 13% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy protection mechanisms
inference attack defense |
0.9 | 1 | 2025 | A Security Mechanism Against Inference Attacks on Networked Systems · IEEE Trans. Inf. Forensics Secur. 2025 |
Information theory › privacy
privacy-utility tradeoff |
0.9 | 1 | 2025 | Optimal Privacy-Aware Stochastic Sampling · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
policy gradient · 1.7implicit function theorem · 1.7dynamic decomposition · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Security Mechanism Against Inference Attacks on Networked Systems
Ehsan Nekouei, Mohammad Pirani, Chuanghong Weng, Michaël A. van Wyk |
IEEE Trans. Inf. Forensics Secur. | 3 |
| 2025 | Optimal Privacy-Aware Stochastic SamplingabstractThis paper presents a stochastic sampling framework for privacy-aware data sharing, where a sensor observes a process correlated with private information. A sampler determines whether to retain or discard sensor observations, balancing the tradeoff between data utility and privacy. Retained samples are shared with an adversary who may attempt to infer the private process, with privacy leakage quantified using mutual information. The sampler design is formulated as an optimization problem with two objectives: (i) minimizing the reconstruction error of the observed process using the sampler’s output, (ii) reducing the privacy leakages. For a general class of processes, we show that the optimal reconstruction policy is deterministic and derive the optimality conditions for the sampling policy using a dynamic decomposition method, which enables the sampler to control the adversary’s belief about private inputs. For linear Gaussian processes, we propose a simplified design by restricting the sampling policy to a specific collection, providing analytical expressions for the reconstruction error, belief state, and sampling objectives based on conditional means and covariances. Additionally, we develop a numerical optimization algorithm to optimize the sampling and reconstruction policies, wherein the policy gradient theorem for the optimal sampling design is derived based on the implicit function theorem. Simulations demonstrate the effectiveness of the proposed method in achieving accurate state reconstruction, privacy protection, and data size reduction. Chuanghong Weng, Ehsan Nekouei |
IEEE Trans. Inf. Forensics Secur. | 1 |