| 2025 | CCS | MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM. | Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin |
| 2025 | EuroCrypt | Black Box Crypto is Useless for Doubly Efficient PIR. | Wei-Kai Lin, Ethan Mook, Daniel Wichs |
| 2025 | TCC | Lower Bounds on Inner-Product Functional Encryption from All-or-Nothing Encryption Primitives. | Jinye He, Shiyu Li, Wei-Kai Lin |
| 2025 | TCC | Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption. | Wei-Kai Lin, Zhenghao Lu, Hong-Sheng Zhou |
| 2024 | CRYPTO | Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. | Wei-Kai Lin, Ethan Mook, Daniel Wichs |
| 2023 | EuroCrypt | NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. | Andrew Park, Wei-Kai Lin, Elaine Shi |
| 2023 | EuroCrypt | Optimal Single-Server Private Information Retrieval. | Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi |
| 2023 | STOC | Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. | Wei-Kai Lin, Ethan Mook, Daniel Wichs |
| 2022 | SODA | Optimal Oblivious Parallel RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi |
| 2022 | SODA | Optimal Sorting Circuits for Short Keys. | Wei-Kai Lin, Elaine Shi |
| 2021 | CRYPTO | Oblivious RAM with Worst-Case Logarithmic Overhead. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi |
| 2021 | CRYPTO | A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). | Ilan Komargodski, Wei-Kai Lin |
| 2021 | SODA | Sorting Short Keys in Circuits of Size | Gilad Asharov, Wei-Kai Lin, Elaine Shi |
| 2020 | EuroCrypt | OptORAMa: Optimal Oblivious RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi |
| 2019 | SODA | Can We Overcome the n log n Barrier for Oblivious Sorting? | Wei-Kai Lin, Elaine Shi, Tiancheng Xie |
| 2018 | SODA | Cache-Oblivious and Data-Oblivious Sorting and Applications. | T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi |
| 2018 | TCC | Game Theoretic Notions of Fairness in Multi-party Coin Toss. | Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi |
| 2017 | ASIACRYPT | Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. | T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi |
| 2016 | TCC | Delegating RAM Computations with Adaptive Soundness and Privacy. | Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin |
| 2009 | GECCO | Co-evolvability of games in coevolutionary genetic algorithms. | Wei-Kai Lin, Tian-Li Yu |
| 2008 | GECCO | Optimal sampling of genetic algorithms on polynomial regression. | Tian-Li Yu, Wei-Kai Lin |