Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary


Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

An Effective Supermodularity Based Approach for Data Privacy at Storage Level

Annamneni Soujanya, Baburao Kopuri, , ,
Affiliations
M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Associate Professor, Department of Computer Science & Engineering, NRI Institute of Technology.
:NOT ASSIGNED


Abstract
In this paper we presented a supermodulaity based approach for data privacy using noval encryption mechanisum in this conncetion the seviority of data privacy at storage level is most considerable so in our presented system lack of data privacy , scalability due to low security algorithm while data transformation so in our proposed system Scalability and privacy risk of data anonymization can be addressed by using differential privacy. Differential privacy provides a theoretical formulation for privacy. A scalable algorithm is use to find the differential privacy when applying specific random sampling. The risk function can be employ through the supermodularity properties.


Citation
Annamneni Soujanya,Baburao Kopuri."An Effective Supermodularity Based Approach for Data Privacy at Storage Level ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1240-1244, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1279.pdf,


Keywords : Supermodularity, Differential privacy, Scalability, privacy.

References
[1] Mohamed R. Fouad, Khaled Elbassioni, ―A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization‖, IEEE transaction on
Knowledge and Data Engineering July 2014.
[2] M. R. Fouad, K. Elbassioni, and E. Bertino, ―Towards
a differentially private data anonymization,‖ Purdue
Univ., West Lafayette, IN, USA, Tech. Rep. CERIAS
2012-1, 2012.
[3] N. Mohammed, R. Chen, B. C. Fung, and P. S. Yu,
―Differentially prívate data release for data mining,‖ in
Proc. 17th ACM SIGKDD,New York,NY, USA, 2011, pp.
493–501.
[4] M. R. Fouad, G. Lebanon, and E. Bertino, ―ARUBA:
A risk-utility based algorithm for data disclosure,‖ in
Proc. VLDB Workshop SDM, Auckland, New Zealand,
2008, pp. 32–49.
[5] K. M. Elbassioni, ―Algorithms for dualization over
products of partially ordered sets,‖ SIAM J. Discrete
Math., vol. 23, no. 1,pp. 487–510, 2009.
[6] C. Dwork, ―Differential privacy: A survey of results,‖ in Proc. Int.Conf. TAMC, Xiˇ San, China, 2008,
pp. 1–19.
[7] G. Lebanon, M. Scannapieco, M. R. Fouad, and E.
Bertino,―Beyond kanonymity:A decision theoretic
framework for assessing Privacy risk,‖ in Privacy in Statistical Databases. Springer LNCS 4302:217U 232, 2006.
[8] C. Dwork, ―Differential privacy,‖ in Proc. ICALP,
Venice, Italy,2006, pp.1–12.
[9] C. C. Aggarwal, ―On k-anonymity and the curse of
dimensionality,‖in Proc. Int. Conf. VLDB, Trondheim,
Norway, 2005,pp. 901–909.
[10] C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov,
and M. Naor,―Our data, ourselves: Privacy via distributed noise generation,‖in Proc. 25th EUROCRYPT,
Berlin, Germany, 2006, pp. 486–503,LNCS 4004.
[11] A. Frieze, R. Kannan, and N. Polson, ―Sampling
from log-concave distributions,‖ Ann. Appl. Probab.,
vol. 4, no. 3, pp. 812–837, 1994.
[12] B. C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.
[13] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis,
―Fast data anonymization with low information loss,‖ in
Proc. Int. Conf.VLDB, Vienna, Austria, 2007, pp. 758–
769.
[14] G. A. Gratzer, General Lattice Theory, 2nd ed. Basel, Switzerland:Birkh¨auser, 2003.
[15] M. Grotschel, L. Lovasz, and A. Schrijver, ―Geometric algorithms and combinatorial optimization,‖ in Algorithms and Combinatorics, vol. 2, 2nd ed. Berlin,
Germany: Springer, 1993.
[16] J. Cao, P. Karras, P. Kalnis, and K.-L. Tan, ―SABRE:
A sensitive attribute bucketization and redistribution
framework for t-closeness,‖ J. VLDB, vol. 20, no. 1, pp.
59–81, 2011.
[17] C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.


DOI Link : NOT ASSIGNED

Download :
  V2I1279.pdf


Refbacks : Currently there are no Refbacks

Announcements


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events


Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.


Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.


IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert


IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)


Emerging Sources Citation Index (in process)


IJCERT title is under evaluation by Scopus.


Key Dates


☞   INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞   LAST DATE OF SUBMISSION : 31st March 2023
☞  SUBMISSION TO FIRST DECISION :
In 7 Days
☞  FINAL DECISION :
IN 3 WEEKS FROM THE DAY OF SUBMISSION

Important Announcements


All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index


Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)


Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links



Conference Proposal




DOI:10.22362/ijcert