RICH: Automatically Protecting Against Integer-Based Vulnerabilities. - David Brumley; Dawn Xiaodong Song; Tzi-cker Chiueh; Rob Johnson 001; Huijia Lin (NDSS, 2007)

Composable Information Gradients in Wireless Sensor Networks. - Huijia Lin; Maohua Lu; Nikola Milosavljevic; Jie Gao 001; Leonidas J. Guibas (IPSN, 2008)

Concurrent Non-malleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2008)

Non-malleability amplification. - Huijia Lin; Rafael Pass (STOC, 2009)

A unified framework for concurrent security: universal composability from stand-alone non-malleability. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (STOC, 2009)

Concurrent Non-Malleable Zero Knowledge Proofs. - Huijia Lin; Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (CRYPTO, 2010)

Constant-round Non-Malleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2010)

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. - Huijia Lin; Rafael Pass (TCC, 2011)

Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. - Shafi Goldwasser; Huijia Lin; Aviad Rubinstein (IACR Cryptol. ePrint Arch., 2011)

After-the-Fact Leakage in Public-Key Encryption. - Shai Halevi; Huijia Lin (IACR Cryptol. ePrint Arch., 2011)

A Unified Framework for UC from Only OT. - Rafael Pass; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT, 2012)

Black-Box Constructions of Composable Protocols without Set-Up. - Huijia Lin; Rafael Pass (CRYPTO, 2012)

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. - Kai-Min Chung; Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

Concurrent Security. - Huijia Lin (2012)

Amplification of Chosen-Ciphertext Security. - Huijia Lin; Stefano Tessaro (EUROCRYPT, 2013)

From Unprovability to Environmentally Friendly Protocols. - Ran Canetti; Huijia Lin; Rafael Pass (FOCS, 2013)

Constant-Round Concurrent Zero Knowledge from P-Certificates. - Kai-Min Chung; Huijia Lin; Rafael Pass (FOCS, 2013)

On the power of nonuniformity in proofs of security. - Kai-Min Chung; Huijia Lin; Mohammad Mahmoody; Rafael Pass (ITCS, 2013)

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. - Ran Canetti; Huijia Lin; Omer Paneth (TCC, 2013)

Leakage-Tolerant Computation with Input-Independent Preprocessing. - Nir Bitansky; Dana Dachman-Soled; Huijia Lin (CRYPTO (2), 2014)

The Computational Benefit of Correlated Instances. - Irit Dinur; Shafi Goldwasser; Huijia Lin (Electron. Colloquium Comput. Complex., 2014)

Obfuscation of Probabilistic Circuits and Applications. - Ran Canetti; Huijia Lin; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2014)

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation. - Kai-Min Chung; Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Succinct Garbling Schemes and Applications. - Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. - Vipul Goyal; Huijia Lin; Omkant Pandey; Rafael Pass; Amit Sahai (TCC (1), 2015)

Delegating RAM Computations with Adaptive Soundness and Privacy. - Prabhanjan Ananth; Yu-Chi Chen; Kai-Min Chung; Huijia Lin; Wei-Kai Lin (IACR Cryptol. ePrint Arch., 2015)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Huijia Lin; Rafael Pass; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. - Binyi Chen; Huijia Lin; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2015)

Output-Compressing Randomized Encodings and Applications. - Huijia Lin; Rafael Pass; Karn Seth; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

Constant-Round Nonmalleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass (J. ACM, 2015)

TaoStore: Overcoming Asynchronicity in Oblivious Data Storage. - Cetin Sahin; Victor Zakhary; Amr El Abbadi; Huijia Lin; Stefano Tessaro (IEEE Symposium on Security and Privacy, 2016)

On Removing Graded Encodings from Functional Encryption. - Nir Bitansky; Huijia Lin; Omer Paneth (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes. - Huijia Lin (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs. - Huijia Lin (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation with Non-trivial Efficiency. - Huijia Lin; Rafael Pass; Karn Seth; Sidharth Telang (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings. - Huijia Lin; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2016)

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. - Ran Canetti; Huijia Lin; Rafael Pass (SIAM J. Comput., 2016)

Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs. - Huijia Lin (CRYPTO (1), 2017)

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs. - Huijia Lin; Stefano Tessaro (CRYPTO (1), 2017)

Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses. - Cetin Sahin; Aaron Magat; Victor Zakhary; Amr El Abbadi; Huijia (Rachel) Lin; Stefano Tessaro (ICDE, 2017)

k-Round MPC from k-Round OT via Garbled Interactive Circuits. - Fabrice Benhamouda; Huijia Lin (IACR Cryptol. ePrint Arch., 2017)

Foundations of Homomorphic Secret Sharing. - Elette Boyle; Niv Gilboa; Yuval Ishai; Huijia Lin; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2017)

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. - Susumu Kiyoshima; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. - Huijia Lin; Rafael Pass; Pratik Soni (IACR Cryptol. ePrint Arch., 2017)

Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs. - Huijia Lin; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2017)

The Hunting of the SNARK. - Nir Bitansky; Ran Canetti; Alessandro Chiesa; Shafi Goldwasser; Huijia Lin; Aviad Rubinstein; Eran Tromer (J. Cryptol., 2017)

Pharos: Privacy Hazards of Replicating ORAM Stores. - Victor Zakhary; Cetin Sahin; Amr El Abbadi; Huijia Lin; Stefano Tessaro (EDBT, 2018)

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. - Fabrice Benhamouda; Huijia Lin (EUROCRYPT (2), 2018)

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. - Fabrice Benhamouda; Huijia Lin; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (TCC (1), 2018)

Non-Malleable Codes Against Bounded Polynomial Time Tampering. - Marshall Ball; Dana Dachman-Soled; Mukul Kulkarni; Huijia Lin; Tal Malkin (IACR Cryptol. ePrint Arch., 2018)

One-Message Zero Knowledge and Non-Malleable Commitments. - Nir Bitansky; Huijia Lin (IACR Cryptol. ePrint Arch., 2018)

Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation. - Huijia Lin; Christian Matt 002 (IACR Cryptol. ePrint Arch., 2018)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. - Nir Bitansky; Ran Canetti; Sanjam Garg; Justin Holmgren; Abhishek Jain 002; Huijia Lin; Rafael Pass; Sidharth Telang; Vinod Vaikuntanathan (SIAM J. Comput., 2018)

How to Leverage Hardness of Constant-Degree Expanding Polynomials over mathbb R R to build i풪 i O. - Aayush Jain; Huijia Lin; Christian Matt 002; Amit Sahai (EUROCRYPT (1), 2019)

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. - Prabhanjan Ananth; Aayush Jain; Huijia Lin; Christian Matt 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2019)

How to leverage hardness of constant degree expanding polynomials over R to build iO. - Aayush Jain; Huijia Lin; Christian Matt 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2019)

Simplifying Constructions and Assumptions for i풪. - Aayush Jain; Huijia Lin; Amit Sahai (IACR Cryptol. ePrint Arch., 2019)

Succinct and Adaptively Secure ABE for ABP from k-Lin. - Huijia Lin; Ji Luo 002 (ASIACRYPT (3), 2020)

Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and Towards NL. - Huijia Lin; Ji Luo 002 (EUROCRYPT (3), 2020)

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. - Fabrice Benhamouda; Huijia Lin (TCC (2), 2020)

Multiparty Reusable Non-Interactive Secure Computation. - Fabrice Benhamouda; Huijia Lin (IACR Cryptol. ePrint Arch., 2020)

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification. - Romain Gay; Aayush Jain; Huijia Lin; Amit Sahai (IACR Cryptol. ePrint Arch., 2020)

Oblivious Transfer is in MiniQCrypt. - Alex B. Grilo; Huijia Lin; Fang Song 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2020)

Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL. - Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2020)

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin. - Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2020)

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More. - Huijia Lin; Tianren Liu; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2020)

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. - Huijia Lin; Rafael Pass; Pratik Soni (SIAM J. Comput., 2020)

Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk). - Huijia (Rachel) Lin (FSTTCS, 2021)

Multiparty Reusable Non-Interactive Secure Computation from LWE. - Fabrice Benhamouda; Aayush Jain; Ilan Komargodski; Huijia Lin (IACR Cryptol. ePrint Arch., 2021)

Non-malleable Commitments against Quantum Attacks. - Nir Bitansky; Huijia Lin; Omri Shmueli (IACR Cryptol. ePrint Arch., 2021)

Counterexamples to New Circular Security Assumptions Underlying iO. - Samuel B. Hopkins 001; Aayush Jain; Huijia Lin (IACR Cryptol. ePrint Arch., 2021)

Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0. - Aayush Jain; Huijia Lin; Amit Sahai (IACR Cryptol. ePrint Arch., 2021)

Indistinguishability Obfuscation from LPN over $ mathbb {F}_p$, DLIN, and PRGs in NC0. - Aayush Jain; Huijia Lin; Amit Sahai (EUROCRYPT (1), 2022)

The Pseudorandom Oracle Model and Ideal Obfuscation. - Aayush Jain; Huijia Lin; Ji Luo 002; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. - Aayush Jain; Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2022)

Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪. - Aayush Jain; Huijia Lin; Paul Lou; Amit Sahai (IACR Cryptol. ePrint Arch., 2022)

ABE for Circuits with Constant-Size Secret Keys and Adaptive Security. - Hanjun Li 001; Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2022)

Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols. - Huijia Lin; Tianren Liu (IACR Cryptol. ePrint Arch., 2022)

QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore. - Sujaya Maiyya; Seif Ibrahim; Caitlin Scarberry; Divyakant Agrawal; Amr El Abbadi; Huijia Lin; Stefano Tessaro; Victor Zakhary (IACR Cryptol. ePrint Arch., 2022)

From Pseudorandomness to Multi-Group Fairness and Back. - Cynthia Dwork; Daniel Lee; Huijia Lin; Pranay Tankala (COLT, 2023)

Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices. - Yao-Ching Hsieh; Huijia Lin; Ji Luo 002 (FOCS, 2023)

New Insights into Multi-Calibration. - Cynthia Dwork; Daniel Lee; Huijia Lin; Pranay Tankala (CoRR, 2023)

New Ways to Garble Arithmetic Circuits. - Marshall Ball; Hanjun Li 001; Huijia Lin; Tianren Liu (IACR Cryptol. ePrint Arch., 2023)

Multi-Party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN. - Quang Dao; Yuval Ishai; Aayush Jain; Huijia Lin (IACR Cryptol. ePrint Arch., 2023)

Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices: Garbled Circuits of Optimal Size, Laconic Functional Evaluation, and More. - Yao-Ching Hsieh; Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2023)

LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. - Hanjun Li 001; Huijia Lin; Antigoni Polychroniadou; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2023)

How to Simulate Random Oracles with Auxiliary Input. - Yevgeniy Dodis; Aayush Jain; Huijia Lin; Ji Luo 002; Daniel Wichs (FOCS, 2024)

How to Compress Garbled Circuit Input Labels, Efficiently. - Marian Dietz; Hanjun Li 001; Huijia Lin (IACR Cryptol. ePrint Arch., 2024)

A General Framework for Lattice-Based ABE Using Evasive Inner-Product Functional Encryption. - Yao-Ching Hsieh; Huijia Lin; Ji Luo 002 (IACR Cryptol. ePrint Arch., 2024)

Succinct Partial Garbling from Groups and Applications. - Yuval Ishai; Hanjun Li 001; Huijia Lin (IACR Cryptol. ePrint Arch., 2024)

A Systematic Study of Sparse LWE. - Aayush Jain; Huijia Lin; Sagnik Saha (IACR Cryptol. ePrint Arch., 2024)

Indistinguishability Obfuscation from Well-Founded Assumptions. - Aayush Jain; Huijia Lin; Amit Sahai (Commun. ACM, 2024)

Lattice-Based Post-quantum iO from Circular Security with Random Opening Assumption. - Yao-Ching Hsieh; Aayush Jain; Huijia Lin (CRYPTO (7), 2025)

TinyLabels: How to Compress Garbled Circuit Input Labels, Efficiently. - Marian Dietz; Hanjun Li 001; Huijia Lin (EUROCRYPT (6), 2025)

Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions). - Yao-Ching Hsieh; Aayush Jain; Huijia Lin (IACR Cryptol. ePrint Arch., 2025)

A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing. - Yuval Ishai; Hanjun Li 001; Huijia Lin (IACR Cryptol. ePrint Arch., 2025)