Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off

DOI10.1007/S12095-024-00745-8MaRDI QIDQ6995233zbMATH OpenFDO

Authors Vladimir Kolesnikov, Stanislav Peceny, Ni Trieu, Xiao Wang

Publication date 22 April 2025

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-024-00745-8

zbMATH Keywords

cryptographyefficient protocolsORAMsecure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• \textsc{EpiGRAM}: practical garbled RAM
• Asymptotically tight bounds for composing ORAM with PIR
• Distributed Oblivious RAM for Secure Two-Party Computation
• Efficient 3-party distributed ORAM
• Foundations of differentially oblivious algorithms
• How to garble RAM programs?
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Simple and efficient two-server ORAM
• Software protection and simulation on oblivious RAMs
• Sub-logarithmic distributed oblivious RAM with small block size
• Three-party ORAM for secure computation

This page was built for publication: Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995233)