Results 151 to 160 of about 7,115,390 (197)
Some of the next articles are maybe not open access.
22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
k-Anonymity is a method for providing privacy protection by ensuring that data cannot be traced to an individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. To achieve optimal and practical k-anonymity, recently, many different kinds of algorithms with various assumptions and restrictions have been proposed with ...
Mehmet Ercan Nergiz, Chris Clifton
openaire +1 more source
k-Anonymity is a method for providing privacy protection by ensuring that data cannot be traced to an individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. To achieve optimal and practical k-anonymity, recently, many different kinds of algorithms with various assumptions and restrictions have been proposed with ...
Mehmet Ercan Nergiz, Chris Clifton
openaire +1 more source
2008 IEEE 24th International Conference on Data Engineering, 2008
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-anonymization: an adversary who knows the public data of an individual cannot link that individual to less than k records in the anonymized table. Every anonymized table that
Aristides Gionis +2 more
openaire +1 more source
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-anonymization: an adversary who knows the public data of an individual cannot link that individual to less than k records in the anonymized table. Every anonymized table that
Aristides Gionis +2 more
openaire +1 more source
Information Sciences, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng Zhong 0002 +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng Zhong 0002 +2 more
openaire +1 more source
Hardness of \(k\)-anonymous microaggregation
Discret. Appl. Math., 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Florian Thaeter, RĂ¼diger Reischuk
openaire +1 more source
On Distributed k-Anonymization
Fundamenta Informaticae, 2009When a database owner needs to disclose her data, she can k-anonymize her data to protect the involved individuals' privacy. However, if the data is distributed between two owners, then it is an open question whether the two owners can jointly k-anonymize the union of their data, such that the information suppressed in one owner's data is not revealed ...
openaire +3 more sources
K-Anonymity for Crowdsourcing Database
IEEE Transactions on Knowledge and Data Engineering, 2014In crowdsourcing database, human operators are embedded into the database engine and collaborate with other conventional database operators to process the queries. Each human operator publishes small HITs (Human Intelligent Task) to the crowdsourcing platform, which consist of a set of database records and corresponding questions for human workers. The
Sai Wu +4 more
openaire +1 more source
Differentially Private K-Anonymity
2014 12th International Conference on Frontiers of Information Technology, 2014Research in privacy preserving data publication can be broadly categorized in two classes. Syntactic privacy definitions have been under the cursor of the research community for the past many years. A lot of research is primarily dedicated to developing algorithms and notions for syntactic privacy that thwart the re-identification attacks.
Adeel Anjum, Adnan Anjum
openaire +1 more source
A Hybrid Method for k-Anonymization
2008 IEEE Asia-Pacific Services Computing Conference, 2008K-anonymity is a model to protect public released microdata from individual identification. It requires that each record is identical to at least k-1 other records in the anonymized dataset with respect to a set of privacy-related attributes. Although it is easy to anonymize the original dataset to satisfy the requirement of k-anonymity, it is ...
Jun-Lin Lin +3 more
openaire +1 more source
On the complexity of optimal K-anonymity
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2004The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to ...
Adam Meyerson, Ryan Williams 0001
openaire +1 more source
A Personalized (a,k)-Anonymity Model
2008 The Ninth International Conference on Web-Age Information Management, 2008One important privacy principle is that an individual has the freedom to decide his/her own privacy preferences, which should be taken into account when data holders release their privacy preserving micro data. Nevertheless, current related k-anonymity model research focuses on protecting individual private information by using pre-defined constraint ...
Xiaojun Ye, Yawei Zhang, Ming Liu
openaire +1 more source

