Fast Multiparty Multiplications from shared bits
暂无分享,去创建一个
[1] Arnold Schönhage,et al. Schnelle Multiplikation großer Zahlen , 1971, Computing.
[2] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.
[3] Peter Lory,et al. Secure Distributed Multiplication of Two Polynomially Shared Values: Enhancing the Efficiency of the Protocol , 2009, 2009 Third International Conference on Emerging Security Information, Systems and Technologies.
[4] Martin Fürer. Faster integer multiplication , 2007, STOC '07.
[5] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[6] S. Cook,et al. ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .
[7] Tal Rabin,et al. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.
[8] Anat Paskin-Cherniavsky,et al. On the Power of Correlated Randomness in Secure Computation , 2013, TCC.
[9] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[10] Ivan Damgård,et al. An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation , 2014, SCN.
[11] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..