Guaranteed Output Delivery Comes Free in Honest Majority MPC
暂无分享,去创建一个
[1] David Chaum,et al. Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.
[2] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[3] Adi Shamir,et al. How to share a secret , 1979, CACM.
[4] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[5] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[6] Yuval Ishai,et al. Circuits resilient to additive attacks with applications to secure computation , 2014, STOC.
[7] Yuval Ishai,et al. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs , 2019, CRYPTO.
[8] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[9] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2010, IACR Cryptol. ePrint Arch..
[10] Yehuda Lindell,et al. A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority , 2017, IACR Cryptol. ePrint Arch..
[11] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[12] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[13] Ueli Maurer,et al. Efficient Secure Multi-party Computation , 2000, ASIACRYPT.
[14] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[15] Yuval Ishai,et al. Secure Protocol Transformations , 2016, CRYPTO.
[16] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[17] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[18] Yuval Ishai,et al. Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs , 2019, CCS.
[19] Yuval Ishai,et al. Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits , 2015, CRYPTO.
[20] Ueli Maurer,et al. Robustness for Free in Unconditional Multi-party Computation , 2001, CRYPTO.
[21] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[22] Yehuda Lindell,et al. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries , 2018, Journal of Cryptology.
[23] Vipul Goyal,et al. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery , 2019, IACR Cryptol. ePrint Arch..
[24] Yehuda Lindell,et al. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority , 2017, IACR Cryptol. ePrint Arch..
[25] Martin Hirt,et al. Efficient Multi-party Computation with Dispute Control , 2006, TCC.
[26] Ivan Damgård,et al. Scalable and Unconditionally Secure Multiparty Computation , 2007, CRYPTO.
[27] Vipul Goyal,et al. Malicious Security Comes Free in Honest-Majority MPC , 2020, IACR Cryptol. ePrint Arch..
[28] Yehuda Lindell,et al. Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[29] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[30] Peter Sebastian Nordholt,et al. Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification , 2018, IACR Cryptol. ePrint Arch..