Multiparty Computation from Threshold Homomorphic Encryption
作者： Ronald Cramer , Ivan Damgård , Jesper B. Nielsen
关键词:
摘要: We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. show that given keys for any sufficiently efficient system of this type, general MPC protocols n parties can be devised which are secure against an active adversary corrupts minority the parties. The total number bits broadcast is O(nk|C|), where k security parameter and |C| size (Boolean) circuit computing function securely evaluated. An earlier proposal by Franklin Haber with same complexity was only passive adversaries, while all had at least quadratic in n. give two examples cryptosystems support our construction lead claimed complexities.
springer.com
utdallas.edu 
acm.org 
utd.edu 
core.ac.uk 参考文章(30)
David Chaum, Claude Crépeau, Ivan Damgård, Multiparty Unconditionally Secure Protocols (Extended Abstract) symposium on the theory of computing. pp. 11- 19 ,(1988)
Avi Wigderson, Shafi Goldwasser, Michael Ben-Or, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) symposium on the theory of computing. pp. 1- 10 ,(1988)
Oded Goldreich, Ronen Vainish, How to Solve any Protocol Problem - An Efficiency Improvement international cryptology conference. pp. 73- 86 ,(1987)
Silvio Micali, Phillip Rogaway, Secure Computation (Abstract) international cryptology conference. pp. 392- 404 ,(1991)
Markus Jakobsson, Ari Juels, Mix and Match: Secure Function Evaluation via Ciphertexts international conference on the theory and application of cryptology and information security. pp. 162- 177 ,(2000) , 10.1007/3-540-44448-3_13
Michael George Luby, None, Pseudorandomness and Cryptographic Applications ,(1996)
Pierre-Alain Fouque, Guillaume Poupard, Jacques Stern, Sharing Decryption in the Context of Voting or Lotteries financial cryptography. pp. 90- 104 ,(2000) , 10.1007/3-540-45472-1_7
Ivan Damgård, Mads Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System public key cryptography. pp. 119- 136 ,(2001) , 10.1007/3-540-44586-2_9
Ronald Cramer, Ivan Damgård, Ueli Maurer, General secure multi-party computation from any linear secret-sharing scheme theory and application of cryptographic techniques. ,vol. 2000, pp. 316- 334 ,(2000) , 10.1007/3-540-45539-6_22
Ronald Cramer, Ivan Damgård, Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? international cryptology conference. pp. 424- 441 ,(1998) , 10.1007/BFB0055745