Succinct Adaptive Garbled RAM. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2015)

On the Correlation Intractability of Obfuscated Pseudorandom Functions. - Ran Canetti; Yilei Chen 001; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2015)

Adaptive Succinct Garbled RAM or: How to Delegate Your Database. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Mariana Raykova 001 (TCC (B2), 2016)

An Alternative View of the Graph-Induced Multilinear Maps. - Yilei Chen 001 (IACR Cryptol. ePrint Arch., 2016)

Cryptanalyses of Candidate Branching Program Obfuscators. - Yilei Chen 001; Craig Gentry; Shai Halevi (IACR Cryptol. ePrint Arch., 2016)

Constraint-Hiding Constrained PRFs for NC1 from LWE. - Ran Canetti; Yilei Chen 001 (EUROCRYPT (1), 2017)

Constraint-hiding Constrained PRFs for NC1 from LWE. - Ran Canetti; Yilei Chen 001 (IACR Cryptol. ePrint Arch., 2017)

Fiat-Shamir From Simpler Assumptions. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. - Ran Canetti; Yilei Chen 001; Leonid Reyzin; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. - Yilei Chen 001; Vinod Vaikuntanathan; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2018)

Traitor-Tracing from LWE Made Simple and Attribute-Based. - Yilei Chen 001; Vinod Vaikuntanathan; Brent Waters; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Hiding secrets in public random functions - Yilei Chen 001 (2018)

Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion. - Salim Ali Altug; Yilei Chen 001 (ASIACRYPT (2), 2019)

Fiat-Shamir: from practice to theory. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum; Daniel Wichs (STOC, 2019)

Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space. - Binyi Chen; Yilei Chen 001; Kristina Hostáková; Pratyay Mukherjee (IACR Cryptol. ePrint Arch., 2019)

Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures. - Yilei Chen 001; Nicholas Genise; Pratyay Mukherjee (IACR Cryptol. ePrint Arch., 2019)

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. - Yilei Chen 001; Minki Hhan; Vinod Vaikuntanathan; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2019)

Does Fiat-Shamir Require a Cryptographic Hash Function? - Yilei Chen 001; Alex Lombardi; Fermi Ma; Willy Quach (IACR Cryptol. ePrint Arch., 2020)

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. - Yilei Chen 001; Qipeng Liu 001; Mark Zhandry (Electron. Colloquium Comput. Complex., 2021)

White-box Cryptography with Device Binding from Token-based Obfuscation and more. - Shashank Agrawal; Estuardo Alpirez Bock; Yilei Chen 001; Gaven J. Watson (IACR Cryptol. ePrint Arch., 2021)

On Removing Rejection Conditions in Practical Lattice-Based Signatures. - Rouzbeh Behnia; Yilei Chen 001; Daniel Masny (IACR Cryptol. ePrint Arch., 2021)

Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs. - Li Yao; Yilei Chen 001; Yu Yu 001 (IACR Cryptol. ePrint Arch., 2021)

White-Box Cryptography with Global Device Binding from Message-Recoverable Signatures and Token-Based Obfuscation. - Shashank Agrawal; Estuardo Alpirez Bock; Yilei Chen 001; Gaven J. Watson (COSADE, 2023)

On the Hardness of S|LWE〉 with Gaussian and Other Amplitudes. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (CoRR, 2023)

On the Hardness of $ sf{S|LWE rangle}$ with Gaussian and Other Amplitudes. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (IACR Cryptol. ePrint Arch., 2023)

Practically Solving LPN in High Noise Regimes Faster Using Neural Networks. - Haozhe Jiang; Kaiyue Wen; Yilei Chen 001 (IACR Cryptol. ePrint Arch., 2023)

LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling. - Yilei Chen 001; Zihan Hu; Qipeng Liu 001; Han Luo; Yaxin Tu (CRYPTO (2), 2025)