Preserving the Privacy of Sensitive Data Using Bit-Coded-Sensitive Algorithm (BCSA)

P. Ghann, E. Tetteh, Kobby Asare Obeng, Muhyideen Elias
{"title":"Preserving the Privacy of Sensitive Data Using Bit-Coded-Sensitive Algorithm (BCSA)","authors":"P. Ghann, E. Tetteh, Kobby Asare Obeng, Muhyideen Elias","doi":"10.3991/ijes.v10i04.35023","DOIUrl":null,"url":null,"abstract":"Organizations now deal with massive amounts of data. Data is collected from various points such as hospitals, credit card companies, and search engines. After collecting this voluminous data, it is published and shared for research. Data that is collected may have sensitive information that might be used to identify an individual and consequently lead to privacy violations when published. To address this challenge, privacy-preserving data publishing (PPDP) seeks to remove threats to privacy while ensuring that the necessary information is released for data mining. Various techniques have been proposed to solve the problems associated with sensitive information. One such technique is k- anonymity. This technique is the best and very efficient. However, it also leads to loss of information, reduces data utility, and works well only with static tables. In this paper, we proposed a technique that addresses the challenges of K-anonymity known as the Bit-Coded-Sensitive Algorithm (BCSA). This algorithm is more efficient and effective and ensures that the privacy of the individual is preserved by avoiding disclosure, and linkages and at the same time ensuring high quality and utility of data. BCSA first identifies the source of data and based on that, uses bits to code sensitive data with a key.","PeriodicalId":427062,"journal":{"name":"Int. J. Recent Contributions Eng. Sci. IT","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Recent Contributions Eng. Sci. IT","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3991/ijes.v10i04.35023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Organizations now deal with massive amounts of data. Data is collected from various points such as hospitals, credit card companies, and search engines. After collecting this voluminous data, it is published and shared for research. Data that is collected may have sensitive information that might be used to identify an individual and consequently lead to privacy violations when published. To address this challenge, privacy-preserving data publishing (PPDP) seeks to remove threats to privacy while ensuring that the necessary information is released for data mining. Various techniques have been proposed to solve the problems associated with sensitive information. One such technique is k- anonymity. This technique is the best and very efficient. However, it also leads to loss of information, reduces data utility, and works well only with static tables. In this paper, we proposed a technique that addresses the challenges of K-anonymity known as the Bit-Coded-Sensitive Algorithm (BCSA). This algorithm is more efficient and effective and ensures that the privacy of the individual is preserved by avoiding disclosure, and linkages and at the same time ensuring high quality and utility of data. BCSA first identifies the source of data and based on that, uses bits to code sensitive data with a key.
使用位码敏感算法(BCSA)保护敏感数据的隐私
组织现在要处理大量的数据。数据是从医院、信用卡公司、搜索引擎等不同的地方收集的。在收集了大量数据后,它被发表并分享用于研究。所收集的数据可能包含敏感信息,可用于识别个人身份,因此在公布时可能导致侵犯隐私。为了应对这一挑战,隐私保护数据发布(PPDP)寻求消除对隐私的威胁,同时确保为数据挖掘发布必要的信息。已经提出了各种技术来解决与敏感信息相关的问题。其中一种技术就是匿名。这种方法是最好的,而且非常有效。但是,它也会导致信息丢失,降低数据效用,并且只适用于静态表。在本文中,我们提出了一种解决k -匿名挑战的技术,称为比特码敏感算法(BCSA)。该算法在保证数据的高质量和实用性的同时,避免了数据的泄露和关联,保证了个人隐私的保护。BCSA首先识别数据的来源,并在此基础上使用位对敏感数据进行密钥编码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信