Access Control And Security Mechanisms On Sensitive Information

P. Srivijaya, D Srinivas

Abstract


Protection preserving module anonymizes the information to gather security necessities and crudeness requirements on predicates set by the entrance control gadget. We make this correspondence as the issue of k-anonymous. Part based Access Control (RBAC) consents to huge authorizations on items in light of parts in an association. A RBAC strategy arrangement is made out of an arrangement of Users (U), an arrangement of Roles (R), and an arrangement of Permissions (P). The entrance control approaches disclose choice predicates available to parts in the meantime as the protection impulse is to satisfy the k-anonymity or l-diversity.


References


E. Bertino and R. Sandhu, “Database Security-Concepts, Approaches, and Challenges,” IEEE Trans. Dependable and Secure Computing, vol. 2, no. 1, pp. 2-19, Jan.-Mar. 2005.

P. Samarati, “Protecting Respondents’ Identities in Microdata Release,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp. 1010-1027, Nov. 2001.

B. Fung, K. Wang, R. Chen, and P. Yu, “Privacy-Preserving Data Publishing: A Survey of Recent Developments,” ACM Computing Surveys, vol. 42, no. 4, article 14, 2010.

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, “L-Diversity: Privacy Beyond k-anonymity,” ACM Trans. Knowledge Discovery from Data, vol. 1, no. 1, article 3, 2007.

K. LeFevre, D. DeWitt, and R. Ramakrishnan, “Workload-Aware Anonymization Techniques for Large-Scale Datasets,” ACM Trans. Database Systems, vol. 33, no. 3, pp. 1-47, 2008.

T. Iwuchukwu and J. Naughton, “K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization,” Proc. 33rd Int’l Conf. Very Large Data Bases, pp. 746-757, 2007.

J. Buehler, A. Sonricker, M. Paladini, P. Soper, and F. Mostashari, “Syndromic Surveillance Practice in the United States: Findings from a Survey of State, Territorial, and Selected Local Health

Departments,” Advances in Disease Surveillance, vol. 6, no. 3, pp. 1- 20, 2008.

K. Browder and M. Davidson, “The Virtual Private Database in oracle9ir2,” Oracle TechnicalWhite Paper, vol. 500, 2002.

A. Rask, D. Rubin, and B. Neumann, “Implementing Row-and Cell-Level Security in Classified Databases Using SQL Server

,” MS SQL Server Technical Center, 2005.

S. Rizvi, A. Mendelzon, S. Sudarshan, and P. Roy, “Extending Query Rewriting Techniques for Fine-Grained Access Control,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 551-562,

S. Chaudhuri, T. Dutta, and S. Sudarshan, “Fine Grained Authorization through Predicated Grants,” Proc. IEEE 23rd Int’l Conf. Data Eng., pp. 1174-1183, 2007.

K. LeFevre, R. Agrawal, V. Ercegovac, R. Ramakrishnan, Y. Xu, and D. DeWitt, “Limiting Disclosure in Hippocratic Databases,” Proc. 30th Int’l Conf. Very Large Data Bases, pp. 108-119, 2004.

D. Ferraiolo, R. Sandhu, S. Gavrila, D. Kuhn, and R. Chandramouli, “Proposed NIST Standard for Role-Based Access Control,” ACM Trans. Information and System Security, vol. 4, no. 3, pp. 224- 274, 2001.

K. LeFevre, D. DeWitt, and R. Ramakrishnan, “Mondrian Multidimensional K-Anonymity,” Proc. 22nd Int’l Conf. Data Eng., pp. 25- 25, 2006.

J. Friedman, J. Bentley, and R. Finkel, “An Algorithm for Finding Best Matches in Logarithmic Expected Time,” ACM Trans. Mathematical Software, vol. 3, no. 3, pp. 209-226, 1977.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.