Abstract
Abstract
This paper explores the challenges raised by big data in privacy-preserving data management. First, we examine the conflicts raised by big data with respect to preexisting concepts of private data management, such as consent, purpose limitation, transparency and individual rights of access, rectification and erasure. Anonymization appears as the best tool to mitigate such conflicts, and it is best implemented by adhering to a privacy model with precise privacy guarantees. For this reason, we evaluate how well the two main privacy models used in anonymization (k-anonymity and
$$\varepsilon $$
ε
-differential privacy) meet the requirements of big data, namely composability, low computational cost and linkability.
Funder
Ministerio de Economía y Competitividad
Generalitat de Catalunya
European Commission
Institució Catalana de Recerca i Estudis Avançats
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference32 articles.
1. Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Eiter T, Libkin L (eds) Database theory—ICDT 2005, vol 3363., Lecture Notes in Computer Science. Springer, Berlin, p 246–258
2. Barbaro M, Zeller T (2006) A face is exposed for AOL searcher no. 4417749. New York Times, August 14
3. Brookman J, Hans GS (2013) Why collection matters: surveillance as a de facto privacy harm. In: Big data and privacy: making ends meet. The center for internet and society - Stanford Law School
4. Chen A (2010) Gcreep: google engineer stalked teens, spied on chats. Gawker, New York
5. Cormode G, Procopiuc C, Srivastava D, Shen E, Yu T (2012) Differentially private spatial decompositions. In: Proceedings of the 2012 IEEE 28th international conference on data engineering. ICDE’12, Washington, DC, USA. IEEE Computer Society, p 20–31
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献