activity
20242026
collaborators

8 papers

cs.CR2026

HNSecW: A Logarithmic-Time MPC Protocol for Approximate Nearest Neighbor Search

Fahong Zhang, Weijie Jin, Lixu Wang +3

As a core component of modern RAG systems, approximate nearest neighbor (ANN) search has been extensively studied for decades. In practice, deploying ANN often requires symmetric p…

cs.CR2026

Data Agents Under Attack: Vulnerabilities in LLM-Driven Analytical Systems

Kuncan Wang, Ziting Wang, Peizhuo Lv +4

Data agents integrate LLM-driven reasoning with relational data access, executable analytical tools, and multi-step workflow orchestration, making them increasingly central to ente…

cs.CR2026

Defense against Poisoning Attacks under Shuffle-DP

Siyi Wang, Qiyao Luo, Yihua Hu +6

Differential Privacy (DP) has become the gold standard for protecting individual privacy in data analytics, and the shuffle-DP model has attracted significant attention from both a…

cs.DB2026

Acyclic Graph Pattern Counting under Local Differential Privacy

Yihua Hu, Kuncan Wang, Wei Dong

Graph pattern counting serves as a cornerstone of network analysis with extensive real-world applications. Its integration with local differential privacy (LDP) has gained growing…

cs.DB2025

N2E: A General Framework to Reduce Node-Differential Privacy to Edge-Differential Privacy for Graph Analytics

Yihua Hu, Hao Ding, Wei Dong

Differential privacy (DP) has been widely adopted to protect sensitive information in graph analytics. While edge-DP, which protects privacy at the edge level, has been extensively…

cs.DB2025

A General Framework for Per-record Differential Privacy

Xinghe Chen, Dajun Sun, Quanqing Xu +1

Differential Privacy (DP) is a widely adopted standard for privacy-preserving data analysis, but it assumes a uniform privacy budget across all records, limiting its applicability…

cs.CR2024

Secure Query Processing with Linear Complexity

Qiyao Luo, Yilei Wang, Wei Dong +1

We present LINQ, the first join protocol with linear complexity (in both running time and communication) under the secure multi-party computation model (MPC). It can also be extend…

cs.CR2024

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy

Wei Dong, Qiyao Luo, Giulia Fanti +2

Differentially private mechanisms achieving worst-case optimal error bounds (e.g., the classical Laplace mechanism) are well-studied in the literature. However, when typical data a…