Quantifying the Protection Level of a Noise Candidate for Noise Multiplication Masking Scheme

  • Yue MaEmail author
  • Yan-Xia Lin
  • Pavel N. Krivitsky
  • Bradley Wakefield
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11126)


When multiplicative noises are used to perturb a set of original data, the data provider needs to ensure that the original values are not likely to be learned by data intruders from the noise-multiplied data. Different attacking strategies for unveiling the original values have been recognised in the literature, and the data provider needs to ensure that the noise-multiplied data is protected against these attacking strategies by selecting an appropriate noise generating variable. However, there are many potential attacking strategies, which makes the quantification of the protection level of a noise candidate difficult. In this paper, we argue that, to quantify the protection level a noise candidate offers to the original data against an attacking strategy, the data provider might look at the average value disclosure risk it produces. Correspondingly, we propose an optimal estimator which maximizes the average value disclosure risk. As a result, the data provider could use the maximized average value disclosure risk as a single measure for quantifying the protection level a noise candidate offers to the original data. The measure could help the data provider with the process of noise generating variable selection in practice.


Multiplicative noise masking Value disclosure risk Attacking strategy Statistical disclosure control 



We thank the anonymous reviewers for their constructive comments on the paper. This research has been conducted with the support of the Australian Government Research Training Program Scholarship.


  1. Agrawal, R., Aggarwal, C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th Symposium on Principles of Database Systems, Santa Barbara, California, USA (2001)Google Scholar
  2. Agrawal, R., Srikant, R.: Privacy preserving data mining. In: Proceedings of the ACM SIGMOD, pp. 439–450 (2000)Google Scholar
  3. Bickel, P.J., Ritov, Y.: Nonparametric estimators which can be “plugged-in”. Ann. Stat. 31(4), 1033–1053 (2003)MathSciNetCrossRefGoogle Scholar
  4. Burridge, J.: Information presrving statistical obfuscation. Stat. Comput. 13, 321–327 (2003)MathSciNetCrossRefGoogle Scholar
  5. Chipperfield, J., Newman, J., Thompson, G., Ma, Y., Lin, Y.X.: Prospects for protecting aggregate business microdata via a remote server. J. Off. Stat. (Major Revision) (2018)Google Scholar
  6. Domingo-Ferrer, J., Torra, V.: Disclosure protection methods and information loss for microdata. In: Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, pp. 91–110 (2001)Google Scholar
  7. Fuller, W.A.: Masking procedures for microdata disclosure limitation. J. Off. Stat. 9, 383–406 (1993)Google Scholar
  8. Kim, J., Jeong, D.M.: Truncated triangular distribution for multiplicative noise and domain estimation. In: Section on Government Statistics-JSM 2008, pp. 1023–1030 (2008)Google Scholar
  9. Klein, M., Mathew, T., Sinha, B.: Noise multiplication for statistical disclosure control of extreme values in log-normal regression samples. J. Priv. Confid. 6, 77–125 (2014)Google Scholar
  10. Lin, Y.-X.: Density Approximant based on noise multiplied data. In: Domingo-Ferrer, J. (ed.) PSD 2014. LNCS, vol. 8744, pp. 89–104. Springer, Cham (2014). Scholar
  11. Lin, Y.X., Fielding, M.J.: MaskDensity14: a R package for the density approximant of a univariate based on noise multiplied data. SoftwareX 3–4, 37–43 (2015)CrossRefGoogle Scholar
  12. Lin, Y.X., Wise, P.: Estimation of regression paremeters from noise multiplied data. J. Priv. Confid. 4, 61–94 (2012)Google Scholar
  13. Ma, Y., Lin, Y.X., Sarathy, R.: The vulnerability of multiplicative noise protection to correlation-attacks on continuous microdata. Sankhya B (Major Revision) (2018)Google Scholar
  14. Melville, N., McQuaid, M.: Research note-generating shareable statistical databases for business value: multiple imputation with multimodal perturbation. Inf. Syst. Res. 23(2), 559–574 (2012)CrossRefGoogle Scholar
  15. Muralidhar, K., Sarathy, R.: Data shuffling - a new masking approach for numerical data. Manag. Sci. 52, 658–670 (2006)CrossRefGoogle Scholar
  16. Nayak, T.K., Sinha, B., Zayatz, L.: Statistical properties of multiplicative noise masking for confidentiality protection. J. Off. Stat. 27(3), 527–544 (2011)Google Scholar
  17. Oganian, A.: Multiplicative noise for masking numerical microdata with constraints. SORT Special Issue: Priv. Stat. Database 99–112 (2011)Google Scholar
  18. Ruiz, N.: A multiplicative masking method for preserving the skewness of the original micro-records. J. Off. Stat. 28, 107–120 (2011)Google Scholar
  19. Shlomo, N.: Releasing microdata: disclosure risk estimation, data masking and assessing utility. J. Priv. Confid. 2(1), 73–91 (2010)Google Scholar
  20. Sinha, B., Nayak, T.K., Zayatz, L.: Privacy protection and quantile estimation from noise multiplied data. Sankhya B 73(2), 297–315 (2011)MathSciNetCrossRefGoogle Scholar
  21. Snoke, J., Raab, G.M., Nowok, B., Dibben, C., Slavković, A.: General and specific utility for synthetic data. J. Roy. Stat. Soc. Ser. A: Stat. Soc. 181, Part 3, 663–688 (2018)Google Scholar
  22. Yancey, W.E., Winkler, W.E., Creecy, R.H.: Disclosure risk assessment in perturbative microdata protection. In: Domingo-Ferrer, J. (ed.) Inference Control in Statistical Databases. LNCS, vol. 2316, pp. 135–152. Springer, Heidelberg (2002). Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Yue Ma
    • 1
    Email author
  • Yan-Xia Lin
    • 1
  • Pavel N. Krivitsky
    • 1
  • Bradley Wakefield
    • 1
  1. 1.National Institute for Applied Statistics Research Australia, School of Mathematics and Applied StatisticsUniversity of WollongongWollongongAustralia

Personalised recommendations