Pith. sign in

REVIEW 3 cited by

Building a RAPPOR with the Unknown: Privacy-Preserving Learning of Associations and Data Dictionaries

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1503.01214 v1 pith:QHLLDCVV submitted 2015-03-04 cs.CR

classification cs.CR
keywords privacy-preservingrapporstringsunknowncollecteddatadictionaryenable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Techniques based on randomized response enable the collection of potentially sensitive data from clients in a privacy-preserving manner with strong local differential privacy guarantees. One of the latest such technologies, RAPPOR, allows the marginal frequencies of an arbitrary set of strings to be estimated via privacy-preserving crowdsourcing. However, this original estimation process requires a known set of possible strings; in practice, this dictionary can often be extremely large and sometimes completely unknown. In this paper, we propose a novel decoding algorithm for the RAPPOR mechanism that enables the estimation of "unknown unknowns," i.e., strings we do not even know we should be estimating. To enable learning without explicit knowledge of the dictionary, we develop methodology for estimating the joint distribution of two or more variables collected with RAPPOR. This is a critical step towards understanding relationships between multiple variables collected in a privacy-preserving manner.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. "We Need a Standard": Toward an Expert-Informed Privacy Label for Differential Privacy

    cs.CR 2025-07 conditional novelty 7.0 of 10

    Twelve DP experts converged on a core set of parameters, including epsilon, delta, and the unit of privacy, that a standardized differential privacy label should disclose to technical audiences.

  2. SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy

    cs.LG 2026-07 reject novelty 6.0 of 10

    SteinGate gates policy updates by a boundary-aware Stein-discrepancy certificate against a user-specified safe cost distribution, reporting fewer training-time violations on continuous-control benchmarks despite theor...

  3. Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data

    cs.CR 2026-05 unverdicted novelty 6.0 of 10

    Introduces eSpat-B and eSpat+ as the first systems for efficient privacy-preserving distribution statistics on mobile spatial data using DPF with spatial partitioning, claiming up to 20x lower communication and 100% a...

Pith tools