Secure Distributed Linear Algebra in a Constant Number of Rounds
暂无分享,去创建一个
[1] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[2] Yuval Ishai,et al. Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[3] 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.
[4] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[5] Ueli Maurer,et al. Player Simulation and General Adversary Structures in Perfect Multiparty Computation , 2000, Journal of Cryptology.
[6] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[7] Sajal K. Das,et al. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.
[8] Tal Rabin,et al. Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.
[9] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[11] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[12] Meena Mahajan,et al. Determinant: Combinatorics, Algorithms, and Complexity , 1997, Chic. J. Theor. Comput. Sci..
[13] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[14] Tal Rabin,et al. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.
[15] Moni Naor,et al. A Minimal Model for Secure Computation , 2002 .
[16] R. Cramer,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000 .
[17] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[18] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[19] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[20] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[21] K. Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..
[22] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[23] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[24] Donald Beaver. Minimal-Latency Secure Function Evaluation , 2000, EUROCRYPT.
[25] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[26] Anna Gál,et al. On Arithmetic Branching Programs , 1999, J. Comput. Syst. Sci..