The Round Complexity of Verifiable Secret Sharing Revisited
暂无分享,去创建一个
[1] Martin Tompa,et al. How to share a secret with cheaters , 1988, Journal of Cryptology.
[2] Cynthia Dwork,et al. Strong Verifiable Secret Sharing (Extended Abstract) , 1991, WDAG.
[3] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[4] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[5] Jonathan Katz,et al. Improving the round complexity of VSS in point-to-point networks , 2008, Inf. Comput..
[6] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[7] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[8] Keith B. Frikken. Secure multiparty computation , 2010 .
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] Kannan Balasubramanian,et al. Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.
[11] K. Srinathan,et al. Round-Optimal and Efficient Verifiable Secret Sharing , 2006, TCC.
[12] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[13] Ivan Damgård,et al. On the complexity of verifiable secret sharing and multiparty computation , 2000, STOC '00.
[14] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[15] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[16] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[17] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[18] Adi Shamir,et al. How to share a secret , 1979, CACM.
[19] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[20] Tal Rabin,et al. Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.