The following pages link to Wei-Kai Lin (Q1629435):
Displayed 17 items.
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM (Q2412887) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Cryptography for Parallel RAM from Indistinguishability Obfuscation (Q2800564) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- (Q4608037) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Can We Overcome the <i>n</i> log <i>n</i> Barrier for Oblivious Sorting? (Q5236337) (← links)
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture (Q5875782) (← links)
- Oblivious parallel tight compaction (Q6059370) (← links)
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. (Q6107257) (← links)
- Optimal single-server private information retrieval (Q6138096) (← links)
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead (Q6138098) (← links)
- (Q6147390) (← links)