OT-Combiners via Secure Computation
暂无分享,去创建一个
Yuval Ishai | Eyal Kushilevitz | Danny Harnik | Jesper Buus Nielsen | E. Kushilevitz | J. Nielsen | Y. Ishai | Danny Harnik
[1] Ronald Cramer,et al. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings , 2005, EUROCRYPT.
[2] Bartosz Przydatek,et al. On Robust Combiners for Private Information Retrieval and Other Primitives , 2006, CRYPTO.
[3] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[4] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[5] Moni Naor. Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings , 2007, EUROCRYPT.
[6] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[7] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[8] Stephen Wiesner,et al. Conjugate coding , 1983, SIGA.
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[11] Hao Chen,et al. Secure Computation from Random Error Correcting Codes , 2007, EUROCRYPT.
[12] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[13] Jeroen van de Graaf,et al. Committed Oblivious Transfer and Private Multi-Party Computation , 1995, CRYPTO.
[14] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[15] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[16] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[17] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[18] Amir Herzberg,et al. On Tolerant Cryptographic Constructions , 2005, CT-RSA.
[19] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[20] Jürg Wullschleger. Oblivious-transfer amplification , 2007, Ausgezeichnete Informatikdissertationen.
[21] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[22] Claude Crépeau,et al. Efficient Cryptographic Protocols Based on Noisy Channels , 1997, EUROCRYPT.
[23] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[24] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[25] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[26] Oded Goldreich,et al. How to Solve any Protocol Problem - An Efficiency Improvement , 1987, CRYPTO.
[27] Yuval Ishai,et al. Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation , 2005, TCC.
[28] Joe Kilian,et al. A general completeness theorem for two party games , 1991, STOC '91.
[29] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[30] Moni Naor,et al. On Robust Combiners for Oblivious Transfer and Other Primitives , 2005, EUROCRYPT.
[31] Jürg Wullschleger,et al. Error-Tolerant Combiners for Oblivious Primitives , 2008, ICALP.
[32] Aggelos Kiayias,et al. Advances in Cryptology - EUROCRYPT 2004 , 2004 .
[33] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[34] Joe Kilian,et al. Achieving oblivious transfer using weakened security assumptions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[35] Bart Preneel,et al. Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .
[36] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[37] Jürg Wullschleger,et al. Robuster Combiners for Oblivious Transfer , 2007, TCC.
[38] A. J. Menezes,et al. Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings , 2007, CRYPTO.
[39] Ivan Damgård,et al. On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions , 1998, EUROCRYPT.
[40] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[41] Gilles Brassard,et al. Oblivious Transfers and Privacy Amplification , 1997, Journal of Cryptology.
[42] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[43] Ivan Damgård,et al. Unfair Noisy Channels and Oblivious Transfer , 2003, TCC.
[44] Ueli Maurer,et al. Robustness for Free in Unconditional Multi-party Computation , 2001, CRYPTO.
[45] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[46] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[47] Yuval Ishai,et al. How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? , 2007, CRYPTO.
[48] Oded Goldreich. Foundations of Cryptography: Volume 1 , 2006 .
[49] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.
[50] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[51] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).