Media Summary: Can we design a private variant of "Google search" that would enable users to search the Internet privately without revealing their ... Abstract: How to securely delegate storage to an untrusted server? The access pattern to the storage often divulges sensitive ... Abstract: An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (J. ACM 1996), is a (probabilistic) RAM that hides its ...

Wei Kai Lin Doubly Efficient - Detailed Analysis & Overview

Can we design a private variant of "Google search" that would enable users to search the Internet privately without revealing their ... Abstract: How to securely delegate storage to an untrusted server? The access pattern to the storage often divulges sensitive ... Abstract: An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (J. ACM 1996), is a (probabilistic) RAM that hides its ... Abstract: Can we design a private variant of "Google search" that would enable users to search the Internet privately without ... ITC Conference July 24 - 26, 2021 Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions ( Date: 2026-08-26 Speaker: Matthew Man-Hou Hong (MIT) Abstract: We show that every language in PSPACE that is decidable by ...

Photo Gallery

Wei-kai Lin: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 2
Wei Kai Lin - MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM
Wei-kai Lin: Lower Bound for Oblivious RAM with Large Cells
STOC 2023 - Session 3 - Doubly Efficient Private Information Retrieval
A Logarithmic Lower Bound for Oblivious RAM (for all parameters)
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
Daniel Wichs: Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation
2021 ITC Conference: Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions
Oblivious RAM with Worst-Case Logarithmic Overhead
Towards a Doubly Efficient IP = PSPACE
Ethan Mook: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 1
Wei Kai Lin Wins First APT Mixed Games Championship | APT Championship 2025
View Detailed Profile
Wei-kai Lin: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 2

Wei-kai Lin: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 2

Can we design a private variant of "Google search" that would enable users to search the Internet privately without revealing their ...

Wei Kai Lin - MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM

Wei Kai Lin - MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM

Abstract: How to securely delegate storage to an untrusted server? The access pattern to the storage often divulges sensitive ...

Wei-kai Lin: Lower Bound for Oblivious RAM with Large Cells

Wei-kai Lin: Lower Bound for Oblivious RAM with Large Cells

Abstract: An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (J. ACM 1996), is a (probabilistic) RAM that hides its ...

STOC 2023 - Session 3 - Doubly Efficient Private Information Retrieval

STOC 2023 - Session 3 - Doubly Efficient Private Information Retrieval

Doubly Efficient

A Logarithmic Lower Bound for Oblivious RAM (for all parameters)

A Logarithmic Lower Bound for Oblivious RAM (for all parameters)

Paper by Ilan Komargodski,

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE

Daniel Wichs (Northeastern University) https://simons.berkeley.edu/talks/daniel-wichs-northeastern-university-2023-05-04 ...

Daniel Wichs: Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation

Daniel Wichs: Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation

Abstract: Can we design a private variant of "Google search" that would enable users to search the Internet privately without ...

2021 ITC Conference: Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions

2021 ITC Conference: Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions

ITC Conference July 24 - 26, 2021 Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions (

Oblivious RAM with Worst-Case Logarithmic Overhead

Oblivious RAM with Worst-Case Logarithmic Overhead

... Komargodski,

Towards a Doubly Efficient IP = PSPACE

Towards a Doubly Efficient IP = PSPACE

Date: 2026-08-26 Speaker: Matthew Man-Hou Hong (MIT) Abstract: We show that every language in PSPACE that is decidable by ...

Ethan Mook: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 1

Ethan Mook: Doubly Efficient PIR and Fully Homomorphic RAM Computation from Ring LWE Part 1

Can we design a private variant of "Google search" that would enable users to search the Internet privately without revealing their ...

Wei Kai Lin Wins First APT Mixed Games Championship | APT Championship 2025

Wei Kai Lin Wins First APT Mixed Games Championship | APT Championship 2025

Wei Kai Lin

CHUA LIN WEI B24CS0011 TASK 4 GEOMETRIC MODELING

CHUA LIN WEI B24CS0011 TASK 4 GEOMETRIC MODELING

CHUA