Efficient Multiparty Computations Secure Against an Adaptive Adversary
暂无分享,去创建一个
Ivan Damgård | Ronald Cramer | Tal Rabin | Stefan Dziembowski | Martin Hirt | R. Cramer | I. Damgård | Stefan Dziembowski | T. Rabin | M. Hirt
[1] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[2] 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).
[3] Ueli Maurer,et al. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.
[4] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[5] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[6] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[7] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[8] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[9] Donald Beaver,et al. Cryptographic Protocols Provably Secure Against Dynamic Adversaries , 1992, EUROCRYPT.
[10] Silvio Micali,et al. An Optimal Algorithm for Synchronous Byzantine Agreement , 1997 .
[11] Tal Rabin,et al. Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.
[12] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[13] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[14] Adam D. Smith,et al. Multiparty computation unconditionally secure against Q^2 adversary structures , 1999, ArXiv.
[15] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[16] Tal Rabin,et al. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.
[17] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[18] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[19] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.