Models and Algorithms for Private Data Sharing

作者: Noman Mohammed

DOI:

关键词:

摘要: In recent years, there has been a tremendous growth in the collection of digital information about individuals. Many organizations such as governmental agencies, hospitals, and financial companies collect disseminate various person-specific data. Due to rapid advance storing, processing, networking capabilities computing devices, collected data can now be easily analyzed infer valuable for research business purposes. Data from different sources integrated further gain better insights. On one hand, offer opportunities mining useful information. other process poses threat individual privacy since these often contain sensitive this thesis, we address problem developing anonymization algorithms thwart potential attacks real-life sharing scenarios. particular, study two models: LKC-privacy differential privacy. For each models, develop anonymizing types relational data, trajectory heterogeneous We also distributed where multiple publishers cooperate integrate their private without violating given privacy requirements. Experimental results on demonstrate that proposed effectively retain essential analysis are scalable large sets.

参考文章(118)
Dino Pedreschi, Anna Monreale, Ruggero G. Pensa, Fabio Pinelli, Pattern-Preserving k-Anonymization of Sequences and its Application to Mobility Data Mining 1st International Workshop on Privacy in Location-Based Applications (PiLBA), Malaga, Spain, October 9, 2008. ,vol. 397, pp. 44- 60 ,(2008)
Oded Goldreich, , Silvio Micali, Avi Wigderson, , , How to play any mental game, or a completeness theorem for protocols with honest majority Providing Sound Foundations for Cryptography. pp. 307- 328 ,(2019) , 10.1145/3335741.3335755
Dima Alhadidi, Noman Mohammed, Benjamin CM Fung, Mourad Debbabi, None, Secure distributed framework for achieving ε-differential privacy privacy enhancing technologies. pp. 120- 139 ,(2012) , 10.1007/978-3-642-31680-7_7
Rina Panigrahy, Rajeev Motwani, Krishnaram Kenthapadi, Dilys Thomas, Tomas Feder, Gagan Aggarwal, An Zhu, Approximation Algorithms for k-Anonymity Journal of Privacy Technology. ,(2005)
Oded Goldreich, Foundations of Cryptography: Volume 1 Cambridge University Press. ,(2006)
Ke Wang, P.S. Yu, S. Chakraborty, Bottom-up generalization: a data mining solution to privacy protection international conference on data mining. pp. 249- 256 ,(2004) , 10.1109/ICDM.2004.10110
Steven L. Salzberg, Alberto Segre, Programs for Machine Learning ,(1994)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Oded Goldreich, Foundations of Cryptography Cambridge University Press. ,(2001) , 10.1017/CBO9780511546891
Eugene H. Spafford, Mikhail J. Atallah, Wenliang Du, A study of several specific secure two-party computation problems Purdue University. ,(2001)