A Technique to improve Security of Data in Multilevel Trust
Journal Title: Indian Journal of Computer Science and Engineering - Year 2014, Vol 5, Issue 2
Abstract
The Privacy Preserving Data Mining technique that is used widely to conserve security of data is a random perturbation method. The original data is modified and many copies are created according to the trust levels in each field. The addition of noise level also varies with each trust level. The amount of noise added to the lower order trust level is less, whereas it is high in the higher order trust level. There is a chance for the hackers to reconstruct the original data with some non linear techniques. This challenge is addressed by the proposal of a novel non linear technique. Here, the noise level of each copy is checked after perturbation of the actual data. If any similarity is found in the noise level, reconstruction of the original data is possible. Therefore, additional noise is included in the perturbed data. This process is repeated till zero percent of similarity of data is attained.
Authors and Affiliations
A. Viji Amutha Mary , Dr. T. Jebarajan
Keywords
Related Articles
- EP ID EP110608
- DOI -
- Views 144
- Downloads 0
Survey on Privacy Preservation in contextaware web services
Context awareness is a property of mobile devices that is defined complementarily to location awareness where as location may determine how certain processes in a device operates, context may be applied more flexibly wit...
ADAPTING RULE BASED MACHINE TRANSLATION FROM ENGLISH TO BANGLA
This paper presents the adapting rule based machine translation from English to Bangla. The proposed language translation model relies on rule based methodologies especially fuzzy rules. There are “If - Then” basis rules...
Performance Evaluation of Internet Routing Protocols in Wireless Mesh Networks
Wireless Mesh Networks are considered as a feasible solution for transformation into next generation wireless network to offer Internet services for large variety of applications. These types of networks are used for pro...
Visual Query in Temporal Database with Multi Dimensions
A wide range of database applications manage time-varying data. In contrast, existing database technology provides little support for managing such data. The research area of temporal databases aims to change this state...
A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST
Tree is a best data structure for data storage and retrieval of data whenever it could be accommodated in the memory. At the same time, this is true only when the tree is height-balanced and lesser depth from the root. I...