Rakesh Agrawal
Ramakrishnan Srikant
ABSTRACT
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (randomized) in order to preserve privacy before it is integrated at the server. We develop formal notions of privacy obtained from data perturbation and show that our perturbation provides guarantees against privacy breaches. We develop and analyze algorithms for reconstructing counts of subcubes over perturbed data. We also evaluate the tradeoff between privacy guarantees and reconstruction accuracy and show the practicality of our approach.
- N. R. Adam and J. C. Wortmann. Security control methods for statistical databases: A comparative study. In ACM Computing Surveys, Vol21, No 4, Dec. 1989.]] Google Scholar
Digital Library
- D. Agrawal and C. Aggarwal. On the design and quantification of privacy preserving datamining algorithms. In Proc. of the 2001 ACM Symp. on Principles of Database Systems.]] Google ScholarDigital Library
- R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data.]] Google ScholarDigital Library
- R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data.]] Google ScholarDigital Library
- C. Blake and C. Merz. UCI repository of machine learning databases, 1998.]]Google Scholar
- S. Chawla, C. Dwork, F. McSherry, H. Wee, and A. Smith. Towards privacy in public databases. In Theory of Cryptography Conference, 2005.]] Google ScholarDigital Library
- H. Chernoff. Asymptotic efficiency for tests based on the sums of observations. In Annals of Mathematical Statistics, 1952.]]Google Scholar
- C. Clifton, M. Kantarcioglu, X. Lin, J. Vaidya, and M. Zhu. Tools for privacy preserving distributed data mining. SIGKDD Explorations, 4(2):28--34, Jan. 2003.]] Google ScholarDigital Library
- A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proc. of the 2003 ACM Symp. on Principles of Database Systems.]] Google ScholarDigital Library
- A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proc. of the 2002 ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining.]] Google ScholarDigital Library
- J. D. Ferrer and V. Torra. Disclosure risk assesment in statistical microdata protection via advanced record linkage. In Statistics and Computing, pages 343--354, 2003.]] Google ScholarDigital Library
- M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Proc. Advances in Cryptology - EUROCRYPT 2004, 2004.]]Google ScholarCross Ref
- O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game -- a completeness theorem for protocols with a honest majority. In Proc. of the 1987 Annual ACM Symp. on Theory of Computing.]] Google ScholarDigital Library
- G. Golub and C. V. Loan. Matrix computations. John Hopkins Series in the Mathematical Sciences, 1996.]]Google Scholar
- K. Hoffman and R. Kunze. Linear algebra. Prentice-Hall Inc. 1971.]]Google Scholar
- B. A. Huberman, M. Franklin, and T. Hogg. Enhancing privacy and trust in electronic communities. In Proc. of the 1st ACM Conference on Electronic Commerce, 1999.]] Google ScholarDigital Library
- C. A. J. Hurkens and S. R. Tiourine. Model and methods for the microdata protection problem. In Journal of Official Statistics, 1998.]]Google Scholar
- C. K. Liew, U. J. Choi, and C. J. Liew. A data distortion by probability distribution. ACM Transactions on Database Systems, 10(3), 1985.]] Google ScholarDigital Library
- Y. Lindell and B. Pinkas. Privacy preserving data mining. In CRYPTO, 2000.]] Google ScholarDigital Library
- R. A. J. Moore. Controlled data-swapping techniques for masking public use microdata sets. In SRD Report RR 96-04, US Bereau of Census, 1996.]]Google Scholar
- S. Rizvi and J. R. Haritsa. Maintaining data privacy in association rule mining. In Proc. of the 2002 Intl. Conf. on Very Large Data Bases.]] Google ScholarDigital Library
- L. Wang, S. Jajodia, and D. Wijesekera. Securing OLAP data cubes against privacy breaches. In In Proc. of the 2004 IEEE Symposium on Security and Privacy.]]Google Scholar
- L. Wang, D. Wijesekera, and S. Jajodia. Cardinality-based inference control in data cubes. In Journal of Computer Security, 2004.]] Google ScholarDigital Library
- S. Warner. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Assoc., 60(309).]]Google Scholar
- A. Yao. How to generate and exchange secrets. In Proc. of the 1986 Annual IEEE Symp. on Foundations of Computer Science.]]Google Scholar
- Privacy preserving OLAP
Recommendations
Privacy-Preserving OLAP: An Information-Theoretic Approach
We address issues related to the protection of private information in Online Analytical Processing (OLAP) systems, where a major privacy concern is the adversarial inference of private information from OLAP query answers. Most previous work on privacy-...
Multi-level privacy preserving data publishing
Policedata is an important source of social media data and can be regarded as a technical assistance to increase government accountability and transparency. Notably, it contains large amounts of personal private information that should be preserved ...
Comments