Sciweavers

62 search results - page 12 / 13
» Privacy Problems with Anonymized Transaction Databases
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
14 years 5 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
ICDE
2009
IEEE
392views Database» more  ICDE 2009»
15 years 5 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...
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
14 years 1 days ago
Maintaining K-Anonymity against Incremental Updates
K-anonymity is a simple yet practical mechanism to protect privacy against attacks of re-identifying individuals by joining multiple public data sources. All existing methods achi...
Jian Pei, Jian Xu, Zhibin Wang, Wei Wang 0009, Ke ...
CIKM
2006
Springer
13 years 9 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
IVIC
2009
Springer
14 years 10 days ago
Secure Minutiae-Based Fingerprint Templates Using Random Triangle Hashing
Abstract. Due to privacy concern on the widespread use of biometric authentication systems, biometric template protection has gained great attention in the biometric research recen...
Zhe Jin, Andrew Beng Jin Teoh, Thian Song Ong, Con...