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

DOI10.1007/978-3-030-57990-6_13zbMath1506.94039OpenAlexW3021651652MaRDI QIDQ2106644

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)

Related Items (3)

Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Random-index oblivious RAM ⋮ Oblivious RAM with worst-case logarithmic overhead

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