Results 231 to 240 of about 9,107,365 (284)
Ethical dilemmas in narrative research: a review informed by Eastern wisdom traditions. [PDF]
Front Res Metr AnalK C R, Dahal N.
europepmc +1 more source
Mondrian Multidimensional K-Anonymity [PDF]
22nd International Conference on Data Engineering (ICDE'06), 2006 K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving 𝑘anonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (single-dimensional) approaches. Often this flexibility leads
Kristen LeFevre +2 more
openaire +2 more sources
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006 Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the association of individuals to sensitive information.
Raymond Chi-Wing Wong +3 more
openaire +2 more sources
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002 Consider a data holder, such as a hospital or a bank, that has a privately held collection of person-specific, field structured data. Suppose the data holder wants to share a version of the data with researchers. How can a data holder release a version of its private data with scientific guarantees that the individuals who are the subjects of the data
Latanya Sweeney (5402741)
openaire +3 more sources
Extended k-anonymity models against sensitive attribute disclosure
Computer Communications, 2011 p-Sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a set of quasi-identifier attributes ...
Hua Wang, Xiaoxun Sun
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
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
MULTIPLE RELEASES OF k-ANONYMOUS DATA SETS AND k-ANONYMOUS RELATIONAL DATABASES
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2012In data privacy, the evaluation of the disclosure risk has to take into account the fact that several releases of the same or similar information about a population are common. In this paper we discuss this issue within the scope of k-anonymity. We also show how this issue is related to the publication of privacy protected databases that consist of ...
Klara Stokes, Vicenç Torra
openaire +4 more sources