A Novel System for Privacy-Preserving Access Control for Relational Data with Accuracy

Abstract

Access Control is a set of controls to restrict access to certain resources. If we think about it, access controls are everywhere around us. A door to your room, the guards allowing you to enter the office building on seeing your access card, swiping your card and scanning your fingers on the biometric system, a queue for food at the canteen or entering your credentials to access FB, all are examples of various types of access control. Here we focus only on the logical Access Control mechanisms. Access control mechanisms protect sensitive information from unauthorized users. However, when sensitive information is shared and a Privacy Protection Mechanism (PPM) is not in place, an authorized user can still compromise the privacy of a person leading to identity disclosure. A PPM can use suppression and generalization of relational data to anonymize and satisfy privacy requirements, e.g., k-anonymity and ldiversity, against identity and attribute disclosure. However, privacy is achieved at the cost of precision of authorized information. In this paper, we propose an accuracy-constrained privacy-preserving access control framework. The access control policies define selection predicates available to roles while the privacy requirement is to satisfy the k-anonymity or l-diversity. An additional constraint that needs to be satisfied by the PPM is the imprecision bound for each selection predicate. The techniques for workload-aware anonymization for selection predicates have been discussed in the literature. However, to the best of our knowledge, the problem of satisfying the accuracy constraints for multiple roles has not been studied before. In our formulation of the aforementioned problem, we propose heuristics for anonymization algorithms and show empirically that the proposed approach satisfies imprecision bounds for more permissions and has lower total imprecision than the current state of the art.

Authors and Affiliations

Sai Sirisha Chittineni| M.Tech (CSE), NRI Institute of Technology, A.P., India, Bandarupalli Mouleswara Rao| Assoc Professor, Dept. of Computer Science & Engineering, NRI Institute of Technology, A.P., India

Keywords

Related Articles

Early detection of patients with lifted danger of creating diabetes mellitus is basic to the enhanced counteractive action and general clinical management of these patients. Data mining now-a-days assumes a critical...

Privacy Preserving from global eavesdropper in Wireless Sensor Network Using Routing Technique

Various sensor network security schemes care for the content of messages, while the related information is left defenceless by divulge the location of the monitored objects. Preserving location privacy is essential a...

Easing Operative User Steering through Website Construction Development

Data Mining is a step of Knowledge Discovery in Databases. Clustering can be considered the most important unsupervised learning method so, as every other problem of this kind, it deals with finding a arrangement in...

A Security Measure That Quantify The Anonymity Of Different Systems

The basis ambiguity difficulty in wireless sensor networks is the trouble of studying methods that provide time and position privacy for events reported by sensor nodes. Time and location privacy will be used interch...

Design and Analysis of a Propeller Shaft in CAE tool and ANSYS

A Propeller Shaft is a device on which a propeller is attached to and transfers the power from the engine to the propeller. In the design of automobiles, the industry is exploiting in order to obtain reduction of wei...

Download PDF file
  • EP ID EP16529
  • DOI -
  • Views 299
  • Downloads 18

How To Cite

Sai Sirisha Chittineni, Bandarupalli Mouleswara Rao (2015). A Novel System for Privacy-Preserving Access Control for Relational Data with Accuracy. International Journal of Science Engineering and Advance Technology, 3(8), 346-350. https://europub.co.uk/articles/-A-16529