Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
暂无分享,去创建一个
[1] Jeroen van de Graaf,et al. Committed Oblivious Transfer and Private Multi-Party Computation , 1995, CRYPTO.
[2] K ReiterMichael,et al. The Design and Implementation of a Secure Auction Service , 1996 .
[3] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[4] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[5] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[6] Donald Beaver,et al. Foundations of Secure Interactive Computing , 1991, CRYPTO.
[7] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[8] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[9] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[10] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[11] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[12] Moti Yung,et al. Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.
[13] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[14] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[15] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[16] David Chaum,et al. Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.
[17] Moti Yung,et al. How to share a function securely , 1994, STOC '94.
[18] Ran Canetti,et al. Studies in secure multiparty computation and applications , 1995 .
[19] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[20] Matthew K. Franklin,et al. The design and implementation of a secure auction service , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.
[21] Tal Rabin,et al. Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.
[22] Matthew K. Franklin,et al. Multi-Autority Secret-Ballot Elections with Linear Work , 1996, EUROCRYPT.
[23] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[24] Moti Yung,et al. The Varieties of Secure Distributed Computation , 1993 .
[25] David Chaum,et al. The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities , 1989, CRYPTO.
[26] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[27] Matthew Franklin,et al. Complexity and security of distributed protocols , 1994 .
[28] Rosario Gennaro,et al. Theory and practice of verifiable secret sharing , 1996 .
[29] Ran Canetti,et al. Incoercible multiparty computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.