On achieving the "best of both worlds" in secure multiparty computation
暂无分享,去创建一个
[1] Matthias Fitzi,et al. Two-Threshold Broadcast and Detectable Multi-party Computation , 2003, EUROCRYPT.
[2] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[3] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[4] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[5] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[6] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[7] Yehuda Lindell,et al. Secure Multi-Party Computation without Agreement , 2005, Journal of Cryptology.
[8] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, Journal of Cryptology.
[9] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, TCC.
[10] Benny Pinkas,et al. Fair Secure Two-Party Computation , 2003, EUROCRYPT.
[11] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[12] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[13] A W Myres. Achieving the best of both worlds. , 1988, CMAJ : Canadian Medical Association journal = journal de l'Association medicale canadienne.
[14] Matthias Fitzi,et al. Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) , 1998, CRYPTO.
[15] Ran Canetti,et al. Security and composition of cryptographic protocols: a tutorial (part I) , 2006, SIGA.
[16] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[17] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[18] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[20] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[21] Donald Beaver,et al. Multiparty computation with faulty majority , 1989, 30th Annual Symposium on Foundations of Computer Science.
[22] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[23] Silvio Micali,et al. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[24] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[25] Adi Shamir,et al. How to share a secret , 1979, CACM.
[26] Matthias Fitzi,et al. Multi-party Computation with Hybrid Security , 2004, EUROCRYPT.
[27] Jonathan Katz,et al. Complete Fairness in Multi-Party Computation Without an Honest Majority , 2009, IACR Cryptol. ePrint Arch..
[28] Moni Naor,et al. Timed Commitments , 2000, CRYPTO.
[29] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[30] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[31] Richard Cleve,et al. Controlled Gradual Disclosure Schemes for Random Bits and Their Applications , 1989, CRYPTO.
[32] Yehuda Lindell,et al. On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation , 2006, CRYPTO.
[33] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[34] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[35] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.