Information-theoretically secure protocols and security under composition
暂无分享,去创建一个
[1] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[2] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[3] Yehuda Lindell,et al. Lower Bounds for Concurrent Self Composition , 2004, TCC.
[4] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[5] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[6] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[7] Silvio Micali,et al. Parallel Reducibility for Information-Theoretically Secure Computation , 2000, CRYPTO.
[8] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[9] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[10] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[11] Silvio Micali,et al. Byzantine agreement in constant expected time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[12] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[13] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[14] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[15] Donald Beaver,et al. Foundations of Secure Interactive Computing , 1991, CRYPTO.
[16] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[17] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Birgit Pfitzmann,et al. Composition and integrity preservation of secure reactive systems , 2000, CCS.
[19] Michael Backes,et al. On the Necessity of Rewinding in Secure Multiparty Computation , 2007, TCC.
[20] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[21] Ronald Cramer,et al. Efficient Multiparty Computations with Dishonest Minority , 1998 .
[22] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[23] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[24] Ran Canetti,et al. Asynchronous secure computation , 1993, STOC.
[25] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[26] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[27] Yehuda Lindell,et al. General composition and universal composability in secure multi-party computation , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[28] Oded Goldreich. Foundations of Cryptography: Volume 1 , 2006 .
[29] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.
[30] Dennis Hofheinz,et al. Simulatable security and polynomially bounded concurrent composability , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).