Paper 2021/1123
Oblivious RAM with Worst-Case Logarithmic Overhead
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, and Elaine Shi
Abstract
We present the first Oblivious RAM (ORAM) construction that for
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in CRYPTO 2021
- DOI
- 10.1007/978-3-030-84259-8_21
- Keywords
- Oblivious RAM
- Contact author(s)
-
Gilad asharov @ biu ac il
weikaili @ cs cmu edu
runting @ gmail com
ilankom10 @ gmail com - History
- 2022-03-08: revised
- 2021-09-06: received
- See all versions
- Short URL
- https://ia.cr/2021/1123
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1123, author = {Gilad Asharov and Ilan Komargodski and Wei-Kai Lin and Elaine Shi}, title = {Oblivious {RAM} with Worst-Case Logarithmic Overhead}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1123}, year = {2021}, doi = {10.1007/978-3-030-84259-8_21}, url = {https://eprint.iacr.org/2021/1123} }