Unconditionally Secure Computation with Reduced Interaction
暂无分享,去创建一个
Rafail Ostrovsky | Ivan Damgård | Adi Rosén | Jesper Buus Nielsen | I. Damgård | R. Ostrovsky | J. Nielsen | A. Rosén
[1] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[2] Birgit Pfitzmann,et al. Unconditional Byzantine Agreement for any Number of Faulty Processors , 1992, STACS.
[3] Noam Nisan,et al. CREW PRAMS and decision trees , 1989, STOC '89.
[4] Vinod M. Prabhakaran,et al. On the Communication Complexity of Secure Computation , 2013, IACR Cryptol. ePrint Arch..
[5] Shafi Goldwasser,et al. Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting , 2013, TCC.
[6] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[7] Rafail Ostrovsky,et al. The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults , 2015, ITCS.
[8] 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.
[9] Eyal Kushilevitz,et al. A Communication-Privacy Tradeoff for Modular Addition , 1993, Inf. Process. Lett..
[10] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Abstract) , 1987, CRYPTO.
[11] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[12] Yuval Ishai,et al. Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[13] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[14] Xiaotie Deng,et al. Optimal Amortized Distributed Consensus (Extended Abstract) , 1991, WDAG.
[15] Rafail Ostrovsky,et al. Reducibility and Completeness in Private Computations , 2000, SIAM J. Comput..
[16] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.