More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
暂无分享,去创建一个
Yehuda Lindell | Michael Zohner | Gilad Asharov | Thomas Schneider | Yehuda Lindell | T. Schneider | Gilad Asharov | Michael Zohner
[1] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[2] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[3] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.
[4] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[5] Enrique Larraia,et al. Extending Oblivious Transfer Efficiently - or - How to Get Active Security with Constant Cryptographic Overhead , 2014, LATINCRYPT.
[6] Vladimir Kolesnikov,et al. Improved OT Extension for Transferring Short Secrets , 2013, CRYPTO.
[7] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2010, IACR Cryptol. ePrint Arch..
[8] Changyu Dong,et al. When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.
[9] Florian Kerschbaum,et al. Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently , 2013, IACR Cryptol. ePrint Arch..
[10] J. Nielsen,et al. Fast and Maliciously Secure Two-Party Computation Using the GPU , 2013, ACNS.
[11] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, Journal of Cryptology.
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[13] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[14] Yehuda Lindell,et al. More efficient oblivious transfer and extensions for faster secure computation , 2013, CCS.
[15] Alex J. Malozemoff,et al. Amortizing Garbled Circuits , 2015, IACR Cryptol. ePrint Arch..
[16] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[17] Emmanuela Orsini,et al. Dishonest Majority Multi-Party Computation for Binary Circuits , 2014, IACR Cryptol. ePrint Arch..
[18] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[19] Jesper Buus Nielsen,et al. Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free , 2007, IACR Cryptol. ePrint Arch..
[20] Yehuda Lindell,et al. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries , 2008, SCN.
[21] Yuval Ishai,et al. OT-Combiners via Secure Computation , 2008, TCC.
[22] Abhi Shelat,et al. Billion-Gate Secure Computation with Malicious Adversaries , 2012, USENIX Security Symposium.
[23] Yehuda Lindell,et al. SCAPI: The Secure Computation Application Programming Interface , 2012, IACR Cryptol. ePrint Arch..
[24] Jonathan Katz,et al. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? , 2012, NDSS.
[25] Yehuda Lindell,et al. Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings , 2014, CRYPTO.
[26] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[27] Yehuda Lindell,et al. On the Feasibility of Extending Oblivious Transfer , 2013, Journal of Cryptology.
[28] Abhi Shelat,et al. Fast two-party secure computation with minimal assumptions , 2013, CCS.
[29] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[30] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[31] Jesper Buus Nielsen,et al. Faster Maliciously Secure Two-Party Computation Using the GPU , 2014, SCN.
[32] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[33] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[34] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[35] Ivan Damgård,et al. An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation , 2014, SCN.