120 citations · 122 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 2 cited
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
Gilad Asharov, T-H. Hubert Chan, Kartik Nayak +3
We propose a conceptually simple oblivious sort and oblivious random permutation algorithms called bucket oblivious sort and bucket oblivious random permutation. Bucket oblivious s…
cs.CR2012★ 120 cited
Path ORAM: An Extremely Simple Oblivious RAM Protocol
Emil Stefanov, Marten van Dijk, Elaine Shi +5
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme kn…