Efficient Multi-party Computation over Rings
暂无分享,去创建一个
[1] Ivan Damgård,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.
[2] Moti Yung,et al. Non-interactive cryptocomputing for NC/sup 1/ , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[3] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[4] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[5] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[7] Rafail Ostrovsky,et al. How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.
[8] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[9] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[10] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] Joe Kilian,et al. One-Round Secure Computation and Secure Autonomous Mobile Agents , 2000, ICALP.
[12] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..
[13] Matthias Fitzi,et al. Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) , 1998, CRYPTO.
[14] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[15] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[16] Ueli Maurer,et al. Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks , 2002, CRYPTO.
[17] Moti Yung,et al. How to share a function securely , 1994, STOC '94.
[18] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[19] Matthias Fitzi,et al. Trading Correctness for Privacy in Unconditional Multi-Party Computation ? Corrected Version ?? , 1998 .
[20] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[21] Piotr Berman,et al. Towards Optimal Distributed Consensus (Extended Abstract) , 1989, FOCS 1989.
[22] Ueli Maurer,et al. Efficient Secure Multi-party Computation , 2000, ASIACRYPT.
[23] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[24] Silvio Micali,et al. The Round Complexity of Secure Protocols (Extended Abstract) , 1990, STOC 1990.
[25] Yuval Ishai,et al. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials , 2002, ICALP.
[26] Moni Naor,et al. A Minimal Model for Secure Computation , 2002 .
[27] Tal Rabin,et al. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.
[28] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[29] Ueli Maurer,et al. Secure multi-party computation made simple , 2002, Discret. Appl. Math..
[30] Adi Shamir,et al. How to share a secret , 1979, CACM.
[31] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[32] R. Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002 .
[33] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[34] Ueli Maurer,et al. Robustness for Free in Unconditional Multi-party Computation , 2001, CRYPTO.
[35] Donald Beaver. Minimal-Latency Secure Function Evaluation , 2000, EUROCRYPT.
[36] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[37] Richard Cleve. Towards optimal simulations of formulas by bounded-width programs , 1990, STOC '90.
[38] Yehuda Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, CRYPTO.
[39] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[40] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[41] Ueli Maurer,et al. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.
[42] Joan Feigenbaum,et al. Security with Low Communication Overhead , 1990, CRYPTO.
[43] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[44] Rafail Ostrovsky,et al. How To Withstand Mobile Virus Attacks , 1991, PODC 1991.
[45] Matthias Fitzi,et al. Efficient Byzantine Agreement Secure Against General Adversaries , 1998, DISC.
[46] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.