Secure Multi-Party Computation without Agreement
暂无分享,去创建一个
[1] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[2] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.
[3] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[4] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.
[5] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[6] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[7] Moti Yung,et al. Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.
[8] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[11] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[12] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[13] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[14] Donald Beaver,et al. Multiparty Computation with Faulty Majority , 1989, CRYPTO.
[15] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[16] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[17] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[18] Donald Beaver,et al. Foundations of Secure Interactive Computing , 1991, CRYPTO.
[19] Joe Kilian,et al. A general completeness theorem for two party games , 1991, STOC '91.
[20] Donald Beaver,et al. Cryptographic Protocols Provably Secure Against Dynamic Adversaries , 1992, EUROCRYPT.
[21] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[22] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[23] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[24] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[25] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[26] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[27] Yehuda Lindell,et al. Resettably-sound zero-knowledge and its applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[28] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[29] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[30] Matthias Fitzi,et al. Detectable byzantine agreement secure against faulty majorities , 2002, PODC '02.
[31] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[32] Ran El-Yaniv,et al. Resilient-optimal interactive consistency in constant time , 2003, Distributed Computing.
[33] Matthias Fitzi,et al. Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch , 2002, EUROCRYPT.
[34] Yehuda Lindell,et al. Lower Bounds for Concurrent Self Composition , 2004, TCC.
[35] Nancy A. Lynch,et al. Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.
[36] On the composition of authenticated Byzantine Agreement , 2006, JACM.
[37] Oded Goldreich,et al. Concurrent zero-knowledge with timing, revisited , 2002, STOC '02.
[38] Birgit Pfitzmann,et al. Information-Theoretic Pseudosignatures and Byzantine Agreement for t ≥ n/3 , 2007 .