Selected Secure Computation Papers by our Team

See individual project papers and PI home pages for a complete list of papers.

Xiao Wang, S. Dov Gordon, Allen McIntosh, and Jonathan Katz. Secure Computation of MIPS Machine Code. In European Symposium on Research in Computer Security (ESORICS), 2016.

Ruiyu Zhu, Yan Huang, Jonathan Katz, and abhi shelat. The Cut-and-Choose Game and its Application to Cryptographic Protocols. In USENIX Security Symposium, 2016.

Samee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón, Jack Doerner, David Evans, Jonathan Katz. Revisiting Square-Root ORAM Efficient Random Access in Multi-Party Computation. In 37th IEEE Symposium on Security and Privacy (“Oakland”). San Jose, CA. 23-25 May 2016.

Samee Zahur, Mike Rosulek, and David Evans. Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates. EuroCrypt 2015. Sofia, Bulgaria. 26-30 April 2015. [PDF, 28 pages] [Code]

Yan Huang, Jonathan Katz, and David Evans. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In 33rd International Cryptology Conference (CRYPTO 2013), Santa Barbara, CA, 18-22 August 2013. [PDF, 16 pages]

Samee Zahur and David Evans. Circuit Structures for Improving Efficiency of Security and Privacy Tools. In 34th IEEE Symposium on Security and Privacy (“Oakland” 2013), San Francisco, CA. May 19-22, 2013. [PDF, 15 pages]

Yan Huang, Jonathan Katz, and David Evans. Quid Pro Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution. In 33rd IEEE Symposium on Security and Privacy (“Oakland” 2012), San Francisco, CA. 20-23 May 2012. [PDF, 13 pages]

Yan Huang, David Evans, and Jonathan Katz. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In 19th Network and Distributed Security Symposium (NDSS 2012), San Diego, CA. 5-8 February 2012. [PDF, 15 pages]

Yan Huang, Chih-hao Shen, David Evans, Jonathan Katz, and abhi shelat. Efficient Secure Computation with Garbled Circuits. Invited paper for Seventh International Conference on Information Systems Security (ICISS 2011). 15-19 December 2011, Jadavpur University, Kolkata. [PDF, 21 pages]

Yikan Chen and David Evans. Auditing Information Leakage for Distance Metrics. In Third IEEE Conference on Privacy, Security, Risk and Trust, Boston, MA, 9-11 October 2011. [PDF, 10 pages]

Steven Myers and Mona Sergi and abhi shelat. Threshold Fully Homomorphic Encryption and Secure Computation, Cryptology ePrint Archive: Report 2011/454, August 2011.

S. Dov Gordon, Carmit Hazay, Jonathan Katz, and Yehuda Lindell. Complete Fairness in Secure Two-Party Computation. To appear in Journal of the ACM, extended version of STOC 2008 paper.

Yan Huang, David Evans, Jonathan Katz, and Lior Malka. Faster Secure Two-Party Computation Using Garbled Circuits, 20th USENIX Security Symposium, San Francisco, CA. 8-12 August 2011. [PDF, 16 pages]

Yan Huang, Peter Chapman, and David Evans. Privacy-Preserving Applications on Smartphones. 6th USENIX Workshop on Hot Topics in Security (HotSec 2011), San Francisco. 9 August 2011. Paper: [PDF, 6 pages]. Talk slides: [PDF] (Peter Chapman).

abhi shelat and Chih-Hao Shen. Two-Output Secure Computation with Malicious Adversaries, In 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Tallinn, Estonia, May 2011.

Yan Huang, Lior Malka, David Evans, and Jonathan Katz. Efficient Privacy-Preserving Biometric Identification, in 18th Network and Distributed System Security Symposium (NDSS 2011). San Diego, CA. 6-9 February 2011. [PDF, 14 pages]

This page includes papers by the project team members on secure computation. Many of the papers include work that was sponsored by other funding including grants from DARPA and an AFOSR MURI award, in addition to the NSF funding. See the grant acknowledgments on individual papers for details.