Results 1  10
of
28,039
The kanonymity problem is hard
 In FCT
, 2009
"... The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the kanonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that all the rows in a cluster become ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the kanonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that all the rows in a cluster become
Data privacy through optimal kanonymization
 In ICDE
, 2005
"... Data deidentification reconciles the demand for release of data for research purposes and the demand for privacy from individuals. This paper proposes and evaluates an optimization algorithm for the powerful deidentification procedure known as kanonymization. A kanonymized dataset has the proper ..."
Abstract

Cited by 344 (3 self)
 Add to MetaCart
the property that each record is indistinguishable from at least k – 1 others. Even simple restrictions of optimized kanonymity are NPhard, leading to significant computational challenges. We present a new approach to exploring the space of possible anonymizations that tames the combinatorics of the problem
ℓdiversity: Privacy beyond kanonymity
 IN ICDE
, 2006
"... Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kanonymity has gained popularity. In a kanonymized dataset, each record is indistinguishable from at least k − 1 other records with resp ..."
Abstract

Cited by 672 (13 self)
 Add to MetaCart
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kanonymity has gained popularity. In a kanonymized dataset, each record is indistinguishable from at least k − 1 other records
Approximation Algorithms for kAnonymity
 JOURNAL OF PRIVACY TECHNOLOGY
, 2005
"... We consider the problem of releasing a table containing personal records, while ensuring individual privacy and maintaining data integrity to the extent possible. One of the techniques proposed in the literature is kanonymization. A release is considered kanonymous if the information corresponding ..."
Abstract

Cited by 62 (5 self)
 Add to MetaCart
to the Age range 2025). The goal is to lose as little information as possible while ensuring that the release is kanonymous. This optimization problem is referred to as the kAnonymity problem. We show that the kAnonymity problem is NPhard even when the attribute values are ternary and we are allowed
Mondrian multidimensional kanonymity
 in Proc. 22nd ICDE. IEEE
"... KAnonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding “models ” have been considered for achieving kanonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (sing ..."
Abstract

Cited by 255 (5 self)
 Add to MetaCart
(singledimensional) approaches. Often this flexibility leads to higherquality anonymizations, as measured both by generalpurpose metrics, as well as more specific notions of query answerability. In this paper, we prove that optimal multidimensional anonymization is NPhard (like previous kanonymity
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 683 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
in the proof (though this number is a very slowly growing function of the input length). As a consequence we prove that no MAX SNPhard problem has a polynomial time approximation scheme, unless NP=P. The class MAX SNP was defined by Papadimitriou and Yannakakis [82] and hard problems for this class include
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 730 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Kanonymous Signaling Scheme
, 2013
"... We incorporate signaling scheme into Ad Auction setting, to achieve better welfare and revenue while protect users ’ privacy. We propose a new Kanonymous signaling scheme setting, prove the hardness of the corresponding welfare/revenue maximization problem, and finally propose the algorithms to app ..."
Abstract
 Add to MetaCart
We incorporate signaling scheme into Ad Auction setting, to achieve better welfare and revenue while protect users ’ privacy. We propose a new Kanonymous signaling scheme setting, prove the hardness of the corresponding welfare/revenue maximization problem, and finally propose the algorithms
On the complexity of restricted kanonymity problem
 The 10th Asia Pacific Web Conference (APWEB2008), LNCS 4976, pp: 287296
"... Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. kanonymity provides a simple and efficient approach to protect private individual information and is gaining increasing popularity. kanonymity requires that every tuple(record) in th ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
ple(record) in the microdata table released be indistinguishably related to no fewer than k respondents. In this paper, we introduce two new variants of the kanonymity problem, namely, the Restricted kanonymity problem and Restricted kanonymity problem on attribute (where suppressing the entire attribute is allowed). We
Results 1  10
of
28,039