CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Optimized Privacy-Preserving Access Control System for Relational Incremental Data

by Jyothi Ghanta, B. Tarakeswara Rao, B. Sathyanarayana Reddy
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 136 - Number 7
Year of Publication: 2016
Authors: Jyothi Ghanta, B. Tarakeswara Rao, B. Sathyanarayana Reddy
10.5120/ijca2016908491

Jyothi Ghanta, B. Tarakeswara Rao, B. Sathyanarayana Reddy . Optimized Privacy-Preserving Access Control System for Relational Incremental Data. International Journal of Computer Applications. 136, 7 ( February 2016), 16-19. DOI=10.5120/ijca2016908491

@article{ 10.5120/ijca2016908491,
author = { Jyothi Ghanta, B. Tarakeswara Rao, B. Sathyanarayana Reddy },
title = { Optimized Privacy-Preserving Access Control System for Relational Incremental Data },
journal = { International Journal of Computer Applications },
issue_date = { February 2016 },
volume = { 136 },
number = { 7 },
month = { February },
year = { 2016 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume136/number7/24165-2016908491/ },
doi = { 10.5120/ijca2016908491 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:36:25.863732+05:30
%A Jyothi Ghanta
%A B. Tarakeswara Rao
%A B. Sathyanarayana Reddy
%T Optimized Privacy-Preserving Access Control System for Relational Incremental Data
%J International Journal of Computer Applications
%@ 0975-8887
%V 136
%N 7
%P 16-19
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Access control Mechanisms are security includes that control how clients and frameworks correspond and interface with different frameworks and assets. Access Control Mechanisms give association the capacity to control, limit, screen, and ensure asset accessibility, trustworthiness and secrecy. Access Protection Mechanism (PPM) utilizes concealment and speculation of social information to anonymize and fulfill security needs. The access control policies characterize choice predicates accessible to parts while the security necessity is to fulfill the k-Anonymity or l-diversity qualities. So I have accompanied a thought of amassing these two procedures i.e. PPM and ACM with errand part based access to give high security and protection to our social information. A superior methodology is to anonymize and give the whole dataset at whatever point it is enlarged with new records or conceivably alongside another dataset containing just new records. In proposed framework consider incremental information where dataset with new information is spread over consistently. The key issue here is that the same information might be anonymized and distributed various times, every time give it in an alternate structure. Therefore, static anonymization or anonymization which does not consider beforehand discharged information might empower different sorts of derivation. In this paper we actualize a Privacy Protection Mechanism for shielding delicate data from unapproved clients. Basically examination inside of the information preparing or data mining with sub space of data security is approximately characterized into access administration investigation and information protection investigation. Abuse security defensive system we will sum up and smother our relative data to anonymize and fulfill protection needs against character and trait discourse act.

References
  1. ZahidPervaiz, Walid G. Aref, ArifGhafoor, and NagabhushanaPrabhu, Accuracy-Constrained Privacy-Preserving Access Control Mechanismfor Relational Data”, IEEE Transactions On Knowledge And Data Engineering, Vol. 26, NO. 4, April 2014.
  2. Ms. S.Kokila, Dr. T. SenthilPrakash, and Ms. P.Maheswari, “ Privacy and Security Ensured Database Rights Management Scheme”, International Journal On engineering Technology and Sciences – IJETS™ ISSN (P): 2349-3968, ISSN (O): 2349-3976 Volume 1 Issue 6, October 2014.
  3. Yung-Wang Lin, Li-Cheng Yang, Luon-Chang Lin, and Yeong-Chin Chen, “Preserving Privacy in Outsourced Database”, International Journal of Computer and Communication Engineering, Vol. 3, No. 5, September 2014.
  4. T.Sujitha, V.Saravanakumar, C.Saravanabhavan, “An Efficient Cryptographic approach For Preserving Privacy In Data Mining”, International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October-2013.
  5. ZahidPervaiz, ArifGhafoor, and Walid G. Aref , “Precision bounded access control for privacy preserving data stream”, CERIAS Tech Report 2013-7.
  6. Alaa H Al-Hamami, and Suhad Abu Shehab, “An Approach for Preserving Privacy and Knowledge In Data Mining Applications”, Journal of Emerging Trends in Computing and Information Sciences, Vol. 4, No. 1 Jan 2013.
  7. N.Punitha, R.Amsaveni, “Methods and Techniques to Protect the Privacy Information in Privacy Preservation Data Mining” IJCTA | NOV-DEC 2011.
  8. S. Chaudhuri, R. Kaushik, and R. Ramamurthy, “Database Access Control & Privacy: Is There a Common Ground?” Proc. Fifth Biennial Conf. Innovative Data Systems Research (CIDR), pp. 96-103, 2011.
  9. Gabriel Ghinita, PanosKalnis and Yufei Tao,” Anonymous Publication of Sensitive Transactional Data”, IEEE Transactions on Knowledge and Data Engineering, vol. 23, Issue.2,pp.161-174,2011.
  10. N. Li, W. Qardaji, and D. Su, “Provably Private Data Anonymization: Or, k-Anonymity Meets Differential Privacy,” Arxiv preprint arXiv:1101.2604, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Privacy Task-role based access control Encryption k-Anonymity l-Diversity Security Relational data.