{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:09:41Z","timestamp":1774368581955,"version":"3.50.1"},"reference-count":47,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T00:00:00Z","timestamp":1584835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61741216, 61402367"],"award-info":[{"award-number":["61741216, 61402367"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Science and Technology Co-ordination and Innovation Project","award":["2016KTTSGY01-03"],"award-info":[{"award-number":["2016KTTSGY01-03"]}]},{"name":"Special Scientific Research Project of Education Department of Shaanxi Province","award":["17JK0704"],"award-info":[{"award-number":["17JK0704"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Privacy preserving data publishing has received considerable attention for publishing useful information while preserving data privacy. The existing privacy preserving data publishing methods for multiple sensitive attributes do not consider the situation that different values of a sensitive attribute may have different sensitivity requirements. To solve this problem, we defined three security levels for different sensitive attribute values that have different sensitivity requirements, and given an      L  s l      -diversity model for multiple sensitive attributes. Following this, we proposed three specific greed algorithms based on the maximal-bucket first (MBF), maximal single-dimension-capacity first (MSDCF) and maximal multi-dimension-capacity first (MMDCF) algorithms and the maximal security-level first (MSLF) greed policy, named as MBF based on MSLF (MBF-MSLF), MSDCF based on MSLF (MSDCF-MSLF) and MMDCF based on MSLF (MMDCF-MSLF), to implement the      L  s l      -diversity model for multiple sensitive attributes. The experimental results show that the three algorithms can greatly reduce the information loss of the published microdata, but their runtime is only a small increase, and their information loss tends to be stable with the increasing of data volume. And they can solve the problem that the information loss of MBF, MSDCF and MMDCF increases greatly with the increasing of sensitive attribute number.<\/jats:p>","DOI":"10.3390\/info11030166","type":"journal-article","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T04:03:01Z","timestamp":1584936181000},"page":"166","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Privacy Preserving Data Publishing for Multiple Sensitive Attributes Based on Security Level"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9516-1947","authenticated-orcid":false,"given":"Yuelei","family":"Xiao","sequence":"first","affiliation":[{"name":"School of Modern Posts, Xi\u2019an University of Post and Telecommunications, Xi\u2019an 710061, China"},{"name":"Shaanxi Provincial Information Engineering Research Institute, Xi\u2019an 710075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiqi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Modern Posts, Xi\u2019an University of Post and Telecommunications, Xi\u2019an 710061, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,3,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"k-anonymity: A model for protecting privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1749603.1749605","article-title":"Privacy-preserving data publishing: A survey on recent developments","volume":"42","author":"Fung","year":"2010","journal-title":"ACM Comput. Surv."},{"key":"ref_3","first-page":"24","article-title":"l-diversity: Privacy beyond k-anonymity","volume":"1","author":"Machanavajjhala","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data (Tkdd)"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., and Venkatasubramanian, S. (2007, January 15\u201320). t-Closeness: Privacy beyond k-anonymity and 1-diversity. Proceedings of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey.","DOI":"10.1109\/ICDE.2007.367856"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wong, C.R.W., Li, J., and Fu, A.W.C. (2006, January 20\u201323). (a, k)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing. Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, Philadelphia, PA, USA.","DOI":"10.1145\/1150402.1150499"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Truta, T.M., and Vinay, B. (2006, January 3\u20137). Privacy protection: P-sensitive k-anonymity property. Proceedings of the 22nd International Conference on Data Engineering Workshops, Atlanta, GA, USA.","DOI":"10.1109\/ICDEW.2006.116"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Xiao, X., and Tao, Y. (2006, January 12\u201315). Anatomy: Simple and effective privacy preservation. Proceedings of the 32nd international conference on Very large data bases, Seoul, Korea.","DOI":"10.1145\/1142473.1142500"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TKDE.2010.236","article-title":"Slicing: A new approach for privacy preserving data publishing","volume":"24","author":"Li","year":"2012","journal-title":"IEEE Trans. Knowl. Discov. Data Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TKDE.2009.65","article-title":"ANGEL: Enhancing the utility of generalization for privacy preserving publication","volume":"21","author":"Tao","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"He, X., Xiao, Y., Li, Y., Wang, Q., Wang, W., and Shi, B. (2012). Permutation anonymization: Improving anatomy for privacy preservation in data publication. New Front. Appl. Data Min., 111\u2013123. LNCS 7104.","DOI":"10.1007\/978-3-642-28320-8_10"},{"key":"ref_11","first-page":"51","article-title":"k-anonymity model for multiple sensitive","volume":"1","author":"Maheshwarkar","year":"2012","journal-title":"Int. J. Comput. Appl. Optim. -Chip Commun."},{"key":"ref_12","first-page":"122","article-title":"Multiple sensitive attributes based privacy preserving data mining using k-anonymity","volume":"5","author":"Usha","year":"2014","journal-title":"Int. J. Sci. Eng. Res."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Liu, F., Jia, Y., and Han, W. (2012, January 27\u201329). A new k-anonymity algorithm towards multiple sensitive attributes. Proceedings of the 12th International Conference on Computer and Information Technology, Chengdu, China.","DOI":"10.1109\/CIT.2012.157"},{"key":"ref_14","first-page":"4923","article-title":"A novel anonymity algorithm for privacy preserving in publishing multiple sensitive attributes","volume":"4","author":"Wang","year":"2012","journal-title":"Res. J. Appl. Sci. Eng. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1504\/IJHPCN.2016.080412","article-title":"Utility-based anonymization for dataset with multiple sensitive attributes information","volume":"9","author":"Wang","year":"2016","journal-title":"Int. J. High. Perform. Comput. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.cose.2013.03.008","article-title":"Privacy-preserving publishing of opinion polls","volume":"37","author":"Abdalaal","year":"2013","journal-title":"Comput. Secur."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1007\/s11277-016-3922-4","article-title":"An improved algorithm of individuation k-anonymity for multiple sensitive attributes","volume":"95","author":"Zhang","year":"2007","journal-title":"Wirel. Pers. Commun."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Guo, M., Liu, Z., and Wang, H. (2016, January 13\u201314). Personalized privacy preserving approaches for multiple sensitive attributes in data publishing. Proceedings of the 2016 International Conference on Information Science and Technology, Guilin, China.","DOI":"10.12783\/dtetr\/ssme-ist2016\/3965"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Li, Z., and Ye, X. (2007, January 12\u201315). Privacy protection on multiple sensitive attributes. Proceedings of the 9th International Conference on Information and Communications Security, Zhengzhou, China.","DOI":"10.1007\/978-3-540-77048-0_11"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Zhu, H., Tian, S., Xie, M., and Yang, M. (2014, January 4\u20137). Preserving privacy for sensitive values of individuals in data publishing based on a new additive noise approach. Proceedings of the 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, China.","DOI":"10.1109\/ICCCN.2014.6911855"},{"key":"ref_21","first-page":"1","article-title":"Privacy beyond sensitive values","volume":"58","author":"Huang","year":"2015","journal-title":"Sci. China Inf. Sci."},{"key":"ref_22","first-page":"319","article-title":"Privacy preserving for multiple sensitive attributes based on l-coverage","volume":"163","author":"Jin","year":"2011","journal-title":"High. Perform. Netw. Comput. Commun. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"28","DOI":"10.4018\/jisp.2008070103","article-title":"A privacy protection model for patient data with multiple sensitive attributes","volume":"2","author":"Gal","year":"2008","journal-title":"Int. J. Inf. Secur. Priv."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Widodo, W., and Wibowo, W.C. (2018, January 30\u201331). A distributional model of sensitive values on p-sensitive in multiple sensitive attributes. Proceedings of the 2nd International Conference on Informatics and Computational Sciences (ICICoS), Semarang, Indonesia.","DOI":"10.1109\/ICICOS.2018.8621698"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Wu, Y., Ruan, X., Liao, S., and Wang, X. (2010, January 24\u201327). P-cover k-anonymity model for protecting multiple sensitive attributes. Proceedings of the 5th International Conference on Computer Science and Education (ICCSE), Hefei, China.","DOI":"10.1109\/ICCSE.2010.5593663"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., and Ramakrishnan, R. (2005, January 14\u201316). Incognito: Efficient full-domain k-anonymity. Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, USA.","DOI":"10.1145\/1066157.1066164"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Lin, J.C.W., Fournier-Viger, P., Liu, Q., Djenouri, Y., and Zhang, J. (2018, January 3\u20136). Anonymization of multiple and personalized sensitive attributes. Proceedings of the 20th International Conference on Big Data Analytics and Knowledge Discovery, Regensburg, Germany.","DOI":"10.1007\/978-3-319-98539-8_16"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"5127","DOI":"10.1007\/s11227-018-2390-x","article-title":"An efficient approach for publishing microdata for multiple sensitive attributes","volume":"74","author":"Anjum","year":"2018","journal-title":"J. Super. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ins.2019.03.004","article-title":"Privacy-preserving model and generalization correlation attacks for 1:M data with multiple sensitive attributes","volume":"488","author":"Kanwal","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1007\/s11390-018-1884-6","article-title":"Privacy-preserving algorithms for multiple sensitive attributes satisfying t-closeness","volume":"33","author":"Wang","year":"2018","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Sowmyarani, C.N., and Srinivasan, G.N. (2015, January 8\u201310). A robust privacy preserving model for data publishing. Proceedings of the 2015 International Conference on Computer Communication and Informatics (ICCCI), Coimbatore, India.","DOI":"10.1109\/ICCCI.2015.7218095"},{"key":"ref_32","first-page":"6","article-title":"Enhancing utility and privacy using t closeness for multiple sensitive attributes","volume":"10","author":"Saraswathi","year":"2016","journal-title":"Adv. Nat. Appl. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"574","DOI":"10.3724\/SP.J.1016.2008.00574","article-title":"Privacy preserving approaches for multiple sensitive attributes in data publishing","volume":"31","author":"Yang","year":"2008","journal-title":"Chin. J. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TST.2015.7128936","article-title":"Privacy-preserving data publishing for multiple numerical sensitive attributes","volume":"20","author":"Liu","year":"2015","journal-title":"Tsinghua Sci. Technol."},{"key":"ref_35","unstructured":"Luo, F., Han, J., Lu, J., and Peng, H. (2013, January 23\u201325). ANGELMS: A privacy preserving data publishing framework for microdata with multiple sensitive attributes. Proceedings of the 3rd International Conference on Information Science and Technology, Yangzhou, China."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ye, Y., Wang, L., Han, J., and Qin, S. (2017, January 9\u201312). An anonymization method combining anatomy and permutation for protecting privacy in microdata with multiple sensitive attributes. Proceedings of the 2017 International Conference on Machine Learning and Cybernetics (ICMLC), Ningbo, China.","DOI":"10.1109\/ICMLC.2017.8108955"},{"key":"ref_37","first-page":"4261","article-title":"Implementation of slicing for multiple column multiple attributes: Privacy preserving data publishing","volume":"3","author":"Dhumal","year":"2015","journal-title":"Int. J. Recent Innov. Trends Comput. Commun."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Kiruthika, S., and Raseen, M.M. (2013, January 3). Enhanced slicing models for preserving privacy in data publication. Proceedings of the 2013 International Conference on Current Trends in Engineering and Technology (ICCTET), Coimbatore, India.","DOI":"10.1109\/ICCTET.2013.6675998"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"3096","DOI":"10.4304\/jsw.8.12.3096-3104","article-title":"SLOMS: A privacy preserving data publishing method for multiple sensitive attributes microdata","volume":"8","author":"Han","year":"2013","journal-title":"J. Softw."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/19393555.2017.1319522","article-title":"KC-Slice: A dynamic privacy preserving data publishing technique for multisensitive attributes","volume":"26","author":"Onashoga","year":"2017","journal-title":"Inf. Secur. J. Glob. Perspect."},{"key":"ref_41","first-page":"18","article-title":"A novel dynamic KCi-Slice publishing prototype for retaining privacy and utility of multiple sensitive attributes","volume":"11","author":"Raju","year":"2019","journal-title":"Int. J. Inf. Technol. Comput. Sci."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"197","DOI":"10.14419\/ijet.v7i2.20.13296","article-title":"A novel approach for personalized privacy preserving data publishing with multiple sensitive attributes","volume":"7","author":"Reddy","year":"2018","journal-title":"Int. J. Eng. Technol."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1186\/s40064-016-2490-0","article-title":"Anatomisation with slicing: A new privacy preservation approach for multiple sensitive attributes","volume":"5","author":"Susan","year":"2016","journal-title":"Springerplus"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Ye, Y., Liu, Y., Wang, C., Lv, D., and Feng, J. (2009, January 21\u201323). Decomposition: Privacy preservation for multiple sensitive attributes. Proceedings of the 14th Database Systems for Advanced Applications, Brisbane, Australia.","DOI":"10.1007\/978-3-642-00887-0_42"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Das, D., and Bhattacharyya, D.K. (2012, January 2\u20134). Decomposition+: Improving l-diversity for multiple sensitive attributes. Proceedings of the second International Conference on Computer Science and Information Technology, Bangalore, India.","DOI":"10.1007\/978-3-642-27308-7_44"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Liu, J., Luo, J., and Huang, J. (2011, January 11). Rating: Privacy preservation for multiple attributes with different sensitivity requirements. Proceedings of the 11th International Conference on Data Mining Workshops (ICDMW), Vancouver, BC, Canada.","DOI":"10.1109\/ICDMW.2011.144"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Yi, T., and Shi, M. (2015). Privacy protection method for multiple sensitive attributes based on strong rule. Hindawi Publ. Corp. Math. Probl. Eng., 464731.","DOI":"10.1155\/2015\/464731"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/3\/166\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:10:33Z","timestamp":1760173833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/3\/166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,22]]},"references-count":47,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,3]]}},"alternative-id":["info11030166"],"URL":"https:\/\/doi.org\/10.3390\/info11030166","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,22]]}}}