default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei-Kai Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. CRYPTO (8) 2024: 240-273- 2023
- [j5]Gilad Asharov
, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023) - [j4]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. 36(2): 7 (2023) - [c22]Yi-Ming Chang, Ti-Li Lin, Hung-Chun Chi, Wei-Kai Lin:
Deep Learning-based AOI System for Detecting Component Marks. BigComp 2023: 243-247 - [c21]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. EUROCRYPT (1) 2023: 395-425 - [c20]Andrew Park, Wei-Kai Lin, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. EUROCRYPT (1) 2023: 456-486 - [c19]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. STOC 2023: 595-608 - 2022
- [j3]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size ${o(n \log n)}$. SIAM J. Comput. 51(3): 424-466 (2022) - [c18]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. SODA 2022: 2459-2521 - [c17]Wei-Kai Lin, Elaine Shi:
Optimal Sorting Circuits for Short Keys. SODA 2022: 3583-3629 - [i18]Andrew Park, Wei-Kai Lin, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. IACR Cryptol. ePrint Arch. 2022: 191 (2022) - [i17]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 609 (2022) - [i16]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. IACR Cryptol. ePrint Arch. 2022: 1703 (2022) - 2021
- [b1]Wei-Kai Lin:
Optimal Oblivious RAM and Its Extensions. Cornell University, USA, 2021 - [c16]T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak:
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. ITC 2021: 8:1-8:23 - [c15]Ilan Komargodski, Wei-Kai Lin:
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). CRYPTO (4) 2021: 579-609 - [c14]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) 2021: 610-640 - [c13]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size o(n log n). SODA 2021: 2249-2268 - [i15]Wei-Kai Lin, Elaine Shi:
Optimal Sorting Circuits for Short Keys. CoRR abs/2102.11489 (2021) - [i14]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2021: 1123 (2021) - 2020
- [c12]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) 2020: 403-432 - [c11]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. ITC 2020: 11:1-11:23 - [c10]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. ITCS 2020: 75:1-75:52 - [i13]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size o(n log n). CoRR abs/2010.09884 (2020) - [i12]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020: 125 (2020) - [i11]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. IACR Cryptol. ePrint Arch. 2020: 240 (2020) - [i10]T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. IACR Cryptol. ePrint Arch. 2020: 604 (2020) - [i9]Ilan Komargodski, Wei-Kai Lin:
Lower Bound for Oblivious RAM with Large Cells. IACR Cryptol. ePrint Arch. 2020: 1132 (2020) - [i8]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020: 1292 (2020)
2010 – 2019
- 2019
- [j2]Pei-Chen Lin, Hsu-Cheng Huang, Matthieu Komorowski, Wei-Kai Lin, Chun-Min Chang, Kuan-Ta Chen, Yu-Chuan Li, Ming-Chin Lin:
A machine learning approach for predicting urine output after fluid administration. Comput. Methods Programs Biomed. 177: 155-159 (2019) - [j1]Chin-Chi Kuo, Chun-Min Chang, Kuan-Ting Liu, Wei-Kai Lin, Hsiu-Yin Chiang, Chih-Wei Chung, Meng-Ru Ho, Pei-Ran Sun, Rong-Lin Yang, Kuan-Ta Chen:
Automation of the kidney function prediction and classification through ultrasound-based kidney imaging using deep learning. npj Digit. Medicine 2 (2019) - [c9]Wei-Kai Lin, Elaine Shi, Tiancheng Xie:
Can We Overcome the n log n Barrier for Oblivious Sorting? SODA 2019: 2419-2438 - 2018
- [c8]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Cache-Oblivious and Data-Oblivious Sorting and Applications. SODA 2018: 2201-2220 - [c7]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-party Coin Toss. TCC (1) 2018: 563-596 - [i7]Wei-Kai Lin, Elaine Shi, Tiancheng Xie:
Can We Overcome the n log n Barrier for Oblivious Sorting? IACR Cryptol. ePrint Arch. 2018: 227 (2018) - [i6]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. 2018: 892 (2018) - [i5]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-Party Coin Toss. IACR Cryptol. ePrint Arch. 2018: 1076 (2018) - 2017
- [c6]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. ASIACRYPT (1) 2017: 660-690 - [i4]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Cache-Oblivious and Data-Oblivious Sorting and Applications. IACR Cryptol. ePrint Arch. 2017: 914 (2017) - [i3]T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi:
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. IACR Cryptol. ePrint Arch. 2017: 924 (2017) - 2016
- [c5]Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Cryptography for Parallel RAM from Indistinguishability Obfuscation. ITCS 2016: 179-190 - [c4]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. TCC (B2) 2016: 3-30 - 2015
- [i2]Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Computation-Trace Indistinguishability Obfuscation and its Applications. IACR Cryptol. ePrint Arch. 2015: 406 (2015) - [i1]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. IACR Cryptol. ePrint Arch. 2015: 1082 (2015) - 2012
- [c3]Yeong-Lin Lai, Wei-Kai Lin:
3D high-brightness autostereoscopic display systems with LED backlight. ICCE 2012: 614-615
2000 – 2009
- 2009
- [c2]Wei-Kai Lin, Tian-Li Yu:
Co-evolvability of games in coevolutionary genetic algorithms. GECCO 2009: 1869-1870 - 2008
- [c1]Tian-Li Yu, Wei-Kai Lin:
Optimal sampling of genetic algorithms on polynomial regression. GECCO 2008: 1089-1096
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
