Secure Multiparty Computation with General Interaction Patterns
暂无分享,去创建一个
Yuval Ishai | Eyal Kushilevitz | Shai Halevi | Tal Rabin | Abhishek Jain | S. Halevi | T. Rabin | E. Kushilevitz | Y. Ishai | Abhishek Jain
[1] Eli Upfal,et al. Fault tolerance in networks of bounded degree , 1986, STOC '86.
[2] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[3] Anat Paskin-Cherniavsky,et al. Non-Interactive Secure Multiparty Computation , 2014, IACR Cryptol. ePrint Arch..
[4] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[5] Yuval Ishai,et al. Share Conversion and Private Information Retrieval , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[6] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[8] Brent Waters,et al. Functional Encryption: Definitions and Challenges , 2011, TCC.
[9] Rafail Ostrovsky,et al. Improved Fault Tolerance and Secure Computation on Sparse Networks , 2010, ICALP.
[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[11] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[12] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[13] Amit Sahai,et al. Multi-Input Functional Encryption , 2014, IACR Cryptol. ePrint Arch..
[14] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[15] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[16] Aravind Srinivasan,et al. Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] M. Kearns,et al. Network-Faithful Secure Computation , 2007 .
[18] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[19] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.
[20] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[21] Craig Gentry,et al. Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations , 2015, CRYPTO.
[22] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[23] Jung Hee Cheon,et al. Cryptanalysis of the Multilinear Map over the Integers , 2014, EUROCRYPT.
[24] Daniel Wichs,et al. On the Communication Complexity of Secure Function Evaluation with Long Output , 2015, IACR Cryptol. ePrint Arch..
[25] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[26] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[27] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[28] Yuval Ishai,et al. On the Hardness of Information-Theoretic Multiparty Computation , 2004, EUROCRYPT.
[29] Rudolf Ahlswede,et al. Founding Cryptography on Oblivious Transfer , 2016 .
[30] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[31] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[32] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[33] Jonathan Katz,et al. Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets , 2006, IEEE Transactions on Information Theory.
[34] Moni Naor,et al. A Minimal Model for Secure Computation , 2002 .
[35] Adam O'Neill,et al. Definitional Issues in Functional Encryption , 2010, IACR Cryptol. ePrint Arch..
[36] Rafail Ostrovsky,et al. Almost-Everywhere Secure Computation , 2008, EUROCRYPT.
[37] Jean-Sébastien Coron,et al. New Multilinear Maps Over the Integers , 2015, CRYPTO.
[38] Brice Minaud,et al. Cryptanalysis of the New CLT Multilinear Map over the Integers , 2016, EUROCRYPT.
[39] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[40] Kannan Ramchandran,et al. Secret Share Dissemination across a Network , 2012, ArXiv.
[41] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[42] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[43] Yehuda Lindell,et al. A Simpler Variant of Universally Composable Security for Standard Multiparty Computation , 2015, CRYPTO.
[44] Jung Hee Cheon,et al. Cryptanalysis of the New CLT Multilinear Maps , 2015, IACR Cryptol. ePrint Arch..
[45] Brice Minaud,et al. Cryptanalysis of the New Multilinear Map over the Integers , 2015, IACR Cryptol. ePrint Arch..
[46] Craig Gentry,et al. Graph-Induced Multilinear Maps from Lattices , 2015, TCC.
[47] Tal Malkin,et al. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction , 2013, EUROCRYPT.
[48] Vinod Vaikuntanathan,et al. Functional Encryption: New Perspectives and Lower Bounds , 2013, IACR Cryptol. ePrint Arch..
[49] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[50] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[51] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[52] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[53] Omer Paneth,et al. On the Achievability of Simulation-Based Security for Functional Encryption , 2013, CRYPTO.
[54] Jean-Sébastien Coron,et al. Practical Multilinear Maps over the Integers , 2013, CRYPTO.
[55] Yehuda Lindell,et al. Secure Computation on the Web: Computing without Simultaneous Interaction , 2011, IACR Cryptol. ePrint Arch..
[56] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[57] Dan Boneh,et al. Applications of Multilinear Forms to Cryptography , 2002, IACR Cryptol. ePrint Arch..
[58] Brent Waters,et al. Fuzzy Identity-Based Encryption , 2005, EUROCRYPT.
[59] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[60] Yael Tauman Kalai,et al. Reusable garbled circuits and succinct functional encryption , 2013, STOC '13.
[61] S. Rajsbaum. Foundations of Cryptography , 2014 .