Abstract
So far, the data anonymization approaches based on k-anonymity and l-diversity has contributed much to privacy protection from record and attributes linkage attacks. However, the existing solutions are not efficient when applied to multimedia Big Data anonymization. This paper analyzes this problem in detail in terms of the processing time, memory space, and usability, and presents two schemes to overcome such inefficiency. The first one is to reduce the processing time and space by minimizing the temporary buffer usage during anonymization process. The second is to construct an early taxonomy during the database design. The idea behind this approach is that database designers should take preliminary actions for anonymization during the early stage of a database design to alleviate the burden placed on data publishers. To evaluate the effectiveness and feasibility of these schemes, specific application tools based on the proposed approaches were implemented and experiments were conducted.
Similar content being viewed by others
References
Bayardo RJ, Agrawal R (2005) Data privacy through optimal k-anonymization. IEEE ICDE, pp 217–228
Fung BCM, Wang K (2006) Anonymizing sequential releases. ACM SIGKDD, New York, USA
Fung BCM, Wang K, Chen R, Yu PS (2007) Anonymizing classification data for privacy preservation. IEEE TKDE 19(5):711–725
Fung BCM, Wang K, Chen R, Yu PS (2007) Handicapping attacker’s confidence: an alternative to k-anonymization. Knowl Inf Syst 11(3):345–368
Fung BCM, Wang K, Chen R, Yu PS (2010) Privacy-preserving data publishing: a survey of recent developments. CSUR 42(4):14:1–14:53
Iyengar VS (2002) Transforming data to satisfy privacy constraints. ACM SIGKDD, New York, pp 279–288
Jang S-B (2014) Design of a software tool for privacy-preserving data publishing. SERSC ASTL 65(14):57–60
Lefevre K, Dewitt DJ, Ramakrishnan R (2005) Incognito: efficient full-domain k-anonymity. ACM SIGMOD. ACM, New York, pp 49–60
Li N, Li T (2007) VENKATASUBRAMANIAN S. 2007. t-closeness: privacy beyond k-anonymity and l-diversity. IEEE ICDE
Li J, Tao Y, Xiao X (2008) Preservation of proximity privacy in publishing numerical sensitive data. ACM SIGMOD, pp 437–486
Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) l-diversity: privacy beyond k-anonimity. ACM TKDD 1(1):1–52
Motani R, Xu Y (2007) Efficient algorithms for masking and finding quasi-identifiers. VLDB 2007, Vienna, Austria
Nergiz ME, Clifton C, Nergiz AE (2009) Multirelational k-anonymity. IEEE TKDE 21(8):1104–1117
Ridzon R, Levický D (2009) Multimedia security and multimedia content protection. 51st Intl. Symp. ELMAR. Zadar, Croatia, pp 105–108
Samarati P (2001) Protecting respondents’ identities in microdata release. IEEE TKDE 13(6):1010–1027
Samarati P, Sweeney L (1998) Protecting privacy when disclosing information:k-anonymity and its enforcement through generalization and suppression. IEEE SRS P
Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information. ACM SIGACT-SIGMOD-SIGART PODS, New York, pp 188
Sergey V, Alexander P (2012) Evaluation of data anonymization tools. The Fourth Intl. Conf. on DBKDA, pp 163–168
Susanto H, Muhaya FB (2010) Multimedia information security architecture framework. 2010 I.E. 5th Intl. Conf. on FutureTech, pp 1–6
Sweeney L (2002) k-Anonymity: a model for protecting privacy. IFUFKBS 10(5):557–570
Thuraisingham B (2007) Security and privacy for multimedia database management systems. Multimed Tools Appl 33:13–29
Truta TM, Bindu V (2006) Privacy protection: p-sensitive k-anonymity property. IWPDM
Wang Y, Xie L, Zheng B, Lee KCK (2013) High utility k-anonymization for social network publishing. Knowl Inf Syst 36(1):1–29
Wernke M, Skvortsov P, Dürr F, Rothermel K (2014) A classification of location privacy attacks and approaches. Pers Ubiquit Comput 18(1):163–175
Wong RCW, Li J, Fu AWC, Andwang K (2006) (α,k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. ACM SIGKDD, New York, USA, pp 754–759
Xiao X, Tao Y (2006) Personalized privacy preservation. 2006 ACM SIGMOD, New York, USA, pp 229–240
Xu L, Chunxiao J, Wang J, Yuan J, Ren Y (2014) Information security in big data: privacy and data mining. IEEE Access 2(1):1149–1176
Zhang Q, Koudas N, Srivastava D, Yu T (2007) Aggregate query answering on anonymized tables. IEEE ICDE
Acknowledgments
This paper was supported by Research Fund, Kumoh National Institute of Technology. And this research was also supported by Basic Science Research Program through the NRF funded by the MEST (2014R1A2A1A11054160).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jang, SB., Ko, YW. Efficient multimedia big data anonymization. Multimed Tools Appl 76, 17855–17872 (2017). https://doi.org/10.1007/s11042-015-3123-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-015-3123-2