Efficient Access Control Mechanism for Relational Database
Access control mechanisms preserve the sensitive data's from unauthenticated users. However, when sensitive data's is given and a Privacy Protection Mechanism (PPM) is not in place, an authorized user can still surrender the privacy of a person leading to unique revelation. A PPM can use suppression and generalization of relational data to anonymize and satisfy privacy necessity, e.g., k-anonymity and i-diversity, against unique and attribute revelation. However, privacy is achieved at the cost of precision of authorized data. In this paper, the authors propose an efficient access control method.