Billion-Gate Secure Computation with Malicious Adversaries
暂无分享,去创建一个
[1] Berry Schoenmakers,et al. A protocol issue for the malicious case of Yao's garbled circuit construction , 2006 .
[2] Craig Gentry,et al. Homomorphic Evaluation of the AES Circuit , 2012, IACR Cryptol. ePrint Arch..
[3] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[4] Vitaly Shmatikov,et al. Privacy-Preserving Graph Algorithms in the Semi-honest Model , 2005, ASIACRYPT.
[5] Matthew K. Franklin,et al. Efficiency Tradeoffs for Malicious Two-Party Computation , 2006, Public Key Cryptography.
[6] H.C.A. van Tilborg,et al. Secure and fair two-party computation , 2007 .
[7] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[8] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[9] Abhi Shelat,et al. Two-Output Secure Computation with Malicious Adversaries , 2011, EUROCRYPT.
[10] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[11] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[12] Ivan Damgård,et al. Secure Multiparty Computation Goes Live , 2009, Financial Cryptography.
[13] Jonathan Katz,et al. Efficient Privacy-Preserving Biometric Identification , 2011, NDSS.
[14] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[15] Simon Heron,et al. Encryption: Advanced Encryption Standard (AES) , 2009 .
[16] Jonathan Katz,et al. On the Security of the Free-XOR Technique , 2012, IACR Cryptol. ePrint Arch..
[17] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[18] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[19] Yehuda Lindell,et al. The IPS Compiler: Optimizations, Variants and Concrete Efficiency , 2011, CRYPTO.
[20] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[21] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[22] Adam D. Smith,et al. Efficient Two Party and Multi Party Computation Against Covert Adversaries , 2008, EUROCRYPT.
[23] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[24] Lior Malka,et al. VMCrypt: modular software architecture for scalable secure computation , 2011, CCS '11.
[25] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[26] Benny Pinkas,et al. SCiFI - A System for Secure Face Identification , 2010, 2010 IEEE Symposium on Security and Privacy.
[27] Joan Boyar,et al. A New Combinational Logic Minimization Technique with Applications to Cryptology , 2010, SEA.
[28] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[29] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2002, Journal of Cryptology.
[30] Vitaly Shmatikov,et al. Towards Practical Privacy for Genomic Computation , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[31] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2010, IACR Cryptol. ePrint Arch..
[32] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .