Statistical analysis methods using secure multiparty computation

被引:0
作者
Kamm, Liina [1 ]
Bogdanov, Dan [1 ]
Pankova, Alisa [1 ]
Talviste, Riivo [1 ]
机构
[1] Cybernetica AS, Estonia
关键词
Privacy-preserving statistical analysis; secure multiparty computation; statistical testing;
D O I
10.3233/978-1-61499-532-6-58
中图分类号
学科分类号
摘要
This chapter gives an overview of privacy-preserving versions of the analysis methods and algorithms that are most commonly used in statistical analysis. We discuss methods for data collection and sharing, and describe privacy-preserving database joins and sorting. From simple statistical measures, we discuss the count and sum of elements, quantiles, the five-number summary, frequency tables, mean, variance, covariance and standard deviation. We look into outlier detection and explore privacy-preserving versions of several different statistical tests, such as Student's t-test, Wilcoxon rank-sum and signed-rank tests and the χ2-test. We discuss how to evaluate the significance of the test statistic in the privacy-preserving environment. We give several options for linear regression and conclude the chapter with a privacy-preserving method for data classification. © 2015 The authors and IOS Press.
引用
收藏
页码:58 / 80
页数:22
相关论文
共 23 条
[1]  
Bogdanov D., Sharemind: Programmable Secure Computations with Practical Applications, (2013)
[2]  
Latanya S., K-anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, 10, 5, pp. 557-570, (2002)
[3]  
MacHanavajjhala A., Kifer D., Gehrke J., Venkitasubramaniam M., L-diversity: Privacy beyond k-anonymity, IEEE Transactions on Knowledge Discovery from Data, 1, (2007)
[4]  
Li N., Li T., Venkatasubramanian S., Closeness: A new privacy measure for data publishing, IEEE Transactions on Knowledge, and Data Engineering, 22, 7, pp. 943-956, (2010)
[5]  
Dwork C., Differential privacy, Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming, ICALP'06, 4052, pp. 1-12, (2006)
[6]  
Laur S., Willemson J., Zhang B., Round-efficient oblivious database manipulation, Proceedings of ISC, 2011, pp. 262-277, (2011)
[7]  
Laur S., Talviste R., Willemson J., From oblivious aes to efficient, and secure database join in the multiparty setting, Proceedings of the 11th International Conference on Applied Cryptography, and Network Security, ACNS'13, 7954, pp. 84-101, (2013)
[8]  
Knuth D.E., The Art of Computer Programming, 3, (1998)
[9]  
Bogdanov D., Laur S., Talviste R., A practical analysis of oblivious sorting algorithms for secure multi-party computation, Proceedings of the 19th Nordic Conference on Secure IT Systems, NordSec 2014, 8788, pp. 59-74, (2014)
[10]  
Hoare C.A.R., Algorithm 65: Find, Commun. ACM, 4, 7, pp. 321-322, (1961)