Paper 2023/991
Fast ORAM with Server-aided Preprocessing and Pragmatic Privacy-Efficiency Trade-off
Abstract
Data-dependent accesses to memory are necessary for many real-world applications, but their cost remains prohibitive in secure computation. Prior work either focused on minimizing the need for data-dependent access in these applications, or reduced its cost by improving oblivious RAM for secure computation (SC-ORAM). Despite extensive efforts to improve SC-ORAM, the most concretely efficient solutions still require
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. CSCML 2023 and extended version in Cryptography and Communications 2024
- Keywords
- CryptographySecure computationEfficient protocolsOblivious RAM
- Contact author(s)
-
kolesnikov @ gatech edu
stan peceny @ gatech edu
nitrieu @ asu edu
wangxiao1254 @ gmail com - History
- 2024-10-17: revised
- 2023-06-26: received
- See all versions
- Short URL
- https://ia.cr/2023/991
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/991, author = {Vladimir Kolesnikov and Stanislav Peceny and Ni Trieu and Xiao Wang}, title = {Fast {ORAM} with Server-aided Preprocessing and Pragmatic Privacy-Efficiency Trade-off}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/991}, year = {2023}, url = {https://eprint.iacr.org/2023/991} }