CRDBJul 15

ReBound: Reuse-Aware Privacy For Interactive Decision Support

arXiv:2607.134411.7h-index: 2
Predicted impact top 93% in CR · last 90 daysOriginality Incremental advance
AI Analysis

For analysts running interactive sequences of threshold queries, ReBound reduces privacy cost without sacrificing utility.

ReBound enables interactive differentially private decision support by reusing cached query results to reduce privacy cost, maintaining formal utility guarantees.

Differentially private decision support frameworks answer complex aggregate threshold queries with formal bounds on false negative and false positive rates, but treat each query independently with no memory of past results. In practice, analysts work interactively, issuing sequences of related queries that refine bounds, adjust thresholds, or derive new functions from previous ones. We propose ReBound, a framework that reuses cached results from previous queries to answer new queries at reduced or zero additional privacy cost while maintaining formal utility guarantees. ReBound introduces a reuse framework for multiple refinement types, a cache graph structure for efficient lookup of reusable results, and a negotiation mechanism for when requested bounds cannot be met within budget.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes