You are on page 1of 7

Closeness: A New Privacy Measure for Data Publishing

Ninghui Li, Member, IEEE, Tiancheng Li, and Suresh Venkatasubramanian

Abstract 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 certain identifying attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of -diversity has been proposed to address this; -diversity requires that each equivalence class has at least wellrepresented (in Section 2) values for each sensitive attribute. In this paper, we show that diversity has a number of limitations. In particular, it is neither necessary nor sufficient to

prevent attribute disclosure. Motivated by these limitations, we propose a new notion of


privacy called closeness. We first present the base model tcloseness, which requires that the distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold t). We then propose a more flexible privacy model called n; t-closeness that offers higher utility. We describe our desiderata for designing a distance measure between two probability distributions and present two distance measures. We discuss the rationale for using

closeness as a privacy measure and illustrate its advantages through examples and experiments.

PLATFORM AREA
FRONT END TOOL BACK END TOOL REPORT AREA VERSION NUMBER VERSION NAME CHART AND GRAPH

TOOLS USED
VISUAL STUDIO DOT NET 2008 SQL SERVER 2005 CRYSTAL REPORT 2008 3.5 ORCAS VERSION DUNDAS CHART PROFESSIONAL EDITION

User /administrator

Stem Cell Management

Stem Database

Birth Registration Details & Unique ID preparation

Access Global Information of all Unique ID

Smart Code Generator In accessing Unique ID data from Remote place

SMART CODE GENERATOR: ALGORITHM STEP 1 : Create a database and create a table named as autocode (user-defined). STEP 2 : In that table, Create two fields named as auto_code and auto_value. STEP 3 : Generate Auto code Value Ranges from [ 0 to 9] and for each auto code value corresponding special characters will be fixed [`~!@#$%^&*()_] STEP 4 : Initialize Integer s1,s2,s3,i1,i2,i3,i4,i5,i6 as Integer. STEP 5 : Assign Current system seconds to s1 which holds two digit integer character where i1 = s1/10 and i2 = s1 Mod 10. STEP 6 : Assign Current system Minute to s2 which holds two digit integer character where i3 = s2/10 and i4 = s2 Mod 10. STEP 7 : Assign Current system milliseconds to s3 which holds two digit integer character where i5 = s3/10 and i6 = s3 Mod 10. STEP 8 : Concatenate i1, i2,i3,i4,i5,i6 and send this secret code to recipient.