A Simple FPTAS for Counting Edge Covers. - Chengyu Lin 001; Jingcheng Liu 001; Pinyan Lu (SODA, 2014)

Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers. - Chengyu Lin 001; Shengyu Zhang (ICALP, 2017)

Subspace Embedding and Linear Regression with Orlicz Norm. - Alexandr Andoni; Chengyu Lin 001; Ying Sheng 004; Peilin Zhong; Ruiqi Zhong (ICML, 2018)

Secretary markets with local information. - Ning Chen 005; Martin Hoefer 001; Marvin Künnemann; Chengyu Lin 001; Peihan Miao 001 (Distributed Comput., 2019)

Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation. - Yuan Kang; Chengyu Lin 001; Tal Malkin; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2019)

Can a Public Blockchain Keep a Secret? - Fabrice Benhamouda; Craig Gentry; Sergey Gorbunov 001; Shai Halevi; Hugo Krawczyk; Chengyu Lin 001; Tal Rabin; Leonid Reyzin (TCC (1), 2020)

Can a Blockchain Keep a Secret? - Fabrice Benhamouda; Craig Gentry; Sergey Gorbunov 001; Shai Halevi; Hugo Krawczyk; Chengyu Lin 001; Tal Rabin; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2020)

XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE. - Chengyu Lin 001; Zeyu Liu 004; Tal Malkin (ESORICS (1), 2022)

Enhancing Ring-LWE Hardness using Dedekind Index Theorem. - Charanjit S. Jutla; Chengyu Lin 001 (IACR Cryptol. ePrint Arch., 2022)

Ring-LWE: Enhanced Foundations and Applications - Chengyu Lin 001 (2022)

Ring-LWE Hardness Based on Ideals of Hidden Orders of Number Fields. - Charanjit S. Jutla; Chengyu Lin 001 (IACR Cryptol. ePrint Arch., 2023)

New Distinguishers for Negation-Limited Weak Pseudorandom Functions. - Zhihuai Chen; Siyao Guo; Qian Li 012; Chengyu Lin 001; Xiaoming Sun 001 (Theory Comput., 2024)

Finding Balance in Unbalanced PSI: A New Construction from Single-Server PIR. - Chengyu Lin 001; Zeyu Liu 004; Peihan Miao 001; Max Tromanhauser (IACR Commun. Cryptol., 2025)