Personalized privacy in open data sharing scenarios

被引:19
作者
Sanchez, David [1 ]
Viejo, Alexandre [1 ]
机构
[1] Univ Rovira & Virgili, Dept Comp Engn & Math, Tarragona, Spain
基金
欧盟地平线“2020”;
关键词
Privacy; Data sharing; Data brokers; Personalized data protection; REDACTION;
D O I
10.1108/OIR-01-2016-0011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Purpose - The purpose of this paper is to propose a privacy-preserving paradigm for open data sharing based on the following foundations: subjects have unique privacy requirements; personal data are usually published incrementally in different sources; and privacy has a time-dependent element. Design/methodology/approach - This study first discusses the privacy threats related to open data sharing. Next, these threats are tackled by proposing a new privacy-preserving paradigm. The main challenges related to the enforcement of the paradigm are discussed, and some suitable solutions are identified. Findings - Classic privacy-preserving mechanisms are ineffective against observers constantly monitoring and aggregating pieces of personal data released through the internet. Moreover, these methods do not consider individual privacy needs. Research limitations/implications - This study characterizes the challenges to the tackled by a new paradigm and identifies some promising works, but further research proposing specific technical solutions is suggested. Practical implications - This work provides a natural solution to dynamic and heterogeneous open data sharing scenarios that require user-controlled personalized privacy protection. Social implications - There is an increasing social understanding of the privacy threats that the uncontrolled collection and exploitation of personal data may produce. The new paradigm allows subjects to be aware of the risks inherent to their data and to control their release. Originality/value - Contrary to classic data protection mechanisms, the new proposal centers privacy protection on the individuals, and considers the privacy risks through the whole life cycle of the data release.
引用
收藏
页码:298 / 310
页数:13
相关论文
共 27 条
[1]  
Anandan B., 2011, IEEE WIC ACM INT JOI
[2]  
[Anonymous], 2008, P 14 ACM SIGKDD INT
[3]  
[Anonymous], 2015, Data Science and Engineering
[4]  
[Anonymous], 1998, PROTECTING PRIVACY D
[5]   The Rules of Redaction Identify, Protect, Review (and Repeat) [J].
Bier, Eric ;
Chow, Richard ;
Golle, Philippe ;
King, Tracy Holloway ;
Staddon, Jessica .
IEEE SECURITY & PRIVACY, 2009, 7 (06) :46-53
[6]   Privacy-preserving incremental data dissemination [J].
Byun, Ji-Won ;
Li, Tiancheng ;
Bertino, Elisa ;
Li, Ninghui ;
Sohn, Yonglak .
JOURNAL OF COMPUTER SECURITY, 2009, 17 (01) :43-68
[7]   CASTLE: Continuously Anonymizing Data Streams [J].
Cao, Jianneng ;
Carminati, Barbara ;
Ferrari, Elena ;
Tan, Kian-Lee .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (03) :337-352
[8]   The Google similarity distance [J].
Cilibrasi, Rudi L. ;
Vitanyi, Paul M. B. .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) :370-383
[9]  
Domingo-Ferrer J, 2004, ANN NY ACAD SCI, V3050, P149
[10]  
Domingo-Ferrer Josep., 2016, SYNTHESIS LECT INFOR, DOI [10.1007/978-3-031-02347-7, DOI 10.1007/978-3-031-02347-7]