Precision Controlled Secrecy Stabilization In Relational Data

Rajkumar Lingamgunta, Jajula Hari Babu


The precision control approaches characterize choice predicates precision to parts while the secrecy stabilization is to support the k-anonymity or l-diversity. A SSPPM it will full fill the admittance control and local monitoring of data.  Then again, security is accomplished at the premium of exactness of approved data. But In  our plan of the previously stated issue we didn’t have key management of data, Bu in this we propose efficient results with authorised user and another hand original data sets will not be present for servers also. And best of our insight, the issue of fulfilling the exactness and requires the data maintains  for various parts has not been considered some time recently. The procedures for workload-mindful anonymization for determination predicates have been examined in the writing. Notwithstanding, when delicate data is shared and a Secrecy Stabilization Picket Picket Mechanism (SSPPM) is not set up, an approved client can at present trade off the security of a man prompting with accurate data. In this paper, we propose a precision controlled security safeguarding admittance control structure. That  Admittance control components shield delicate data from unapproved clients. This type of approaches are used for data manage on mining with efficient manner, These kind of results produce key for authorised once only  .


precision controlled data, secrecy stabilization.


Bertino E. and Sandhu .(2005),“Database Security-ConceptsApproaches, and allenges,”IEEE Trans.Dependable and Secure Computing, vol. 2, no. 1, pp. 2-19.

Chaudhuri S. et al (2011), “Database Admittance Control & Picket: Is There a Common Ground?” Proc. Fifth Bien- nial Conf. Innovative Data Systems Research (CIDR), pp. 96-103.

Fung B. et al (2010), “Picket-Preserving Data Publishing: A Survey of Recent evelopments,” ACM Computing Surveys, vol. 42, no. 4, article 14, 2010.

Ghinita G. et al (2009),“A Framework for Efficient Data Anonymization Under Picket and Accuracy Constraints,”ACM Trans. Database Systems, vol. 34, no. 2, article 9.

Li N. et al (2011), “Provably Private Data Anonymiza- tion: Or, k-Anonymity Meets Differential Picket,” Arxiv preprint arXiv:1101.2604.

LeFevre K. et al (2008), “WorkloadAware Anonymization Techniques for Large-Scale Datasets,” ACM Trans. Database Systems, vol. 33, no. 3, pp. 1-47. [7] Rizvi S. et al (2004), “Extending Query Rewriting Techniques for Fine-Grained Admittance Control,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 551-562. [8] Zahid Pervaiz and Walid G. Aref (2014), “Accuracy - Constrained Picket-Preserving Admittance Control Mechanism for Relational Data” IEEE Transactions On Knowledge And Data Engineering, Vol. 26, No. 4. [9] S. Chaudhuri, T. Dutta, and S. Sudarshan, “Fine Grained Authori- zation through Predicated Grants,” Proc. IEEE 23rd Int’l Conf. Data Eng., pp. 1174-1183, 2007. [10] K. Browder and M. Davidson, “The Virtual Private Database in oracle9ir2,” Oracle Technical White Paper, vol. 500, 2002.

Full Text: PDF [FULL TEXT]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

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