Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers
作者： Taihei Watanabe , Keiichi Iwamura , Kitahiro Kaneda
DOI: 10.1007/978-3-662-45402-2_16
关键词:
摘要: In Shamir’s (k, n)-threshold secret-sharing scheme, a secret is divided into n shares, and the recovered from k shares. When this scheme applied to server system, shares are distributed servers. Therefore, can be restored by collecting case of two secrets, latter over servers such that each consists one share secret. Secrecy addition performed on server. The combined through added secrecy realized using However, multiplication requires result 2k-1 paper, we propose based uses only Through system realize calculation without altering threshold level.
springer.com
sci-hub.se 参考文章(19)
Advances in Cryptology - CRYPTO 2010 Lecture Notes in Computer Science. ,vol. 6223, ,(2010) , 10.1007/978-3-642-14623-7
Charu C. Aggarwal, Philip S. Yu, A General Survey of Privacy-Preserving Data Mining Models and Algorithms Privacy-Preserving Data Mining. pp. 11- 52 ,(2008) , 10.1007/978-0-387-70992-5_2
Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias, Semi-homomorphic encryption and multiparty computation international cryptology conference. pp. 169- 188 ,(2011) , 10.1007/978-3-642-20465-4_11
Ivan Damgård, Claudio Orlandi, Multiparty computation for dishonest majority: from passive to active security at low cost international cryptology conference. ,vol. 2010, pp. 558- 576 ,(2010) , 10.1007/978-3-642-14623-7_30
Donald Beaver, Efficient Multiparty Protocols Using Circuit Randomization international cryptology conference. pp. 420- 432 ,(1991) , 10.1007/3-540-46766-1_34
Ronald Cramer, Ivan Damgård, Jesper B. Nielsen, Multiparty Computation from Threshold Homomorphic Encryption theory and application of cryptographic techniques. pp. 280- 299 ,(2001) , 10.1007/3-540-44987-6_18
Ran Canetti, Security and Composition of Multiparty Cryptographic Protocols Journal of Cryptology. ,vol. 13, pp. 143- 202 ,(2000) , 10.1007/S001459910006
Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation symposium on the theory of computing. pp. 1- 10 ,(1988) , 10.1145/62212.62213
Rosario Gennaro, Michael O. Rabin, Tal Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography principles of distributed computing. pp. 101- 111 ,(1998) , 10.1145/277697.277716
Andrew Chi-Chih Yao, How to generate and exchange secrets 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). pp. 162- 167 ,(1986) , 10.1109/SFCS.1986.25