Fast and Maliciously Secure Two-Party Computation Using the GPU
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[2] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[3] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[4] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[5] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.
[6] Noam Nisan,et al. The computational complexity of universal hashing , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[7] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[8] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[9] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] 尚弘 島影. National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .
[11] Yuval Ishai,et al. Efficient Multi-party Computation over Rings , 2003, EUROCRYPT.
[12] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[13] Berry Schoenmakers,et al. A protocol issue for the malicious case of Yao's garbled circuit construction , 2006 .
[14] Matthew K. Franklin,et al. Efficiency Tradeoffs for Malicious Two-Party Computation , 2006, Public Key Cryptography.
[15] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[16] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[17] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[18] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[19] Claudio Orlandi,et al. LEGO for Two-Party Secure Computation , 2009, TCC.
[20] Ivan Damgård,et al. Essentially Optimal Universally Composable Oblivious Transfer , 2009, ICISC.
[21] Adam D. Smith,et al. Efficient Two Party and Multi Party Computation Against Covert Adversaries , 2008, EUROCRYPT.
[22] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[23] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[24] Jie Cheng,et al. Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..
[25] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[26] Ahmad-Reza Sadeghi,et al. From Dust to Dawn: Practically Efficient Two-Party Secure Function Evaluation Protocols and their Modular Design , 2010, IACR Cryptol. ePrint Arch..
[27] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols: Techniques and Constructions , 2010 .
[28] Ian Goldberg,et al. Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.
[29] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2010, IACR Cryptol. ePrint Arch..
[30] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[31] Yehuda Lindell,et al. Efficient Secure Two-Party Protocols , 2010, Information Security and Cryptography.
[32] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[33] Tore Kasper Frederiksen. Using CUDA for Exhaustive Password Recovery , 2011 .
[34] Jyh-Charn Liu,et al. Fastplay-A Parallelization Model and Implementation of SMC on CUDA based GPU Cluster Architecture , 2011, IACR Cryptol. ePrint Arch..
[35] Abhi Shelat,et al. Efficient Secure Computation with Garbled Circuits , 2011, ICISS.
[36] Dongdai Lin,et al. ECDLP on GPU , 2011, IACR Cryptol. ePrint Arch..
[37] Abhi Shelat,et al. Two-Output Secure Computation with Malicious Adversaries , 2011, EUROCRYPT.
[38] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[39] Yehuda Lindell,et al. The IPS Compiler: Optimizations, Variants and Concrete Efficiency , 2011, CRYPTO.
[40] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[41] Jonathan Katz,et al. Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution , 2012, 2012 IEEE Symposium on Security and Privacy.
[42] Abhi Shelat,et al. Billion-Gate Secure Computation with Malicious Adversaries , 2012, USENIX Security Symposium.
[43] Takakazu Kurokawa,et al. High-Performance Symmetric Block Ciphers on Multicore CPU and GPUs , 2012, Int. J. Netw. Comput..
[44] Abhi Shelat,et al. Towards Billion-Gate Secure Computation with Malicious Adversaries , 2012, IACR Cryptol. ePrint Arch..
[45] Claudio Orlandi,et al. MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions , 2013, EUROCRYPT.
[46] Abhi Shelat,et al. Fast two-party secure computation with minimal assumptions , 2013, CCS.
[47] Ben Riva,et al. Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation , 2013, IACR Cryptol. ePrint Arch..
[48] Jonathan Katz,et al. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose , 2013, CRYPTO.
[49] Yehuda Lindell. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries , 2013, CRYPTO.
[50] Luís T. A. N. Brandão,et al. Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique , 2013, IACR Cryptol. ePrint Arch..
[51] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.
[52] Steven Myers,et al. GPU and CPU parallelization of honest-but-curious secure two-party computation , 2013, ACSAC.
[53] Marcel Keller,et al. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits , 2013, ESORICS.
[54] Jesper Buus Nielsen,et al. Faster Maliciously Secure Two-Party Computation Using the GPU , 2014, SCN.
[55] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.