Volume 1 Number 2 (Jul. 2012)
Home > Archive > 2012 > Volume 1 Number 2 (Jul. 2012) >
IJCCE 2012 Vol.1(2): 155-158 ISSN: 2010-3743
DOI: 10.7763/IJCCE.2012.V1.41

Protecting Privacy Using K-Anonymity with a Hybrid Search Scheme

Cui Run, Hyoung Joong Kim, Dal-Ho Lee, Cheong Ghil Kim, and Kuinam J. Kim

Abstract—In this paper, a new search algorithm to achieve k-anonymity for protecting privacy is introduced. For this purpose, two algorithms, Tabu Search and Genetic Algorithm, are combined. The simulation results show that the proposed algorithm is superior to the individual search algorithm in average.

Index Terms—K-anonymity, database, privacy protection, heuristic algorithm.

Cui Run is with Korea University, Seoul, Korea (e-mail:tetons915@gmail.com).
Hyoung Joong Kim is with Gachon University, Sungnam, Kyeonggido, Korea
Cheong Ghil Kim is with Namseoul University, Cheonan, Choongnam, Korea
Kuinam J. Kim is with Kyonggi University, Suwon, Kyeonggido, Korea

Cite: Cui Run, Hyoung Joong Kim, Dal-Ho Lee, Cheong Ghil Kim, and Kuinam J. Kim, "Protecting Privacy Using K-Anonymity with a Hybrid Search Scheme," International Journal of Computer and Communication Engineering vol. 1, no. 2, pp. 155-158 , 2012.

General Information

ISSN: 2010-3743 (Online)
Abbreviated Title: Int. J. Comput. Commun. Eng.
Frequency: Quarterly
Editor-in-Chief: Dr. Maode Ma
Abstracting/ Indexing: INSPEC, CNKI, Google Scholar, Crossref, EBSCO, ProQuest, and Electronic Journals Library
E-mail: ijcce@iap.org
  • Dec 29, 2021 News!

    IJCCE Vol. 10, No. 1 - Vol. 10, No. 2 have been indexed by Inspec, created by the Institution of Engineering and Tech.!   [Click]

  • Mar 17, 2022 News!

    IJCCE Vol.11, No.2 is published with online version!   [Click]

  • Dec 29, 2021 News!

    The dois of published papers in Vol. 9, No. 3 - Vol. 10, No. 4 have been validated by Crossref.

  • Dec 29, 2021 News!

    IJCCE Vol.11, No.1 is published with online version!   [Click]

  • Sep 16, 2021 News!

    IJCCE Vol.10, No.4 is published with online version!   [Click]

  • Read more>>