Database Paper Browser

Back to papers

Privacy via Pseudorandom Sketches

Summary: Per-user pseudorandom sketches yield information-theoretic privacy against unbounded adversaries with arbitrary priors. Tiny O(log log M)-bit sketches aggregate to estimate conjunction frequencies (including negations) with error independent of attribute count and depending only on user count; they compose for complex queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1386
Venue
PODS
Year
2006
Pagerank
6.7077542e-05
Overall Rank
3,843 | 73.27%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,761 The Boundary Between Privacy and Utility in Data Publishing 2007 VLDB 0.00010651764
2,899 Privacy at Scale: Local Differential Privacy in Practice 2018 SIGMOD 7.9443198e-05
3,258 Towards Robustness in Query Auditing 2006 VLDB 7.3150323e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
136 Revealing Information while Preserving Privacy 2003 PODS 0.0004241101
177 Limiting Privacy Breaches in Privacy Preserving Data Mining 2003 PODS 0.0003788711
568 Practical Privacy: The SuLQ Framework 2005 PODS 0.00019949368
955 Privacy Preserving OLAP 2005 SIGMOD 0.00015075131
2,577 Simulatable Auditing 2005 PODS 8.5099821e-05
6,277 Vision Paper: Enabling Privacy for the Paranoids 2004 VLDB 5.1311821e-05
Previous Page 1 / 1 Next

Semantically Similar Papers