Improved OT Extension for Transferring Short Secrets
暂无分享,去创建一个
[1] B. Applebaum. Cryptography in NC0 , 2014 .
[2] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[3] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .
[4] Abhi Shelat,et al. Efficient Secure Computation with Garbled Circuits , 2011, ICISS.
[5] Yuval Ishai,et al. Cryptography in NC0 , 2004, FOCS.
[6] Michael Zohner,et al. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits , 2013, Financial Cryptography.
[7] Vladimir Kolesnikov,et al. Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits , 2012, SCN.
[8] N. S. Barnett,et al. Private communication , 1969 .
[9] Benny Applebaum,et al. Pseudorandom generators with long stretch and low locality from random local one-way functions , 2012, STOC '12.
[10] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[11] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[12] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[13] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[14] Jonathan Katz,et al. Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces , 2012, CT-RSA.
[15] Rafail Ostrovsky,et al. Cryptography with constant computational overhead , 2008, STOC.
[16] Jonathan Katz,et al. Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution , 2012, 2012 IEEE Symposium on Security and Privacy.
[17] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[18] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[19] Moni Naor,et al. Computationally Secure Oblivious Transfer , 2004, Journal of Cryptology.
[20] Vladimir Kolesnikov. Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation , 2005, ASIACRYPT.
[21] Oded Goldreich,et al. How to Solve any Protocol Problem - An Efficiency Improvement , 1987, CRYPTO.
[22] Ahmad-Reza Sadeghi,et al. Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima , 2009, IACR Cryptol. ePrint Arch..
[23] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.
[24] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[25] Yuval Ishai,et al. Cryptography in NC0 , 2004, SIAM J. Comput..
[26] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[27] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[28] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[29] Jesper Buus Nielsen,et al. Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free , 2007, IACR Cryptol. ePrint Arch..
[30] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[31] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[32] Rafail Ostrovsky,et al. Extracting Correlations , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[33] Yuval Ishai,et al. OT-Combiners via Secure Computation , 2008, TCC.
[34] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.
[35] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[36] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.