Results 41 to 50 of about 52,169 (277)
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
Publishing Microdata with a Robust Privacy Guarantee [PDF]
, 2012 Today, the publication of microdata poses a privacy threat. Vast research has striven to define the privacy condition that microdata should satisfy before it is released, and devise algorithms to anonymize the data so as to achieve this condition.
Cao, Jianneng, Karras, Panagiotis
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
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
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
Time Distortion Anonymization for the Publication of Mobility Data with High Utility [PDF]
, 2015 An increasing amount of mobility data is being collected every day by different means, such as mobile applications or crowd-sensing campaigns. This data is sometimes published after the application of simple anonymization techniques (e.g., putting an ...
Brunie, Lionel +3 more
core +3 more sources
Distinguishable de-identified faces [PDF]
, 2015 The k-anonymity approach adopted by k-Same face de-identification methods enables these methods to serve their purpose of privacy protection. However, it also forces every k original faces to share the same de-identified face, making it impossible to ...
Ariyaeeinia, A., Meng, Li, Sun, Zongji
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee +9 more
wiley +1 more source
Molecular Oncology, EarlyView.A urine‐based digital PCR assay targeting two hotspot TERT promoter variants detected bladder cancer with high sensitivity and no false positives in this case–control cohort. The streamlined AbsoluteQ workflow outperformed Sanger sequencing and supports non‐invasive molecular testing for bladder cancer detection.
Anna Nykel +12 more
wiley +1 more source
The k-Anonymity Problem Is Hard [PDF]
, 2009 21 pages, A short version of this paper has been accepted in FCT 2009 - 17th International Symposium on Fundamentals of Computation ...
Bonizzoni, P, Della Vedova, G, Dondi, R
openaire +3 more sources