An Improved Bound for Security in an Identity Disclosure Problem

Debolina Ghatak and Bimal K Roy

International Journal of Statistics and Probability, 2019, vol. 8, issue 3, 24

Abstract: Identity disclosure of an individual from a released data is a matter of concern especially if it belongs to a category with low frequency in the data-set. Nayak et al. (2016) discussed this problem vividly in a census report and suggested a method of obfuscation, which would ensure that the probability of correctly identifying a unit from released data, would not exceed ξ for some1 3< ξ < 1. However, we observe that for the above method the level of security could be extended under certain conditions. In this paper, we discuss some conditions under which one can achieve a security for any 0 < ξ < 1.

Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/ijsp/article/download/0/0/39033/40095 (application/pdf)
http://www.ccsenet.org/journal/index.php/ijsp/article/view/0/39033 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:ijspjl:v:8:y:2019:i:3:p:24

Access Statistics for this article

More articles in International Journal of Statistics and Probability from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().