A general framework defends any shuffle-DP protocol against poisoning attacks on union-preserving queries, retaining asymptotically equivalent error without attacks and only polylogarithmic increase with constant attackers.
Title resolution pending
3 Pith papers cite this work, alongside 174 external citations. Polarity classification is still indexing.
3
Pith papers citing it
174
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
A technique for enforcing differential privacy in temporal runtime monitoring by analyzing dependencies and injecting noise into specifications while using tree mechanisms to limit accuracy loss.
BaCon combines factorized join computation with workload-aware domain quantization to evaluate batches of counting queries 2×–178× faster than independent or post-filtering baselines, without modifying DBMS internals.
citing papers explorer
-
Defense against Poisoning Attacks under Shuffle-DP
A general framework defends any shuffle-DP protocol against poisoning attacks on union-preserving queries, retaining asymptotically equivalent error without attacks and only polylogarithmic increase with constant attackers.
-
Differentially Private Runtime Monitoring
A technique for enforcing differential privacy in temporal runtime monitoring by analyzing dependencies and injecting noise into specifications while using tree mechanisms to limit accuracy loss.
-
BaCon: Efficient Batch Processing of Counting Queries [Full Version]
BaCon combines factorized join computation with workload-aware domain quantization to evaluate batches of counting queries 2×–178× faster than independent or post-filtering baselines, without modifying DBMS internals.