Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
暂无分享,去创建一个
Yuval Ishai | Daniel Genkin | Antigoni Polychroniadou | Daniel Genkin | Y. Ishai | Antigoni Polychroniadou
[1] Moni Naor,et al. Oblivious Polynomial Evaluation , 2006, SIAM J. Comput..
[2] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[3] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[4] Koji Chida,et al. Actively Private and Correct MPC Scheme in t , 2014, IACR Cryptol. ePrint Arch..
[5] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[6] Yuval Ishai,et al. Circuits resilient to additive attacks with applications to secure computation , 2014, STOC.
[7] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols: Techniques and Constructions , 2010 .
[8] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[9] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[10] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[11] Ivan Damgård,et al. Scalable and Unconditionally Secure Multiparty Computation , 2007, CRYPTO.
[12] Yuval Ishai,et al. Secure Arithmetic Computation with No Honest Majority , 2008, IACR Cryptol. ePrint Arch..
[13] Rafail Ostrovsky,et al. How to withstand mobile virus attacks, revisited , 2014, PODC '14.
[14] Gabriel Bracha,et al. An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.
[15] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[16] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[17] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[18] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[19] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols , 2010, Information Security and Cryptography.
[20] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[21] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[22] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[23] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.