Results 61 to 70 of about 12,445,360 (313)
k-anonymous Microdata Release via Post Randomisation Method
, 2015 The problem of the release of anonymized microdata is an important topic in the fields of statistical disclosure control (SDC) and privacy preserving data publishing (PPDP), and yet it remains sufficiently unsolved.
Chida, Koji +3 more
core +1 more source
Clustering with diversity [PDF]
, 2010 We consider the {\em clustering with diversity} problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least $\ell$ points, all of which have distinct colors.
Li, Jian, Yi, Ke, Zhang, Qin
core +2 more sources
Achieving Personalized $k$-Anonymity-Based Content Privacy for Autonomous Vehicles in CPS
IEEE Transactions on Industrial Informatics, 2020 Enabled by the industrial Internet, intelligent transportation has made remarkable achievements such as autonomous vehicles by carnegie mellon university (CMU) Navlab, Google Cars, Tesla, etc.
Jinbao Wang, Zhipeng Cai, Jiguo Yu
semanticscholar +1 more source
Parameterized Complexity of the k-anonymity Problem
, 2010 The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity.
A Gionis +21 more
core +1 more source
ABAKA : a novel attribute-based k-anonymous collaborative solution for LBSs [PDF]
, 2016 The increasing use of mobile devices, along with advances in telecommunication systems, increased the popularity of Location-Based Services (LBSs). In LBSs, users share their exact location with a potentially untrusted Location-Based Service Provider ...
Ambrosin, M +3 more
core +2 more sources
Privacy-Preserving of Check-in Services in MSNS Based on a Bit Matrix
Cybernetics and Information Technologies, 2015 Check-in service, being one of the most popular services in Mobile Social Network Services (MSNS), has serious personal privacy leakage threats. In this paper check-in sequences of pseudonym users were buffered, and a bit matrix for buffered check-in ...
Wen Chen
doaj +1 more source
Resolving the Complexity of Some Data Privacy Problems
, 2010 We formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l-diversity. We settle several open problems concerning the difficulty of applying these methods optimally, proving both positive
Blocki, Jeremiah, Williams, Ryan
core +1 more source
Preventing Location-Based Identity Inference in Anonymous Spatial Queries [PDF]
, 2007 The increasing trend of embedding positioning capabilities (for example, GPS) in mobile devices facilitates the widespread use of Location-Based Services. For such applications to succeed, privacy and confidentiality are essential.
GHINITA, Gabriel +3 more
core +2 more sources
On the Complexity of Optimal k-Anonymity: A New Proof Based on Graph Coloring
IEEE AccessPrivacy is a complex balancing problem between risks and utility of data. K-anonymity, a fundamental model for preserving privacy, guarantees that an item cannot be differentiated from at least k-1 other items.
Yavuz Canbay
doaj +1 more source
On the Complexity of $t$-Closeness Anonymization and Related Problems
, 2013 An important issue in releasing individual data is to protect the sensitive information from being leaked and maliciously utilized. Famous privacy preserving principles that aim to ensure both data privacy and data integrity, such as $k$-anonymity and $l$
D. Rebollo-Monedero +10 more
core +1 more source