Private Editing Using Untrusted Cloud Services. - Yan Huang 001; David Evans 001 (ICDCS Workshops, 2011)

Efficient Secure Computation with Garbled Circuits. - Yan Huang 001; Chih-Hao Shen; David Evans 001; Jonathan Katz; Abhi Shelat (ICISS, 2011)

Efficient Privacy-Preserving Biometric Identification. - Yan Huang 001; Lior Malka; David Evans 001; Jonathan Katz (NDSS, 2011)

Privacy-Preserving Applications on Smartphones. - Yan Huang 001; Peter Chapman; David Evans 001 (HotSec, 2011)

Faster Secure Two-Party Computation Using Garbled Circuits. - Yan Huang 001; David Evans 001; Jonathan Katz; Lior Malka (USENIX Security Symposium, 2011)

Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? - Yan Huang 001; David Evans 001; Jonathan Katz (NDSS, 2012)

Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution. - Yan Huang 001; Jonathan Katz; David Evans 001 (IEEE Symposium on Security and Privacy, 2012)

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. - Yan Huang 001; Jonathan Katz; David Evans 001 (IACR Cryptol. ePrint Arch., 2013)

Oblivious Data Structures. - Xiao Shaun Wang; Kartik Nayak; Chang Liu 021; T.-H. Hubert Chan; Elaine Shi; Emil Stefanov; Yan Huang 001 (CCS, 2014)

A secure computation framework for SDNs. - Nachikethas A. Jagadeesan; Ranjan Pal; Kaushik Nadikuditi; Yan Huang 001; Elaine Shi; Minlan Yu (HotSDN, 2014)

Automating Efficient RAM-Model Secure Computation. - Chang Liu 021; Yan Huang 001; Elaine Shi; Jonathan Katz; Michael W. Hicks (IEEE Symposium on Security and Privacy, 2014)

Implementing Cryptographic Program Obfuscation. - Daniel Apon; Yan Huang 001; Jonathan Katz; Alex J. Malozemoff (IACR Cryptol. ePrint Arch., 2014)

SCORAM: Oblivious RAM for Secure Computation. - Xiao Shaun Wang; Yan Huang 001; T.-H. Hubert Chan; Abhi Shelat; Elaine Shi (IACR Cryptol. ePrint Arch., 2014)

Oblivious Data Structures. - Xiao Wang 012; Kartik Nayak; Chang Liu 021; Elaine Shi; Emil Stefanov; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2014)

Practicing Oblivious Access on Cloud Storage: the Gap, the Fallacy, and the New Way Forward. - Vincent Bindschaedler; Muhammad Naveed 001; Xiaorui Pan; XiaoFeng Wang 001; Yan Huang 001 (CCS, 2015)

Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance. - Xiao Shaun Wang; Yan Huang 001; Yongan Zhao; Haixu Tang; XiaoFeng Wang 001; Diyue Bu (CCS, 2015)

ObliVM: A Programming Framework for Secure Computation. - Chang Liu 021; Xiao Shaun Wang; Kartik Nayak; Yan Huang 001; Elaine Shi (IEEE Symposium on Security and Privacy, 2015)

Amortizing Garbled Circuits. - Yan Huang 001; Jonathan Katz; Vladimir Kolesnikov; Ranjit Kumaresan; Alex J. Malozemoff (IACR Cryptol. ePrint Arch., 2015)

Revisiting LEGOs: Optimizations, Analysis, and their Limit. - Yan Huang 001; Ruiyu Zhu (IACR Cryptol. ePrint Arch., 2015)

iDASH Secure Genome Analysis Competition Using ObliVM. - Xiao Shaun Wang; Chang Liu 021; Kartik Nayak; Yan Huang 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2015)

The Cut-and-Choose Game and Its Application to Cryptographic Protocols. - Ruiyu Zhu; Yan Huang 001; Jonathan Katz; Abhi Shelat (USENIX Security Symposium, 2016)

JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes. - Ruiyu Zhu; Yan Huang 001 (ASIACRYPT (2), 2017)

Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries. - Ruiyu Zhu; Yan Huang 001; Darion Cassel (CCS, 2017)

Cost-Aware Cut-and-Choose Games with Applications in Cryptography and Prefix-Free Codes. - Ruiyu Zhu; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2017)

Faster LEGO-based Secure Computation without Homomorphic Commitments. - Ruiyu Zhu; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2017)

Efficient Privacy-Preserving Edit Distance and Beyond. - Ruiyu Zhu; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2017)

FlowNotation: An Annotation System for Statically Enforcing Information Flow Policies in C. - Darion Cassel; Yan Huang 001; Limin Jia 001 (CCS, 2018)

NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. - Ruiyu Zhu; Darion Cassel; Amr Sabry; Yan Huang 001 (CCS, 2018)

Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations. - Ruiyu Zhu; Changchang Ding; Yan Huang 001 (CCS, 2019)

Uncovering Information Flow Policy Violations in C Programs (Extended Abstract). - Darion Cassel; Yan Huang 001; Limin Jia 001 (ESORICS (2), 2019)

Uncovering Information Flow Policy Violations in C Programs. - Darion Cassel; Yan Huang 001; Limin Jia 001 (CoRR, 2019)

Practical MPC+FHE with Applications in Secure Multi-PartyNeural Network Evaluation. - Ruiyu Zhu; Changchang Ding; Yan Huang 001 (IACR Cryptol. ePrint Arch., 2020)

Hash-Enabled Garbling and the Insecurity of Free-Hashing Garbled Circuits. - Ruiyu Zhu; Yan Huang 001 (AsiaCCS, 2021)

DNSonChain: Delegating Privacy-Preserved DNS Resolution to Blockchain. - Lin Jin; Shuai Hao 001; Yan Huang 001; Haining Wang 001; Chase Cotton (ICNP, 2021)

Efficient and Precise Secure Generalized Edit Distance and Beyond. - Ruiyu Zhu; Yan Huang 001 (IEEE Trans. Dependable Secur. Comput., 2022)

Dubhe: Succinct Zero-Knowledge Proofs for Standard AES and related Applications. - Changchang Ding; Yan Huang 001 (USENIX Security Symposium, 2023)

Phecda: Post-Quantum Transparent zkSNARKs from Improved Polynomial Commitment and VOLE-in-the-Head with Application in Publicly Verifiable AES. - Changchang Ding; Yan Huang 001 (SP, 2025)