Providing Privacy For Sensitive Data In Relational Database With Imprecision Bounds

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

Keywords

Related Articles

Intelligent Encoding of Packets Against Jamming Attacks in Wireless Network

Wireless network never has certain limited boundaries that can’t be extended due to this nature security flaws may get developed. When someone breaks into wireless network system that person takes advantage of lapses...

Comparative Study of Fractional Order Derivative Based Image Enhancement Techniques

In this paper, image enhancement based on fractional gradient is proposed. The Taylor’s Series is used to obtain a generalized expression for this Fractional order derivative. The Image is differentiated in both x and...

Comparison of EEA3 and EEA1 Algorithms in Terms of Encryption Time and Throughput

EEA3 (Evolved Packet System Encryption Algorithm 3) and EEA1 (Evolved Packet System Encryption Algorithm 1) are confidentiality algorithms that are used to en/decrypt blocks of data. In this paper we present the enc...

Wavelet Based Dual Encoding Lossless Medical Image Compression

Medical image compression using dual encoding scheme which helps in lossless image compression and wavelet helps in increasing the sparsity of the image. Dual encoding scheme comprised with Run length Coding and 8X8...

Augmentation of very fast decision tree algorithm aimed at data mining

The reason for information order is to build a grouping model. The choice tree calculation is a more broad information characterization capacity estimate calculation taking into account machine learning. The choice t...

Download PDF file
  • EP ID EP28247
  • DOI -
  • Views 295
  • Downloads 3

How To Cite

R Pragathi, G Kalyan Chakravarthy (2015). Providing Privacy For Sensitive Data In Relational Database With Imprecision Bounds. International Journal of Research in Computer and Communication Technology, 4(9), -. https://europub.co.uk/articles/-A-28247