Amortized Complexity of Information-Theoretically Secure MPC Revisited
暂无分享,去创建一个
Ignacio Cascudo | Ronald Cramer | Chen Yuan | Chaoping Xing | R. Cramer | C. Xing | Ignacio Cascudo | Chen Yuan
[1] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[2] Hemanta K. Maji,et al. Secure Computation Based on Leaky Correlations: High Resilience Setting , 2017, CRYPTO.
[3] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[4] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .
[5] Gabriel Bracha,et al. An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.
[6] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.
[7] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[8] Ignacio Cascudo,et al. The arithmetic codex , 2012, 2012 IEEE Information Theory Workshop.
[9] Ignacio Cascudo,et al. The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing , 2011, CRYPTO.
[10] Chaoping Xing,et al. Algebraic curves with many points over the binary field , 2007 .
[11] D. V. Chudnovsky,et al. Algebraic complexities and algebraic curves over finite fields , 1987, J. Complex..
[12] Gabriel Bracha,et al. An O(lg n) expected rounds randomized Byzantine generals protocol , 1985, STOC '85.
[13] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[14] Rafail Ostrovsky,et al. Zero-Knowledge Proofs from Secure Multiparty Computation , 2009, SIAM J. Comput..
[15] Ivan Damgård,et al. Scalable and Unconditionally Secure Multiparty Computation , 2007, CRYPTO.
[16] Henning Stichtenoth,et al. Towers of Function Fields over Non-prime Finite Fields , 2012, 1202.5922.
[17] Ivan Damgård,et al. Secure Multiparty Computation and Secret Sharing , 2015 .
[18] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[19] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[20] Adi Shamir,et al. How to share a secret , 1979, CACM.
[21] Ueli Maurer,et al. Efficient Secure Multi-party Computation , 2000, ASIACRYPT.
[22] Ivan Damgård,et al. On the Communication Required for Unconditionally Secure Multiplication , 2016, CRYPTO.
[23] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[24] Ignacio Cascudo,et al. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field , 2009, CRYPTO.
[25] R. Cramer,et al. Secure Multiparty Computation and Secret Sharing: Preliminaries , 2015 .