PREVENTING DISCLOSURE OF SENSITIVE INFORMATION FROM UNAUTHORIZED NODES
Abstract
Traditional works in anonymization techniques lessen the inexactness aggregate that was added for every totally not recognized. The anonymization meant for constant data posting remains considered in literature. The privacy is accomplished inside the expenditure of precision in addition to imprecision is commenced in approved information inside the access control policy. Within our work and precision-restricted privacy-safeguarding access control structure for relational data remains forecasted that's a mixture of access control in addition to privacy protection systems. To represent our approach, role-based access control is called. The privacy safeguarding component anonymizes data to full privacy needs in addition to inexactness constraints on predicates which are set by mechanism of access control. The mechanism of privacy protection helps to ensure that privacy in addition to precision objectives are met sooner than the sensitive particulars work for purchase for it access control system. Imprecision bound concept was requested for permission to explain a threshold on imprecision amount which can be tolerated. The imprecision bound particulars aren't allotted with clients since knowing imprecision bound can effect in breaking needs of privacy. The mechanism of privacy protection is essential to satisfy privacy necessity all together with imprecision bound for permission.
Keywords
References
A. Meyerson and R. Williams, “On The Complexity of Optimal k-Anonymity,” Proc. 23rd ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems, pp. 223-228, 2004.
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.
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, 2004.
A. Rask, D. Rubin, and B. Neumann, “Implementing Row-and Cell-Level Security in Classified Databases Using SQL Server 2005,” MS SQL Server Technical Center, 2005.
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, D. DeWitt, and R. Ramakrishnan, “Mondrian Multidimensional K-Anonymity,” Proc. 22nd Int’l Conf. Data Eng., pp. 25- 25, 2006.
Refbacks
- There are currently no refbacks.
Copyright © 2012 - 2023, All rights reserved.| ijitr.com
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.