Abstract
Oblivious compaction is a crucial building block for hash-based oblivious RAM. Asharov et al. recently gave a O(n) algorithm for oblivious tight compaction[2]. Their algorithm is deterministic and asymptotically optimal, but the implied constant is $${\gg }2^{111}$$. We give a new algorithm for oblivious tight compaction that runs in time $${
Cite
CITATION STYLE
Dittmer, S., & Ostrovsky, R. (2020). Oblivious tight compaction in o(n) time with smaller constant. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12238 LNCS, pp. 253–274). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57990-6_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
