Protective Speculation Clouds With Valuable Cost
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2015, Vol 4, Issue 10
Abstract
In this paper, we propose Protective Speculation Clouds With Valuable Cost constraint based approach to identify which 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 Access control systems .It will be that as it may, when touchy information's is given and a Protection speculation is not set up, an approved client can even now surrender the protection of a man prompting interesting disclosure. Preserving the protective of the intermediate data sets is a challenging problem because adversaries may recover sensitive information by analyzing multiple intermediate data sets A Protective speculation can utilize concealment and speculation of social information to anonymize and fulfill protection need, e.g., k-secrecy and l-differing qualities. This type of works in any case, security is accomplished at the expense of accuracy of approved information. in existing approaches to address this challenges. But we argue that encrypting all intermediate data sets are neither efficient nor cost-effective because it is very time reducing and costly for data-intensive applications to end decrypt data sets frequently while performing any operation on them In this paper, we propose a so that privacy-preserving cost can be saved while the privacy requirements of data holders can still be satisfied. Evaluation results demonstrate that the privacy-preserving cost of intermed iate data sets can be significantly reduced with our approach over existing once where all data sets are encrypted.
Authors and Affiliations
Maddirala Kaveri, Uppalapati Srilakshmi
Keywords
Related Articles
- EP ID EP28288
- DOI -
- Views 276
- Downloads 3
To Develop an Efficient Approach to NCL Selection In DTNS Based on a Probabilistic Selection Metric
Caching is an additional way to supply data access. Cooperative caching in wireless ad hoc networks was studied in which each node caches pass-by data based on data popularity, so that queries in the potential can be...
Network Processing of PT-TOPK Queries Using Necessary Set Based Algorithm in WSN’s
A wireless sensor Network consists of spatially dispersed self-directed sensors to monitor the environment conditions. This work supports innetwork top-k query process over uncertain data in a distributed wireless sen...
Supportive Accumulation for Proficient Data Approach In Interruption Tolerant Networks
The goal of this is to build up a structural system of social group based agreeable reserving for minimizing electronic substance provisioning cost in Mobile Social Wireless Networks (MSWNET). MSWNETs are framed by r...
Effect of Moderators on Determinants: A Case Study of Technology Acceptance Models
From a few decades, studies has been conducted on various technology acceptance models to predict user acceptance of information technologies. These days various types of tools and information technologies are used i...
A Freight Stabilization Model Based On Cloud Segregating For the Shared Cloud
Cloud computing having tremendous growth on recent years but it is not segregation on shared clouds. Clouds are most provably used for huge amount of data storage and communication. "The cloud", also focuses on incre...