Commodity-Based 2PC for Arithmetic Circuits
暂无分享,去创建一个
[1] Nico Döttling,et al. TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation , 2017, IACR Cryptol. ePrint Arch..
[2] Claudio Orlandi,et al. A Framework for Outsourcing of Secure Computation , 2014, CCSW.
[3] Marcel Keller,et al. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer , 2016, IACR Cryptol. ePrint Arch..
[4] Moni Naor,et al. On Robust Combiners for Oblivious Transfer and Other Primitives , 2005, EUROCRYPT.
[5] Marcel Keller,et al. Overdrive: Making SPDZ Great Again , 2018, IACR Cryptol. ePrint Arch..
[6] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[7] Yuval Ishai,et al. OT-Combiners via Secure Computation , 2008, TCC.
[8] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[9] Yuval Ishai,et al. Secure Arithmetic Computation with Constant Computational Overhead , 2017, CRYPTO.
[10] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[11] Yuval Ishai,et al. Compressing Vector OLE , 2018, CCS.
[12] Goichiro Hanaoka,et al. Information-theoretically secure oblivious polynomial evaluation in the commodity-based model , 2014, International Journal of Information Security.
[13] Anat Paskin-Cherniavsky,et al. On the Power of Correlated Randomness in Secure Computation , 2013, TCC.
[14] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.
[15] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[16] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.