OCDP: An enhanced perturbation approach for data privacy protection

IF 3.8 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
S. Sathiya Devi , K. Jayasri
{"title":"OCDP: An enhanced perturbation approach for data privacy protection","authors":"S. Sathiya Devi ,&nbsp;K. Jayasri","doi":"10.1016/j.jisa.2025.104046","DOIUrl":null,"url":null,"abstract":"<div><div>With the exponential growth of internet and digital technology, there is a significant increase in the volume of personal data being collected, stored and shared across various platforms poses privacy risks including unauthorized access, misuse and exploitation. To mitigate these risks, effective privacy mechanisms are crucial. One such mechanism is Differential Privacy (DP) which aims to protect personal information by introducing noise into the data to obstruct individual identification. Though it effectively prevents breaches of personal information, a trade-off exists among privacy and accuracy. Additionally, DP often requires meticulous noise parameter tuning which can be complex and resource intensive. To overcome these challenges, this paper proposed the method named Opti-Cluster Differential Privacy (OCDP). The proposed OCDP is designed to automatically determine the optimal amount of noise for a dataset. The dataset is first divided into non-overlapping clusters using k-means clustering. It then employs a hybrid approach combining DP with Particle Swarm Optimization (PSO) to compute the optimal noise parameter (<em>ε</em> - epsilon) for each cluster. Based on this computed value, noise is added to each cluster and then it is merged to produce a final perturbed dataset. The Experimental results demonstrate that the proposed OCDP method achieves high privacy while being computationally efficient. The proposed OCDP method produces data with privacy percentages of 84 %, 88 %, 89 %, 85 %, 83 % and 77 % for the Heart Disease, GDM, Adult, Automobile, Thyroid Disease and Insurance datasets respectively representing 13 % (with clustering) and 50 % high (without clustering) when compared with other methods. Moreover, OCDP's computational efficiency allows for faster processing times making it reliable solution for maintaining privacy in large datasets.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"90 ","pages":"Article 104046"},"PeriodicalIF":3.8000,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625000833","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the exponential growth of internet and digital technology, there is a significant increase in the volume of personal data being collected, stored and shared across various platforms poses privacy risks including unauthorized access, misuse and exploitation. To mitigate these risks, effective privacy mechanisms are crucial. One such mechanism is Differential Privacy (DP) which aims to protect personal information by introducing noise into the data to obstruct individual identification. Though it effectively prevents breaches of personal information, a trade-off exists among privacy and accuracy. Additionally, DP often requires meticulous noise parameter tuning which can be complex and resource intensive. To overcome these challenges, this paper proposed the method named Opti-Cluster Differential Privacy (OCDP). The proposed OCDP is designed to automatically determine the optimal amount of noise for a dataset. The dataset is first divided into non-overlapping clusters using k-means clustering. It then employs a hybrid approach combining DP with Particle Swarm Optimization (PSO) to compute the optimal noise parameter (ε - epsilon) for each cluster. Based on this computed value, noise is added to each cluster and then it is merged to produce a final perturbed dataset. The Experimental results demonstrate that the proposed OCDP method achieves high privacy while being computationally efficient. The proposed OCDP method produces data with privacy percentages of 84 %, 88 %, 89 %, 85 %, 83 % and 77 % for the Heart Disease, GDM, Adult, Automobile, Thyroid Disease and Insurance datasets respectively representing 13 % (with clustering) and 50 % high (without clustering) when compared with other methods. Moreover, OCDP's computational efficiency allows for faster processing times making it reliable solution for maintaining privacy in large datasets.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信