Wei-Kai Lin

Orcid: 0000-0001-6012-7124

According to our database1, Wei-Kai Lin authored at least 30 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Oblivious RAM with Worst-Case Logarithmic Overhead.
J. Cryptol., April, 2023

OptORAMa: Optimal Oblivious RAM.
J. ACM, February, 2023

Deep Learning-based AOI System for Detecting Component Marks.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2023

2022
Sorting Short Keys in Circuits of Size ${o(n \log n)}$.
SIAM J. Comput., 2022

Optimal Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2022

NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead.
IACR Cryptol. ePrint Arch., 2022

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE.
IACR Cryptol. ePrint Arch., 2022

Optimal Sorting Circuits for Short Keys.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Optimal Oblivious RAM and Its Extensions.
PhD thesis, 2021

Sorting Short Keys in Circuits of Size <i>o</i>(<i>n</i> log <i>n</i>).
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Logarithmic Lower Bound for Oblivious RAM (for All Parameters).
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Lower Bound for Oblivious RAM with Large Cells.
IACR Cryptol. ePrint Arch., 2020

Perfectly Secure Oblivious Parallel RAM with O(log<sup>3</sup> N/ log log N) Overhead.
IACR Cryptol. ePrint Arch., 2020

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.
IACR Cryptol. ePrint Arch., 2020

Optimal Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch., 2020

Oblivious Parallel Tight Compaction.
IACR Cryptol. ePrint Arch., 2020

2019
Automation of the kidney function prediction and classification through ultrasound-based kidney imaging using deep learning.
npj Digit. Medicine, 2019

A machine learning approach for predicting urine output after fluid administration.
Comput. Methods Programs Biomed., 2019

2018
Can We Overcome the n log n Barrier for Oblivious Sorting?
IACR Cryptol. ePrint Arch., 2018

Game Theoretic Notions of Fairness in Multi-Party Coin Toss.
IACR Cryptol. ePrint Arch., 2018

OptORAMa: Optimal Oblivious RAM.
IACR Cryptol. ePrint Arch., 2018

2017
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
IACR Cryptol. ePrint Arch., 2017

Cache-Oblivious and Data-Oblivious Sorting and Applications.
IACR Cryptol. ePrint Arch., 2017

2016
Cryptography for Parallel RAM from Indistinguishability Obfuscation.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Computation-Trace Indistinguishability Obfuscation and its Applications.
IACR Cryptol. ePrint Arch., 2015

Delegating RAM Computations with Adaptive Soundness and Privacy.
IACR Cryptol. ePrint Arch., 2015

2012
3D high-brightness autostereoscopic display systems with LED backlight.
Proceedings of the IEEE International Conference on Consumer Electronics, 2012

2009
Co-evolvability of games in coevolutionary genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008
Optimal sampling of genetic algorithms on polynomial regression.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008


  Loading...