Wei-Kai Lin
(he/him)
Postdoctoral Research Associate
Research Interests
- Security and privacy
- Algorithms and theory
- Cryptography
Education
- PhD in Computer Science, Cornell University
- MS in Electrical Engineering, National Taiwan University
- BS in Chemistry, National Taiwan University
Biography
Wei-Kai Lin is a postdoctoral research associate at the Khoury College of Computer Sciences at Northeastern University, advised by Daniel Wichs. His research focuses on security and privacy, algorithms and theory, and cryptography.
Prior to joining Northeastern in 2022, Lin earned his doctorate in computer science from Cornell University. He had also worked as a research assistant at Academia Sinica —Taiwan and a senior software engineer at Mstar Semiconductor. Lin’s research has been published in the 2022 Symposium on Discrete Algorithms (SODA), Crypto (2021) and Eurocrypt (2020). In addition, he has also presented at conferences such as Asiacrypt, TCC, ITC and ITCS. Outside of academic research, Lin is a serious runner and cyclist.
Recent Publications
-
Optimal Sorting Circuits for Short Keys
Citation: W.K. Lin & E. Shi. (2022). Optimal Sorting Circuits for Short Keys. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 3583-3629). Society for Industrial and Applied Mathematics. DOI: 10.48550/arXiv.2102.11489 -
Optimal Oblivious Parallel RAM
Citation: G. Asharov, I. Komargodski, W.K. Lin, E. Peserico, E. Shi. (2022). Optimal Oblivious Parallel RAM. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 2459-2521). Society for Industrial and Applied Mathematics. DOI: 10.1137/1.9781611977073.98 -
A Logarithmic Lower Bound for Oblivious RAM (For All Parameters)
Citation: I. Komargodski, W.K. Lin. (2021). A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021. CRYPTO 2021. Lecture Notes in Computer Science(), vol 12828. Springer, Cham. DOI: 10.1007/978-3-030-84259-8_20 -
Oblivious RAM with Worst-Case Logarithmic Overhead
Citation: G. Asharov, I. Komargodski, W.K. Lin, E. Shi. (2021). Oblivious RAM with Worst-Case Logarithmic Overhead. In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021. CRYPTO 2021. Lecture Notes in Computer Science(), vol 12828. Springer, Cham. DOI: 10.1007/978-3-030-84259-8_21 -
OptORAMa: Optimal Oblivious RAM
Citation: G. Asharov, I. Komargodski, W.K. Lin, K. Nayak, E. Peserico, E. Shi. (2020). OptORAMa: Optimal Oblivious RAM. In: Canteaut, A., Ishai, Y. (eds) Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT 2020. Lecture Notes in Computer Science(), vol 12106. Springer, Cham. DOI: 10.1007/978-3-030-45724-2_1
