IDEAS home Printed from https://ideas.repec.org/a/igg/jitwe0/v14y2019i2p27-40.html
   My bibliography  Save this article

Scalable l-Diversity: An Extension to Scalable k-Anonymity for Privacy Preserving Big Data Publishing

Author

Listed:
  • Udai Pratap Rao

    (Computer Engineering Department, Sardar Vallabhbhai National Institute of Technology, Surat, India)

  • Brijesh B. Mehta

    (Computer Engineering Department, Sardar Vallabhbhai National Institute of Technology, Surat, India)

  • Nikhil Kumar

    (Computer Engineering Department, Sardar Vallabhbhai National Institute of Technology, Surat, India)

Abstract

Privacy preserving data publishing is one of the most demanding research areas in the recent few years. There are more than billions of devices capable to collect the data from various sources. To preserve the privacy while publishing data, algorithms for equivalence class generation and scalable anonymization with k-anonymity and l-diversity using MapReduce programming paradigm are proposed in this article. Equivalence class generation algorithms divide the datasets into equivalence classes for Scalable k-Anonymity (SKA) and Scalable l-Diversity (SLD) separately. These equivalence classes are finally fed to the anonymization algorithm that calculates the Gross Cost Penalty (GCP) for the complete dataset. The value of GCP gives information loss in input dataset after anonymization.

Suggested Citation

  • Udai Pratap Rao & Brijesh B. Mehta & Nikhil Kumar, 2019. "Scalable l-Diversity: An Extension to Scalable k-Anonymity for Privacy Preserving Big Data Publishing," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 14(2), pages 27-40, April.
  • Handle: RePEc:igg:jitwe0:v:14:y:2019:i:2:p:27-40
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITWE.2019040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jitwe0:v:14:y:2019:i:2:p:27-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.