Providing Privacy For Sensitive Data In Relational Database With Imprecision Bounds
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2015, Vol 4, Issue 9
Abstract
The perception of privacy-preservation for receptive data can necessitate the enforcement of privacy policies or the fortification against uniqueness revelation by rewarding some privacy requirements. In this paper we inspect privacypreservation from the obscurity aspect. The sensitive information even later than the exclusion of identifying attributes is still disposed to linking attacks by the approved users. This predicament has been considered expansively in the area of micro data publishing and solitude definitions e.g., k-anonymity, l-diversity and variance diversity. Anonymization algorithms use repression and sweeping statement of records to please solitude needs with minimal bend of micro data. The secrecy methods can be used with an access control mechanism to make sure both safety and solitude of the sensitive information. The seclusion is attained at the cost of correctness and vagueness is introduced in the authorized information under an right of entry manage strategy.
Authors and Affiliations
R Pragathi, G Kalyan Chakravarthy
Defence Consideration of Strategy Classifiers under Assault
Pattern arrangement of action structures are for the most part used as a piece of hostile applications, as biometric affirmation, framework intrusion area, and spam isolating, in which data can be purposely controlle...
ECG Noise Reduction By Different Filters – A Comparative Analysis
The electrocardiogram (ECG or EKG) is a diagnostic tool that measures and records the electrical activity of the heart in exquisite detail. The electrocardiogram is commonly used to detect abnormal heart rhythms and...
Efficient Current Mode Multipliers in Signal Processing
This paper explains about the operation of the current mode multiplier circuits in signal processing. The multiplier/divider presents the advantage of very small linearity errors that can be obtained as a result of t...
Monte-Carlo simulation of a 10T Full adder for propagation delay optimizations
Monte Carlo analysis generates random variations in parameter values by drawing them probabilistically from a defined distribution. Monte Carlo simulations were performed for full adders to find out the reliability a...
Ensuring Data Storage Security in a Cloud Computing Using ‘MONA’
Due to the frequent change of the membership, sharing data in a multi-owner manner is a major problem in cloud computing. Identity privacy and Privacy preserving from an entrusted cloud is still a challenging issue....