Oblivious tight compaction in O(n) time with smaller constant

DOI10.1007/978-3-030-57990-6_13MaRDI QIDQ2106644zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_13

zbMATH Keywords

hash-based oblivious RAM

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Cryptography (94A60)

Recommendations

• Data-oblivious data structures
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Oblivious RAM Revisited
• Perfectly secure oblivious RAM without random oracles
• Is there an oblivious RAM lower bound?

Cited in

(8)

• Oblivious RAM with \textit{worst-case} logarithmic overhead
• Oblivious RAM with worst-case logarithmic overhead
• Tight Bounds on Oblivious Chaining
• Oblivious parallel tight compaction
• Random-index oblivious RAM
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Privacy-preserving Dijkstra
• Optimal offline ORAM with perfect security via simple oblivious priority queues

This page was built for publication: Oblivious tight compaction in \(O(n)\) time with smaller constant

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