LBS based framework to obstruct linking attack in data releases

  • Debasis MohapatraEmail author
  • Manas Ranjan Patra


Big data repository is a myriad collection of data that needs enormous processing for data analysis to extract interesting patterns. It involves third party to do the data analysis that endangers the privacy of the data. Hence, along with efficient real time analysis of data, privacy of the data also needs a careful attention. In this paper, we discuss the problem of linking attack in the data releases. We show the attack due to the linking of social media data with relational sensitive database discloses the sensitive information about a social entity. Though the data releases don’t contain Identifiers (IDs) information like Name, Social Security Number (SSN), etc., linking attack is still possible through the combination of background knowledge with Quasi-Identifiers (QIDs) information like age, sex, etc. The solution encourages the release of anonymized relational sensitive database that obstruct the linking with other databases like social media data. Anonymization is a way to transform the original data to an anonymized version, such that the linkage between the sensitive information of an entity is dissociated from his/her identity. Most of the anonymity models are based on the concept of k-anonymity and l-diversity. In this paper, we present an extensive study on Greedy based heuristics. We propose Local Beam Search (LBS) based global generalization approach to achieve k-anonymity with l-diversity. The experimental evaluation confirms that the proposed method outperforms the existing Greedy based heuristics. The proposed method guarantees a faster convergence than existing Greedy based heuristics. Also, the proposed method performs better than the existing (t, k) Hypergraph Anonymization.


Data privacy Anonymization Local beam search Privacy Utility 



  1. 1.
    Asayesh A, Hadali A, Jalili R (2015) (t, k)- Hypergraph anonymization: an approach for secure data publishing. Security Comm Networks 8:1306–1317CrossRefGoogle Scholar
  2. 2.
    Babu KS, Reddy N, Kumar N, Elliot M, Jena SK (2013) Achieving k-anonymity using Improved Greedy Heuristics for Very Large Relational Databases. Transactions on data privacy 6:1–17MathSciNetGoogle Scholar
  3. 3.
    Casas-Roma J, Herrera-Joancomarti J, Torra V (2017) k-Degree anonymity and edge selection: improving data utility in large networks. KnowlInfSyst 50:447–474Google Scholar
  4. 4.
    El EK, Dankar FK, Issa R, Jonker E, Amyot D, Cogo E, Corriveau JP, Walker M, Chowdhury S, Vaillancourt R et al (2009) A globally optimal k-anonymity method for the de-identification of health data. J Am Med Inform Assoc 16(5):670–682CrossRefGoogle Scholar
  5. 5.
    Fung BC, Wang K, AW-C F, Philip SY (2010) Introduction to Privacy-preserving Data Publishing: Concepts and Techniques. CRC Press, Boca RatonCrossRefGoogle Scholar
  6. 6.
    Goldberg J, Tassa T (2010) Efficient Anonymization with Enhanced Utility. Transactions on data privacy 3:149–175MathSciNetGoogle Scholar
  7. 7.
    Jang S, Ko Y (2017) Efficient multimedia big data anonymization. Multimed Tools Appl 76(17):17855–17872CrossRefGoogle Scholar
  8. 8.
    Lee H, Kim S, Kim JW, Chung YD (2017) Utility-preserving anonymization for health data publishing. BMC Medical Informatics and Decision Making 17:104CrossRefGoogle Scholar
  9. 9.
    LeFevre K, DeWitt D, Ramakrishnan R (2005) Incognito: Efficient full domain k-anonymity. International Conference of the ACM Special Interest Group on Management of DataGoogle Scholar
  10. 10.
    LeFevre K, DeWitt DJ, Ramakrishnan R (2006) Mondrian multidimensional k-anonymity. In: Data Engineering, 2006. ICDE’06. Proceedings of the 22nd International Conference On. Atlanta: IEEE, pp. 25–5Google Scholar
  11. 11.
    Li N, Li T, Venkatasubramanian S (2007) t-closeness: Privacy beyond k-anonymity and l-diversity. In: Proceedings of the 21st International Conference on Data Engineering. Istanbul: IEEE Computer Society, 106–15Google Scholar
  12. 12.
    Li T, Li N, Zhang J, Molloy I (2012) Slicing: A New Approach to Privacy Preserving Data Publishing. IEEE TKDE 24(3):561–574Google Scholar
  13. 13.
    Li H, Wang K, Liu X, Sun Y (2017) A Selective Privacy-Preserving Approach for Multimedia Data. IEEE Multimedia 24(4):14–25CrossRefGoogle Scholar
  14. 14.
    Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) l-diversity: Privacy beyond k-anonymity. ACM Trans KnowlDiscov Data (TKDD) 1(1):3CrossRefGoogle Scholar
  15. 15.
    Murakami K, Uno T (2017) Optimization algorithm for k-anonymization of datasets with low information loss. Int J Inf SecurGoogle Scholar
  16. 16.
    Stuart Russell, Peter Norvig (2008) Artificial Intelligence A Modern Approach, 2ndEd., PHI, 115-116Google Scholar
  17. 17.
    Samarati P (2001) Protecting respondents’ identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010–1027CrossRefGoogle Scholar
  18. 18.
    Sweeney L (1997) Computational Disclosure Control for Medical Microdata: The Datafly System. Record Linkage Techniques, National Academy Press, Washington, DCGoogle Scholar
  19. 19.
    Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertainty, Fuzziness and Knowl-Based Syst 10(5):571–588MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Sweeney L (2002) k-anonymity: A model for protecting privacy. Int J Uncertain Fuzziness Knowledge-Based Syst 10(05):557–570MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Thuraisingham B (2007) Security and privacy for multimedia database management systems. Multimed Tools Appl 33:13–29CrossRefGoogle Scholar
  22. 22.
    Wong R, Li J, Fu A, Wang K (2006) (Alpa, k)-anonymity: An enhanced k-anonymity model for privacy-preserving data publishing. ACM SIGKDD International Conference on Knowledge Discovery and Data MiningGoogle Scholar
  23. 23.
    Wong WK, Mamoulis N, Cheung David W (2010) Non-homogeneous Generalization in Privacy Preserving Data Publishing. SIGMOD:747–758Google Scholar
  24. 24.
    Xiao X, Tao Y (2006) Anatomy: Simple and effective privacy preservation. In: Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment, Seoul, pp. 139–50Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Parala Maharaja Engineering CollegeBrahmapurIndia
  2. 2.Berhampur UniversityBrahmapurIndia

Personalised recommendations