Reusable Two-Round MPC from LPN
暂无分享,去创建一个
Sanjam Garg | Akshayaram Srinivasan | James Bartusek | Yinuo Zhang | Sanjam Garg | Akshayaram Srinivasan | James Bartusek | Yinuo Zhang
[1] Zhengzhong Jin,et al. Multi-key Fully-Homomorphic Encryption in the Plain Model , 2020, TCC.
[2] Stephan Krenn,et al. Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise , 2012, ASIACRYPT.
[3] Yuval Ishai,et al. Semantic Security under Related-Key Attacks and Applications , 2011, ICS.
[4] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[5] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[6] Yuval Ishai,et al. Two-Round MPC: Information-Theoretic and Black-Box , 2018, IACR Cryptol. ePrint Arch..
[7] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[8] Craig Gentry,et al. Two-Round Secure MPC from Indistinguishability Obfuscation , 2014, TCC.
[9] Yuval Ishai,et al. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More , 2019, IACR Cryptol. ePrint Arch..
[10] Yuval Ishai,et al. Breaking the Circuit Size Barrier for Secure Computation Under DDH , 2016, CRYPTO.
[11] Yuval Ishai,et al. Cryptography with Constant Input Locality , 2007, Journal of Cryptology.
[12] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[13] Yuval Ishai,et al. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation , 2019, IACR Cryptol. ePrint Arch..
[14] Daniel Wichs,et al. Two Round Multiparty Computation via Multi-key FHE , 2016, EUROCRYPT.
[15] S. Rajsbaum. Foundations of Cryptography , 2014 .
[16] Fabrice Benhamouda,et al. Multiparty Reusable Non-Interactive Secure Computation , 2020, IACR Cryptol. ePrint Arch..
[17] Ron Rothblum,et al. Spooky Encryption and Its Applications , 2016, CRYPTO.
[18] Sanjam Garg,et al. Garbled Protocols and Two-Round MPC from Bilinear Maps , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Nico Döttling,et al. Two-Round Oblivious Transfer from CDH or LPN , 2020, IACR Cryptol. ePrint Arch..
[20] Yuval Ishai,et al. Computationally Private Randomizing Polynomials and Their Applications , 2005, Computational Complexity Conference.
[21] Yuval Ishai,et al. Distributed Point Functions and Their Applications , 2014, EUROCRYPT.
[22] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[23] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[24] Sanjam Garg,et al. Reusable Two-Round MPC from DDH , 2020, IACR Cryptol. ePrint Arch..
[25] Fabrice Benhamouda,et al. k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits , 2018, EUROCRYPT.