Basic constructions of secure multiparty computation

被引：2
作者：
Laud, Peeter [1 ]
Pankova, Alisa [1 ]
Kamm, Liina [1 ]
Veeningen, Meilof [2 ]
机构：
[1] Cybernetica AS, Estonia
[2] Eindhoven University of Technology, Netherlands
来源：
Cryptology and Information Security Series | 2015年 / 13卷
关键词：
D O I：
10.3233/978-1-61499-532-6-1
中图分类号：
学科分类号：
摘要：
In this chapter, we formally define multiparty computation tasks and the security of protocols realizing them. We give a broad presentation of the existing constructions of secure multiparty computation (SMC) protocols and explain why they are correct and secure. We discuss the different environmental aspects of SMC protocols and explain the requirements that are necessary and sufficient for their existence. © 2015 The authors and IOS Press.
引用
收藏
页码：1 / 25
页数：24
相关论文
共 55 条
[41]  
Feigenbaum J., Pinkas B., Ryger R., Saint-Jean F., Secure computation of surveys, EU Workshop on Secure Multiparty Protocols, (2004)
[42]  
Bogdanov D., Talviste R., Willemson J., Deploying secure multi-party computation for financial data analysis - (short paper, Financial Cryptography, 7397, pp. 57-64, (2012)
[43]  
Perry J., Gupta D., Feigenbaum J., Wright R.N., Systematizing secure computation for research, and decision support, Security, and Cryptography for Networks - 9th International Conference, 8642, pp. 380-397, (2014)
[44]  
Blum M., Feldman P., Micali S., Non-interactive zero-knowledge, and its applications, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 103-112, (1988)
[45]  
Galil Z., Haber S., Yung M., Cryptographic computation: Secure fault-tolerant protocols, and the public-key model (extended abstract, Advances in Cryptology - CRYPTO '87, 293, pp. 135-155, (1988)
[46]  
Aumann Y., Lindell Y., Security against covert adversaries: Efficient protocols for realistic adversaries, J. Cryptology, 23, 2, pp. 281-343, (2010)
[47]  
Ben-Or M., Goldwasser S., Wigderson A., Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract, Simon, 54, pp. 1-10
[48]  
Fitzi M., Hirt M., Maurer U., Trading correctness for privacy in unconditional multiparty computation, Advances in Cryptology - CRYPTO '98, 1462, pp. 121-136, (1998)
[49]  
Cleve R., Limits on the security of coin flips when half the processors are faulty, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC '86, pp. 364-369, (1986)
[50]  
Rabin T., Ben-Or M., Verifiable secret sharing, and multiparty protocols with honest majority (extended abstract, Johnson, 52, pp. 73-85
123456