TY - GEN

T1 - A learning theory approach to non-interactive database privacy

AU - Blum, Avrim

AU - Liqett, Katrina

AU - Roth, Aaron

PY - 2008

Y1 - 2008

N2 - We demonstrate that, ignoring computational constraints, it is possible to release privacy-preserving databases that are useful for all queries over a discretized domain from any given concept class with polynomial VC-dimension. We show a new lower bound for releasing databases that are useful for halfspace queries over a continuous domain. Despite this, we give a privacy-preserving polynomial time algorithm that releases information useful for all half-space queries, for a slightly relaxed definition of usefulness. Inspired by learning theory, we introduce a new notion of data privacy, which we call distributional privacy, and show that it is strictly stronger than the prevailing privacy notion, differential privacy.

AB - We demonstrate that, ignoring computational constraints, it is possible to release privacy-preserving databases that are useful for all queries over a discretized domain from any given concept class with polynomial VC-dimension. We show a new lower bound for releasing databases that are useful for halfspace queries over a continuous domain. Despite this, we give a privacy-preserving polynomial time algorithm that releases information useful for all half-space queries, for a slightly relaxed definition of usefulness. Inspired by learning theory, we introduce a new notion of data privacy, which we call distributional privacy, and show that it is strictly stronger than the prevailing privacy notion, differential privacy.

KW - Learning theory

KW - Non-interactive database privacy

UR - http://www.scopus.com/inward/record.url?scp=57049136138&partnerID=8YFLogxK

U2 - 10.1145/1374376.1374464

DO - 10.1145/1374376.1374464

M3 - Conference contribution

AN - SCOPUS:57049136138

SN - 9781605580470

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 609

EP - 617

BT - STOC'08

PB - Association for Computing Machinery

T2 - 40th Annual ACM Symposium on Theory of Computing, STOC 2008

Y2 - 17 May 2008 through 20 May 2008

ER -