Homomorphic encryption from codes. - Andrej Bogdanov; Chin Ho Lee (IACR Cryptol. ePrint Arch., 2011)

Limits of provable security for homomorphic encryption. - Andrej Bogdanov; Chin Ho Lee (Electron. Colloquium Comput. Complex., 2012)

On the depth complexity of homomorphic encryption schemes. - Andrej Bogdanov; Chin Ho Lee (Electron. Colloquium Comput. Complex., 2012)

Some limitations of the sum of small-bias distributions. - Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2015)

Homomorphic evaluation requires depth. - Andrej Bogdanov; Chin Ho Lee (IACR Cryptol. ePrint Arch., 2015)

Bounded independence vs. moduli. - Ravi B. Boppana; Johan Håstad; Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2016)

The coin problem for product tests. - Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2017)

More on bounded independence plus noise: Pseudorandom generators for read-once polynomials. - Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2017)

Bounded Independence Plus Noise Fools Products. - Elad Haramaty; Chin Ho Lee; Emanuele Viola (SIAM J. Comput., 2018)

Fourier bounds and pseudorandom generators for product tests. - Chin Ho Lee (Electron. Colloquium Comput. Complex., 2019)

Bounded Independence versus Symmetric Tests. - Ravi B. Boppana; Johan Håstad; Chin Ho Lee; Emanuele Viola (ACM Trans. Comput. Theory, 2019)

Fractional Pseudorandom Generators from Any Fourier Level. - Eshan Chattopadhyay; Jason Gaitonde; Chin Ho Lee; Shachar Lovett; Abhishek Shetty (CCC, 2021)

Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ITCS, 2021)

Fourier growth of structured $ mathbb{F}_2$-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (CoRR, 2021)

Fourier growth of structured 𝔽2-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (Electron. Colloquium Comput. Complex., 2021)

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2022)

Fourier Growth of Regular Branching Programs. - Chin Ho Lee; Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2022)

Approximate Trace Reconstruction from a Single Trace. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2023)

On the Power of Regular and Permutation Branching Programs. - Chin Ho Lee; Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2023)

Trace Reconstruction from Local Statistical Queries. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio (APPROX/RANDOM, 2024)

Pseudorandomness, symmetry, smoothing: I. - Harm Derksen; Peter Ivanov; Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2025)

Pseudorandomness, symmetry, smoothing: II. - Harm Derksen; Peter Ivanov; Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2025)

Boosting uniformity in quasirandom groups: fast and simple. - Harm Derksen; Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2025)

Pseudorandom bits for non-commutative programs. - Chin Ho Lee; Emanuele Viola (Electron. Colloquium Comput. Complex., 2025)

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ACM Trans. Algorithms, 2025)