Baobao Song

Ms. Baobao Song


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

8 May 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
BSBaobao Song
Baobao Song
Shiva Raj PokhrelShiva Raj Pokhrel
Shiva Raj Pokhrel
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
TZTianqing Zhu
Tianqing Zhu
Gang LiGang Li
Gang Li
Quantum computing offers unparalleled processing power but raises significant data privacy challenges. Quantum Differential Privacy (QDP) leverages inherent quantum noise to safeguard privacy, surpassing traditional DP. This paper develops comprehensive noise profiles, identifies noise types beneficial for QDP, and highlights the need for practical implementations beyond theoretical models. Existing QDP mechanisms, limited to single noise sources, fail to reflect the multi-source noise reality of quantum systems. We propose a resilient hybrid QDP mechanism utilizing channel and measurement noise, optimizing privacy budgets to balance privacy and utility. Additionally, we introduce Lifted Quantum Differential Privacy, offering enhanced randomness for improved privacy audits and quantum algorithm evaluation.

8 November 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
BSBaobao Song
Baobao Song
Shiva Raj PokhrelShiva Raj Pokhrel
Shiva Raj Pokhrel
MDMengyue Deng
Mengyue Deng
QLQiujun Lan
Qiujun Lan
RDRobin Doss
Robin Doss
Gang LiGang Li
Gang Li
We present a comprehensive analysis of privacy attacks and countermeasures in data-driven systems. We systematically categorize attacks targeting three domains: anonymous data (linkage and structural attacks), statistical aggregates (reconstruction and differential attacks), and privacy-preserving models (extraction, reconstruction, membership inference, and inversion attacks). For each category, we analyze attack methodologies, adversary capabilities, and vulnerability mechanisms. We further evaluate countermeasures including perturbation techniques, randomization methods, query auditing, and model-level defenses, examining their effectiveness and inherent privacy-utility tradeoffs. Our analysis reveals that while differential privacy offers strong theoretical guarantees, it faces implementation challenges and potential vulnerabilities to emerging attacks. We identify critical research directions and provide researchers and practitioners with a structured framework for understanding privacy resilience in increasingly complex data ecosystems.

5 December 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
QLQiujun Lan
Qiujun Lan
BSBaobao Song
Baobao Song
YLYang Li
Yang Li
Gang LiGang Li
Gang Li
A key step in cooperative decision-making is for all participants to achieve a consensus that avoids individual favoritism. To reach a consensus, a quantitative systematic mechanism is sometimes preferred. An example of such a mechanism is ranking aggregation, where the task is to rank elements in a certain order. While participating in ranking activities, it is also critical under certain circumstances to protect each decision maker’s preference. A promising privacy-preserving technique that is suitable for such a need is differential privacy (DP), which ensures plausible deniability of the protected information with rigorous mathematical guarantee and adjustable privacy level. A concern of the standard DP model is its assumption of letting a curator collect and analyze sensitive information, where in practical situations such a trusted independent curator may not exist. This article proposed a mechanism to solve the above issue using the distributed DP (DDP) framework. The proposed mechanism collects locally differential private rankings from individuals, and then randomly permutes pairwise rankings using a shuffle model to further amplify privacy protection. The final representative is produced by hierarchical rank aggregation (HRA). The mechanism was theoretically analyzed and experimentally compared against the existing methods and demonstrated competitive results in both output accuracy and privacy protection.

1 January 2026 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
BSBaobao Song
Baobao Song
Shiva Raj PokhrelShiva Raj Pokhrel
Shiva Raj Pokhrel
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
TZTianqing Zhu
Tianqing Zhu
Gang LiGang Li
Gang Li

16 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
BSBaobao Song
Baobao Song
Shiva Raj PokhrelShiva Raj Pokhrel
Shiva Raj Pokhrel
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
TZTianqing Zhu
Tianqing Zhu
Gang LiGang Li
Gang Li
Quantum machine learning (QML) promises significant computational advantages, yet models trained on sensitive data risk memorizing individual records, creating serious privacy vulnerabilities. While Quantum Differential Privacy (QDP) mechanisms provide theoretical worst-case guarantees, they critically lack empirical verification tools for deployed models. We introduce the first black-box privacy auditing framework for QML based on Lifted Quantum Differential Privacy, leveraging quantum canaries (strategically offset-encoded quantum states) to detect memorization and precisely quantify privacy leakage during training. Our framework establishes a rigorous mathematical connection between canary offset and trace distance bounds, deriving empirical lower bounds on privacy budget consumption that bridge the critical gap between theoretical guarantees and practical privacy verification. Comprehensive evaluations across both simulated and physical quantum hardware demonstrate our framework's effectiveness in measuring actual privacy loss in QML models, enabling robust privacy verification in QML systems.