{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:09:34Z","timestamp":1774368574819,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T00:00:00Z","timestamp":1574294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Investigation into privacy preserving data publishing with multiple sensitive attributes is performed to reduce probability of adversaries to guess the sensitive values. Masking the sensitive values is usually performed by anonymizing data by using generalization and suppression techniques. A successful anonymization technique should reduce information loss due to the generalization and suppression. This research attempts to solve both problems in microdata with multiple sensitive attributes. We propose a novel overlapped slicing method for privacy preserving data publishing with multiple sensitive attributes. We used discernibility metrics to measure information loss. The experiment result shows that our method obtained a lower discernibility value than other methods.<\/jats:p>","DOI":"10.3390\/info10120362","type":"journal-article","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T02:49:27Z","timestamp":1574390967000},"page":"362","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Privacy Preserving Data Publishing with Multiple Sensitive Attributes based on Overlapped Slicing"],"prefix":"10.3390","volume":"10","author":[{"family":"Widodo","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, Universitas Indonesia, West Java 16424, Indonesia"},{"name":"Department of Informatics Education, Universitas Negeri Jakarta, Jl.Rawamangun Muka, Jakarta 13220, Indonesia"}]},{"given":"Eko Kuswardono","family":"Budiardjo","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Universitas Indonesia, West Java 16424, Indonesia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9817-6228","authenticated-orcid":false,"given":"Wahyu Catur","family":"Wibowo","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Universitas Indonesia, West Java 16424, Indonesia"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Yu, T., and Jojodia, S. (2007). Microdata Protection. Secure Data Management and Decentralized Systems. Advanced in Information Security, Springer.","DOI":"10.1007\/978-0-387-27696-0"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1049\/iet-ifs.2016.0613","article-title":"Personalised anonymity for microdata release","volume":"2","author":"Can","year":"2018","journal-title":"IET Inf. Secur."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Taylor, L., Zhou, X.H., and Rise, P. (2018). A tutorial in assessing disclosure risk in microdata. Statistics in Medicine, Wiley.","DOI":"10.1002\/sim.7667"},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","article-title":"Achieving k-Anonymity Privacy Protection Using Generalization and Suppression","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., and Venkitasubramaniam, M. (2006, January 3\u20137). l-diversity: Privacy Beyond k-Anonymity. Proceedings of the International Conference on Data Engineering (ICED), Atlanta, GA, USA.","DOI":"10.1109\/ICDE.2006.1"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Truta, T.M., and Bindu, V. (2006, January 3\u20137). Privacy Protection: P-sensitive k-anonymity property. International Workshop of Privacy Data Management (PDM2006). Proceedings of the Conjunction with 22th International Conference of Data Engineering (ICDE), Atlanta, GA, USA.","DOI":"10.1109\/ICDEW.2006.116"},{"key":"ref_8","unstructured":"Xiao, X., and Tao, Y. (2006, January 12\u201315). Anatomy: Simple and effective privacy preservation. Proceedings of the 32nd Very Large Databases (VLDB), Seoul, Korea."},{"key":"ref_9","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. IJISP"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Ye, Y., Liu, Y., Wang, C., Lv, D., and Feng, C. (2009, January 20\u201323). Decomposition: Privacy Preservation for Multiple Sensitive Attributes. Proceedings of the International Conference on Database Systems for Advanced Applications, Brisbane, QLD, Australia.","DOI":"10.1007\/978-3-642-00887-0_42"},{"key":"ref_11","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 International Conference on Computer Science and Information Technology, Bangalore, India.","DOI":"10.1007\/978-3-642-27308-7_44"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.datak.2010.11.002","article-title":"Privacy-preserving publishing microdata with full functional dependencies","volume":"70","author":"Wang","year":"2011","journal-title":"Data Knowl. Eng."},{"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 2012 IEEE 12th International Conference on Computer and Information Technology (CIT), Chengdu, China.","DOI":"10.1109\/CIT.2012.157"},{"key":"ref_14","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_15","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_16","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, Jiangsu, China."},{"key":"ref_17","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_18","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_19","doi-asserted-by":"crossref","unstructured":"Baig, M.M., Li, J., Liu, J., and Wang, H. (2011, January 24\u201328). Cloning for Privacy Protection in Multiple Independent Data Publications. Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, Scotland, UK.","DOI":"10.1145\/2063576.2063705"},{"key":"ref_20","unstructured":"and Wibowo, W.C. (2018, January 30\u201331). A Distributional Model of Sensitive Values on p-Sensitive in Multiple Sensitive Attributes. Proceedings of the International Conference on Informatics and Computational Science, UNDIP Semarang, Kota Semarang, Indonesia."},{"key":"ref_21","unstructured":"Budiardjo, E.B., Wibowo, W.C., and Achsan, H.T.Y. (2019, January 11). An Approach for Distributing Sensitive Values in k-Anonymity. Proceedings of the International Workshop on Big Data and Information Security (IWBIS), Nusa Dua, Bali, Indonesia."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hasan, A.S.M.T., Jiang, Q., Chen, H., and Wang, S. (2018). A New Approach to Privacy-Preserving Multiple Independent Data Publishing. Appl. Sci., 8.","DOI":"10.3390\/app8050783"},{"key":"ref_23","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. A Glob. Perspect."},{"key":"ref_24","first-page":"18","article-title":"A Novel Dynamic KCi - Slice Publishing Prototype for Retaining Privacy and Utility of Multiple Sensitive Attributes","volume":"4","author":"Raju","year":"2019","journal-title":"Int. J. Inf. Technol. Comput. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Nithya, M., and Sheela, T. (2018). Predictive delimiter for multiple sensitive attribute publishing. Clust. Comput, 1\u20138.","DOI":"10.1007\/s10586-017-1612-y"},{"key":"ref_26","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_27","first-page":"172","article-title":"A Study on k-anonymity, l-diversity, and t-closeness Techniques focusing Medical Data","volume":"17","author":"Rajendran","year":"2017","journal-title":"Int. J. Comput. Sci. Netw. Secur. (IJCSNS)"},{"key":"ref_28","unstructured":"Panda, B., Sharma, S., and Batra, U. (2018). An Enhanced Method for Privacy-Preserving Data Publishing, In Innovations in Computational Intelligence. Studies in Computational Intelligence, Springer."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/1749603.1749605","article-title":"Privacy Preserving Data Publishing: A Survey of Recent Development","volume":"42","author":"Fung","year":"2010","journal-title":"ACM Comput. Surv."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Zheng, W., Wang, Z., Lv, T., Ma, Y., and Jia, C. (2018, January 15\u201317). K-Anonymity Algorithm based on Improved Clustering. Proceedings of the International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), Guangzhou, China.","DOI":"10.1007\/978-3-030-05054-2_36"},{"key":"ref_31","first-page":"329","article-title":"Finding a needle in a haystack-or identifying anonymous census record","volume":"2","author":"Dalenaius","year":"1986","journal-title":"J. Off. Stat."},{"key":"ref_32","unstructured":"Bayardo, R.J., and Agrawal, R. (2005, January 5\u20138). Data Privacy through Optimal k-Anonymization. Proceedings of the IEEE International Conference of Data Engineering, Tokyo, Japan."},{"key":"ref_33","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":"2017","journal-title":"Wirel. Pers. Commun."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/362\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:36:27Z","timestamp":1760189787000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,21]]},"references-count":33,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["info10120362"],"URL":"https:\/\/doi.org\/10.3390\/info10120362","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,21]]}}}