Sciweavers

15 search results - page 1 / 3
» Anonymizing data with quasi-sensitive attribute values
Sort
View
CIKM
2010
Springer
13 years 2 months ago
Anonymizing data with quasi-sensitive attribute values
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...
Pu Shi, Li Xiong, Benjamin C. M. Fung
CCS
2008
ACM
13 years 6 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
ICDE
2009
IEEE
392views Database» more  ICDE 2009»
15 years 4 months ago
FF-Anonymity: When Quasi-Identifiers Are Missing
Existing approaches on privacy-preserving data publishing rely on the assumption that data can be divided into quasi-identifier attributes (QI) and sensitive attribute (SA). This ...
Ada Wai-Chee Fu, Ke Wang, Raymond Chi-Wing Wong, Y...
ICDE
2007
IEEE
1577views Database» more  ICDE 2007»
15 years 4 months ago
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to...
Ninghui Li, Tiancheng Li, Suresh Venkatasubramania...
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
14 years 5 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...