Papers › Improving Utility and Security of the Shuffler-based Differential Privacy

Improving Utility and Security of the Shuffler-based Differential Privacy

30 Aug 2019arXiv:1908.11515archive 2025-07-28

Tianhao Wang, Bolin Ding, Min Xu, Zhicong Huang, Cheng Hong, Jingren Zhou, Ninghui Li, Somesh Jha

When collecting information, local differential privacy (LDP) alleviates privacy concerns of users because their private information is randomized before being sent it to the central aggregator. LDP imposes large amount of noise as each user executes the randomization independently. To address this issue, recent work introduced an intermediate server with the assumption that this intermediate server does not collude with the aggregator. Under this assumption, less noise can be added to achieve the same privacy guarantee as LDP, thus improving utility for the data collection task. This paper investigates this multiple-party setting of LDP. We analyze the system model and identify potential adversaries. We then make two improvements: a new algorithm that achieves a better privacy-utility tradeoff; and a novel protocol that provides better protection against various attacks. Finally, we perform experiments to compare different methods and demonstrate the benefits of using our proposed method.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1908.11515")

Code

Syntology Ran 0 of 13 code samples harvested from 1 repository linked to this paper; 13 have no recorded run.

By repository: official repository: 13 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 0 ran; 0 honoured the contract we drafted; 13 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

13unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from vvv214/LDP_Protocols. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

EM vvv214/LDP_Protocols/sw.py official repository unverified MIT (permissive) · a132c0ee784427bc · report
EMS vvv214/LDP_Protocols/sw.py official repository unverified MIT (permissive) · 3cd53663eafdfcb3 · report
blanket vvv214/LDP_Protocols/murs/analysis.py official repository unverified MIT (permissive) · 4b1e85aed933904e · report
blanket_naive vvv214/LDP_Protocols/murs/analysis.py official repository unverified MIT (permissive) · cd0853e7e5bfd09d · report
blanket_naive_olh vvv214/LDP_Protocols/murs/analysis.py official repository unverified MIT (permissive) · c2b62391ab3e2b9e · report
build_range_tree vvv214/LDP_Protocols/hio/range_tree.py official repository unverified MIT (permissive) · c83528b6198f50d9 · report
elgamal_dec vvv214/LDP_Protocols/murs/ec_crypto.py official repository unverified MIT (permissive) · 88e753c593c5eb8c · report
evaluate vvv214/LDP_Protocols/pem/exp.py official repository unverified MIT (permissive) · deb84a6ea4773da4 · report
lh vvv214/LDP_Protocols/pem/fo.py official repository unverified MIT (permissive) · ef3081e80fa04f63 · report
lh_aggregate vvv214/LDP_Protocols/pem/fo.py official repository unverified MIT (permissive) · adec0e0a0b645dfa · report
lh_perturb vvv214/LDP_Protocols/pem/fo.py official repository unverified MIT (permissive) · 7af17629cdb65c23 · report
sw vvv214/LDP_Protocols/sw.py official repository unverified MIT (permissive) · b2d9f45140070391 · report
traverse_range_tree vvv214/LDP_Protocols/hio/range_tree.py official repository unverified MIT (permissive) · f8a73171cb0f9bab · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections