On Achieving the "Best of Both Worlds" in Secure Multiparty Computation
暂无分享,去创建一个
[1] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[2] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[3] Yehuda Lindell,et al. Secure Multi-Party Computation without Agreement , 2005, Journal of Cryptology.
[4] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[5] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[6] Jonathan Katz,et al. Partial Fairness in Secure Two-Party Computation , 2010, Journal of Cryptology.
[7] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, TCC.
[8] Jonathan Katz. On achieving the "best of both worlds" in secure multiparty computation , 2007, STOC '07.
[9] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[10] Ran Canetti,et al. Security and composition of cryptographic protocols: a tutorial (part I) , 2006, SIGA.
[11] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[12] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[13] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[14] Donald Beaver,et al. Multiparty computation with faulty majority , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Yehuda Lindell,et al. On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation , 2006, CRYPTO.
[16] Adi Shamir,et al. How to share a secret , 1979, CACM.
[17] Jonathan Katz,et al. Complete Fairness in Multi-Party Computation Without an Honest Majority , 2009, IACR Cryptol. ePrint Arch..
[18] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.