Home           Contact us           FAQs           
 
   Journal Page   |   Aims & Scope   |   Author Guideline   |   Editorial Board   |   Search
    Abstract
2012 (Vol. 4, Issue: 22)
Article Information:

A Novel Anonymity Algorithm for Privacy Preserving in Publishing Multiple Sensitive Attributes

Jian Wang
Corresponding Author:  Jian Wang 

Key words:  Data publishing , k-anonymity, multiple sensitive attributes, privacy preserving, , ,
Vol. 4 , (22): 4923-4927
Submitted Accepted Published
June 13, 2012 July 18, 2012 November 15, 2012
Abstract:

Publishing the data with multiple sensitive attributes brings us greater challenge than publishing the data with single sensitive attribute in the area of privacy preserving. In this study, we propose a novel privacy preserving model based on k-anonymity called (α, β, k)-anonymity for databases. (α, β, k)- anonymity can be used to protect data with multiple sensitive attributes in data publishing. Then, we set a hierarchy sensitive attribute rule to achieve (α, β, k)-anonymity model and develop the corresponding algorithm to anonymize the micro data by using generalization and hierarchy. We also design experiments to show the application and performance of the proposed algorithm.
Abstract PDF HTML
  Cite this Reference:
Jian Wang, 2012. A Novel Anonymity Algorithm for Privacy Preserving in Publishing Multiple Sensitive Attributes.  Research Journal of Applied Sciences, Engineering and Technology, 4(22): 4923-4927.
    Advertise with us
 
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
   Contact Information
  Executive Managing Editor
  Email: admin@maxwellsci.com
  Publishing Editor
  Email: support@maxwellsci.com
  Account Manager
  Email: faisalm@maxwellsci.com
  Journal Editor
  Email: admin@maxwellsci.com
  Press Department
  Email: press@maxwellsci.com
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2009. MAXWELL Science Publication, a division of MAXWELLl Scientific Organization. All rights reserved