Efficient Secure Computation with Garbled Circuits
暂无分享,去创建一个
Abhi Shelat | Jonathan Katz | Yan Huang | Chih-Hao Shen | David Evans | Jonathan Katz | Abhi Shelat | David Evans | Yan Huang | Chih-Hao Shen
[1] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[2] Jonathan Katz,et al. Partial Fairness in Secure Two-Party Computation , 2010, Journal of Cryptology.
[3] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[4] Jonathan Katz,et al. Fair Computation with Rational Players , 2012, EUROCRYPT.
[5] Vitaly Shmatikov,et al. Towards Practical Privacy for Genomic Computation , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[6] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[7] Claudio Orlandi,et al. LEGO for Two-Party Secure Computation , 2009, TCC.
[8] Henri Gilbert,et al. Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings , 2010, EUROCRYPT.
[9] Kenneth G. Paterson. Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings , 2011, EUROCRYPT.
[10] 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.
[11] Moti Yung,et al. Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.
[12] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[13] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[14] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[15] Abhi Shelat,et al. Two-Output Secure Computation with Malicious Adversaries , 2011, EUROCRYPT.
[16] Ralph Johnson,et al. Design patterns: elements of reuseable object-oriented software , 1994 .
[17] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[18] Donald Beaver,et al. Multiparty Computation with Faulty Majority , 1989, CRYPTO.
[19] Aggelos Kiayias,et al. Public Key Cryptography - PKC 2006 , 2006, Lecture Notes in Computer Science.
[20] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[21] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[22] Elisabeth Oswald,et al. A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework , 2011, CRYPTO.
[23] Manoj Prabhakaran,et al. Resource Fairness and Composability of Cryptographic Protocols , 2006, Journal of Cryptology.
[24] Anna Lysyanskaya,et al. Rationality and Adversarial Behavior in Multi-party Computation , 2006, CRYPTO.
[25] Ran Canetti,et al. Toward a Game Theoretic View of Secure Computation , 2011, Journal of Cryptology.
[26] Eran Omri,et al. Protocols for Multiparty Coin Toss with Dishonest Majority , 2010, CRYPTO.
[27] Mark Manulis,et al. Cryptology and Network Security , 2012, Lecture Notes in Computer Science.
[28] Vitaly Shmatikov,et al. Privacy-Preserving Graph Algorithms in the Semi-honest Model , 2005, ASIACRYPT.
[29] Berry Schoenmakers,et al. A protocol issue for the malicious case of Yao's garbled circuit construction , 2006 .
[30] Matthew K. Franklin,et al. Efficiency Tradeoffs for Malicious Two-Party Computation , 2006, Public Key Cryptography.
[31] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[32] Donald Beaver,et al. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority , 2004, Journal of Cryptology.
[33] Carl Pomerance,et al. Advances in Cryptology — CRYPTO ’87 , 2000, Lecture Notes in Computer Science.
[34] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[35] Tal Rabin. Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings , 2010, CRYPTO.
[36] Joseph Y. Halpern,et al. Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.
[37] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[38] Jonathan Katz,et al. Complete Fairness in Multi-Party Computation Without an Honest Majority , 2009, IACR Cryptol. ePrint Arch..
[39] Benny Pinkas,et al. FairplayMP: a system for secure multi-party computation , 2008, CCS.
[40] Jonathan Katz,et al. On the Security of the Free-XOR Technique , 2012, IACR Cryptol. ePrint Arch..
[41] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2000, Journal of Cryptology.
[42] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..
[43] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[44] Ahmad-Reza Sadeghi,et al. Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima , 2009, IACR Cryptol. ePrint Arch..
[45] Jonathan Katz,et al. Efficient Privacy-Preserving Biometric Identification , 2011, NDSS.
[46] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[47] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[48] Yan Huang,et al. Privacy-Preserving Applications on Smartphones , 2011, HotSec.
[49] Jonathan Katz,et al. Rational Secret Sharing, Revisited , 2006, SCN.
[50] Yehuda Lindell,et al. Complete Fairness in Secure Two-Party Computation , 2011, JACM.
[51] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[52] Eran Omri,et al. 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds , 2011, CRYPTO.
[53] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.
[54] 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.
[55] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[56] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2011, Journal of Cryptology.
[57] Vincenzo Piuri,et al. Privacy-preserving fingercode authentication , 2010, MM&Sec '10.
[58] Samuel Dov Gordon,et al. On Fairness in Secure Computation , 2010 .
[59] A. Maximov,et al. Fast computation of large distributions and its cryptographic applications , 2005 .
[60] Vitaly Shmatikov,et al. Efficient Two-Party Secure Computation on Committed Inputs , 2007, EUROCRYPT.
[61] H.C.A. van Tilborg,et al. Secure and fair two-party computation , 2007 .
[62] Sheng Zhong,et al. Privacy-Preserving Classification of Customer Data without Loss of Accuracy , 2005, SDM.
[63] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[64] Benny Pinkas,et al. SCiFI - A System for Secure Face Identification , 2010, 2010 IEEE Symposium on Security and Privacy.