文章基本信息

标题：Efficient Relational Data Management Using Access Control and Privacy-Preserving Mechanism
本地全文：下载
作者：CH. Srinivasa Reddy ; V.vasanthi ; Ravuri Daniel 等
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2016
卷号：7
期号：1
页码：349-352
出版社：TechScience Publications
摘要：In an organization or agency the authorizedusers misuse the sensitive information. Sensitive informationis data that must be protected from unauthorized access. Dataconfidentiality ,Availability, and Integrity are more necessarypart of Relational data base security. Access controlmechanism protect sensitive information but there is a lackof privacy-preserving when authorized users misuse thesensitive information. We can use both Access control andprivacy-preserving mechanisms. The Access control policiesdefine selection that implies to roles available in the system.The privacy-preserving can be achieved throughanonymization like generalization and suppression. Weintroduce heuristics for anonymization algorithms. and alsosatisfy the privacy requirements e.g. k-anonymity and Ldiversity.In addition to that we need to satisfy imprecisionbounds for more permission and has lower total imprecision.We have proved that the total imprecision is low by using theanonymization algorithms which are Top-Down Heuristic1(TDH 1) and Top-Down Heuristic 3(TDH3).TDH3 totalimprecision is low when compared to TDH1. Finally totalimprecision is low by which the privacy can be achieved
关键词：Access control; privacy; k-anonymity; query;evaluation.