Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Revealing information while preserving privacy
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences - Special issu on PODS 2001
Decoding error-correcting codes via linear programming
Decoding error-correcting codes via linear programming
Decoding turbo-like codes via linear programming
Journal of Computer and System Sciences - Special issue on FOCS 2002
Practical privacy: the SuLQ framework
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Uncertainty principles and ideal atomic decomposition
IEEE Transactions on Information Theory
Decoding by linear programming
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
LP Decoding Corrects a Constant Fraction of Errors
IEEE Transactions on Information Theory
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A learning theory approach to non-interactive database privacy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Distributed Private Data Analysis: Simultaneously Solving How and What
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
New Efficient Attacks on Statistical Disclosure Control Mechanisms
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Output perturbation with query relaxation
Proceedings of the VLDB Endowment
The Differential Privacy Frontier (Extended Abstract)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Universally utility-maximizing privacy mechanisms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the complexity of differentially private data release: efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing
Privacy-Preserving Data Publishing
Foundations and Trends in Databases
On the reconstruction of block-sparse signals with an optimal number of measurements
IEEE Transactions on Signal Processing
Compressed and privacy-sensitive sparse regression
IEEE Transactions on Information Theory
Differential privacy with compression
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An ad omnia approach to defining and achieving private data analysis
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
On the geometry of differential privacy
Proceedings of the forty-second ACM symposium on Theory of computing
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Universally optimal privacy mechanisms for minimax agents
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards an axiomatization of statistical privacy and utility
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A firm foundation for private data analysis
Communications of the ACM
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Differential privacy in new settings
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Differential privacy and the fat-shattering dimension of linear queries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
Practical universal random sampling
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Pan-private algorithms via statistics on sketches
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 4th ACM workshop on Security and artificial intelligence
SIAM Journal on Computing
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Unconditional differentially private mechanisms for linear queries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Optimal private halfspace counting via discrepancy
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds in differential privacy
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Distributed private heavy hitters
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Security of random output perturbation for statistical databases
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Non-interactive differential privacy: a survey
Proceedings of the First International Workshop on Open Data
A learning theory approach to noninteractive database privacy
Journal of the ACM (JACM)
The geometry of differential privacy: the sparse and approximate cases
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Pufferfish: A framework for mathematical privacy definitions
ACM Transactions on Database Systems (TODS)
Mechanism design in large games: incentives and privacy
Proceedings of the 5th conference on Innovations in theoretical computer science
Differentially private histogram publication
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.08 |
This work is at theintersection of two lines of research. One line, initiated by Dinurand Nissim, investigates the price, in accuracy, of protecting privacy in a statistical database. The second, growing from an extensive literature on compressed sensing (see in particular the work of Donoho and collaborators [4,7,13,11])and explicitly connected to error-correcting codes by Candès and Tao ([4]; see also [5,3]), is in the use of linearprogramming for error correction. Our principal result is the discovery of a sharp threshhold ρ*∠ 0.239, so that if ρ A is a random m x n encoding matrix of independently chosen standardGaussians, where m = O(n), then with overwhelming probability overchoice of A, for all x ∈ Rn, LP decoding corrects ⌊ ρ m⌋ arbitrary errors in the encoding Ax, while decoding can be made to fail if the error rate exceeds ρ*. Our boundresolves an open question of Candès, Rudelson, Tao, and Vershyin [3] and (oddly, but explicably) refutesempirical conclusions of Donoho [11] and Candès et al [3]. By scaling and rounding we can easilytransform these results to obtain polynomial-time decodable random linear codes with polynomial-sized alphabets tolerating any ρ In the context of privacy-preserving datamining our results say thatany privacy mechanism, interactive or non-interactive, providingreasonably accurate answers to a 0.761 fraction of randomly generated weighted subset sum queries, and arbitrary answers on the remaining 0.239 fraction, is blatantly non-private.