Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
暂无分享,去创建一个
[1] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[2] Ivan Damgård,et al. Efficient and Secure Comparison for On-Line Auctions , 2007, ACISP.
[3] Yuval Ishai,et al. Secure Arithmetic Computation with No Honest Majority , 2008, IACR Cryptol. ePrint Arch..
[4] Yehuda Lindell,et al. Complete Fairness in Secure Two-Party Computation , 2011, JACM.
[5] I. Damglurd. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation , 2006 .
[6] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[7] Tatsuaki Okamoto,et al. A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.
[8] Yehuda Lindell,et al. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries , 2008, SCN.
[9] R. Cramer,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000 .
[10] Juan A. Garay,et al. Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness , 2004, IACR Cryptol. ePrint Arch..
[11] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? , 1998, CRYPTO.
[12] Jan Camenisch,et al. Optimistic Fair Secure Computation , 2000, CRYPTO.
[13] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[14] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[15] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[16] Rafael Pass,et al. A unified framework for concurrent security: universal composability from stand-alone non-malleability , 2009, STOC '09.
[17] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[18] Claudio Orlandi. LEGO and Other Cryptographic Constructions , 2009 .
[19] Ivan Damgård,et al. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption , 2003, CRYPTO.
[20] Ivan Damgård,et al. A correction to 'efficient and secure comparison for on-line auctions' , 2009, Int. J. Appl. Cryptogr..
[21] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.
[22] Andrew Y. Lindell. Legally-Enforceable Fairness in Secure Two-Party Computation , 2008, CT-RSA.
[23] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[24] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[25] Marc X. Makkes,et al. Efficient Implementation of the Orlandi Protocol , 2010, ACNS.
[26] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[27] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[28] Claudio Orlandi,et al. LEGO for Two-Party Secure Computation , 2009, TCC.
[29] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[30] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? , 1997 .
[31] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[32] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[33] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[34] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[35] Jonathan Katz,et al. Complete Fairness in Multi-Party Computation Without an Honest Majority , 2009, IACR Cryptol. ePrint Arch..
[36] Ivan Damgård,et al. On the Necessary and Sufficient Assumptions for UC Computation , 2010, TCC.