An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions


The KIPS Transactions:PartC, Vol. 16, No. 5, pp. 563-574, Oct. 2009
10.3745/KIPSTC.2009.16.5.563,   PDF Download:

Abstract

The merits of random substitutions are various applicability and security guarantee on the view point of privacy breach. However there is no research to improve the accuracy of random substitutions. In this paper we propose an algorithm for improving the accuracy of random substitutions by an advanced theoretical analysis about the standard errors. We examine that random substitutions have an unpractical accuracy level and our improved algorithm meets the theoretical results by some experiments for data sets having uniform and normal distributions. By our proposed algorithm, it is possible to upgrade the accuracy level under the same security level as the original method. The additional cost of computation for our algorithm is still acceptable and practical.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kang, C. W. Lee, D. W. Hong, "An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions," The KIPS Transactions:PartC, vol. 16, no. 5, pp. 563-574, 2009. DOI: 10.3745/KIPSTC.2009.16.5.563.

[ACM Style]
Ju Sung Kang, Chang Woo Lee, and Do Won Hong. 2009. An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions. The KIPS Transactions:PartC, 16, 5, (2009), 563-574. DOI: 10.3745/KIPSTC.2009.16.5.563.