Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary




Welcome to IJCERT

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

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

Back to Current Issues

Privacy Preserving Transitional Data Set Using Heuristic Approach

K.SANDHYA, K.SUMALATHA, , ,
Affiliations
M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
Assistant Professor, Priyadarshini Institute of Technology and Science for Women
:NOT ASSIGNED


Abstract
In this paper, we propose a upper-bound privacy leakage constraint based approach to identify which intermediate datasets need to be encrypted and which do not, so that privacy preserving cost can be saved while the privacy requirements of data holders can still be satisfied. To identify and encrypt all functionally encrypt able data, sensitive data that can be encrypted without limiting the functionality of the application on the cloud. However, preserving the privacy of intermediate datasets becomes a challenging problem because adversaries may recover privacy-sensitive information by analyzing multiple intermediate datasets. Encrypting all datasets in cloud is widely adopted in existing approaches to address this challenge. But we argue that encrypting all intermediate datasets are neither efficient nor cost-effective because it is very time consuming and costly for data-intensive applications to encrypt/decrypt datasets frequently while performing any operation on them.


Citation
K.SANDHYA,K.SUMALATHA."Privacy Preserving Transitional Data Set Using Heuristic Approach". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.447-452, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I615.pdf,


Keywords : Data Storage Privacy, Encryption and Decryption, Privacy Preserving, Intermediate Dataset, Privacy Upper Bound, Economics of scale.

References
[1] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz,
A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica,
and M.
Zaharia, “A View of Cloud Computing,” Comm. ACM,
vol. 53,no. 4, pp. 50-58, 2010.
[2] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I.
Brandic, “Cloud Computing and Emerging It Platforms:
Vision, Hype, and Reality for Delivering Computing as
the Fifth Utility,” Future Generation Computer Systems,
vol. 25, no. 6, pp. 599-616, 2009.
[3] L. Wang, J. Zhan, W. Shi, and Y. Liang, “In Cloud,
Can Scientific Communities Benefit from the Economies
of Scale?,” IEEE Trans. Parallel and Distributed Systems,
vol. 23, no. 2, pp. 296-303, Feb.
2012.
[4] H. Takabi, J.B.D. Joshi, and G. Ahn, “Security and
Privacy Challenges in Cloud Computing Environments,”
IEEE Security
& Privacy, vol. 8, no. 6, pp. 24-31, Nov./Dec. 2010.
[5] D. Zissis and D. Lekkas, “Addressing Cloud
Computing Security Issues,” Future Generation
Computer Systems, vol. 28, no. 3, pp. 583-592, 2011.
[6] D. Yuan, Y. Yang, X. Liu, and J. Chen, “On-Demand
Minimum Cost Benchmarking for Intermediate Data Set
Storage in Scientific Cloud Workflow Systems,” J. Parallel
Distributed Computing, vol. 71, no. 2, pp. 316-332, 2011.
[7] S.Y. Ko, I. Hoque, B. Cho, and I. Gupta, “Making
Cloud Intermediate Data Fault-Tolerant,” Proc. First
ACM Symp. Cloud
Computing (SoCC ’10), pp. 181-192, 2010.
[8] H. Lin and W. Tzeng, “A Secure Erasure Code-Based
Cloud Storage System with Secure Data Forwarding,”
IEEE Trans.
Parallel and Distributed Systems, vol. 23, no. 6, pp. 995-
1003, June 2012.
[9] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “PrivacyPreserving Multi-Keyword Ranked Search over
Encrypted Cloud Data,” Proc.IEEE INFOCOM ’11, pp.
829-837, 2011.
[10] M. Li, S. Yu, N. Cao, and W. Lou, “Authorized
Private Keyword
Search over Encrypted Data in Cloud Computing,” Proc.
31st Int’l Conf. Distributed Computing Systems (ICDCS
’11), pp. 383-392, 2011.
[11] C. Gentry, “Fully Homomorphic Encryption Using
Ideal Lattices,”
Proc. 41st Ann. ACM Symp. Theory of Computing (STOC
’09), pp. 169-178, 2009.
[12] B.C.M. Fung, K. Wang, and P.S. Yu, “Anonymizing
Classification
Data for Privacy Preservation,” IEEE Trans. Knowledge
and Data Eng., vol. 19, no. 5, pp. 711-725, May 2007.
[13] B.C.M. Fung, K. Wang, R. Chen, and P.S. Yu,
“Privacy-Preserving Data Publishing: A Survey of Recent
Developments,” ACM Computing Survey, vol. 42, no. 4,
pp. 1-53, 2010.
[14] X. Zhang, C. Liu, J. Chen, and W. Dou, “An UpperBound Control Approach for Cost-Effective Privacy
Protection of Intermediate Data Set Storage in Cloud,”
Proc. Ninth IEEE Int’l Conf. Dependable,
Autonomic and Secure Computing (DASC ’11), pp. 518-
525, 2011.
[15] I. Roy, S.T.V. Setty, A. Kilzer, V. Shmatikov, and E.
Witchel, “Airavat: Security and Privacy for Mapreduce,”
Proc. Seventh USENIX Conf. Networked Systems Design
and Implementation (NSDI’10), p. 20, 2010.
[16] K.P.N. Puttaswamy, C. Kruegel, and B.Y. Zhao,
“Silverline:Toward Data Confidentiality in StorageIntensive Cloud Applications,” Proc. Second ACM Symp.
Cloud Computing (SoCC ’11), 2011.
[17] K. Zhang, X. Zhou, Y. Chen, X. Wang, and Y. Ruan,
“Sedic:Privacy-Aware Data Intensive Computing on
Hybrid Clouds,”
Proc. 18th ACM Conf. Computer and Comm. Security
(CCS ’11),pp. 515-526, 2011.
[18] V. Ciriani, S.D.C.D. Vimercati, S. Foresti, S. Jajodia, S.
Paraboschi, and P. Samarati, “Combining Fragmentation
and Encryption to Protect Privacy in Data Storage,” ACM
Trans. Information and
System Security, vol. 13, no. 3, pp. 1-33, 2010.
[19] S.B. Davidson, S. Khanna, T. Milo, D. Panigrahi, and
S. Roy, “Provenance Views for Module Privacy,” Proc.
30th ACM
SIGMOD-SIGACT-SIGART Symp. Principles of Database
Systems (PODS ’11), pp. 175-186, 2011.
[20] S.B. Davidson, S. Khanna, S. Roy, J. Stoyanovich, V.
Tannen, and Y. Chen, “On Provenance and Privacy,”
Proc. 14th Int’l Conf. Database Theory, pp. 3-10, 2011.
[21] S.B. Davidson, S. Khanna, V. Tannen, S. Roy, Y.
Chen, T. Milo, and J.Stoyanovich, “Enabling Privacy in
Provenance-Aware Workflow Systems,” Proc. Fifth
Biennial Conf. Innovative Data Systems Research (CIDR
’11), pp. 215-218, 2011.
[22] P. Samarati, “Protecting Respondents’ Identities in
Microdata Release,” IEEE Trans. Knowledge and Data
Eng., vol. 13, no. 6, pp. 1010-1027, Nov. 2001.
[23] A. Machanavajjhala, D. Kifer, J.ehrke, and M.
Venkitasubramaniam, “L-Diversity: Privacy Beyond KAnonymity,” ACM Trans. Knowledge Discovery from
Data, vol. 1, no. 1, article 3, 2007.
[24] G. Wang, Z. Zutao, D. Wenliang, and T. Zhouxuan,
“Inference Analysis in Privacy-Preserving Data RePublishing,” Proc. Eighth IEEE Int’l Conf. Data Mining
(ICDM ’08), pp. 1079-1084, 2008.
[25] W. Du, Z. Teng, and Z. Zhu, “Privacy-Maxent:
Integrating Background Knowledge in Privacy
Quantification,” Proc. ACM
SIGMOD Int’l Conf. Management of Data (SIGMOD ’08),
pp. 459-472, 2008.
[26] E.T. Jaynes, “Information Theory and Statistical
Mechanics,”Physical Rev., vol. 106, no. 4, pp. 620-630,
1957.
[27] Microsoft HealthVault,
http://www.microsoft.com/health/ww/
products/Pages/healthvault.aspx, July 2012.
[28] K.-K. Muniswamy-Reddy, P. Macko, and M. Seltzer,
“Provenance for the Cloud,” Proc. Eighth USENIX Conf.
File and Storage Technologies (FAST ’10), pp. 197-210,
2010.
[29] Amazon Web Services, “Aws Service Pricing
Overview,” http://aws.amazon.com/pricing/, July 2012.
[30] KVM, http://www.linux-kvm.org/page/Main_Page,
July 2012.
[31] OpenStack, http://openstack.org/, July 2012.
[32] Hadoop, http://hadoop.apache.org, June 2012.


DOI Link : NOT ASSIGNED

Download :
  V1I615.pdf


Refbacks : Currently there are no Refbacks

Support Us


We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to editorijcert@gmail.com