A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
暂无分享,去创建一个
[1] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[2] Joe Kilian,et al. A general completeness theorem for two party games , 1991, STOC '91.
[3] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[4] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[5] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[6] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[7] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[8] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[9] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[10] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[11] S. Rajsbaum. Foundations of Cryptography , 2014 .
[12] Yehuda Lindell,et al. Complete Fairness in Secure Two-Party Computation , 2011, JACM.
[13] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.