Succinct oblivious RAM
From MaRDI portal
Publication:3304151
DOI10.4230/LIPICS.STACS.2018.52zbMATH Open1487.68097arXiv1804.08285MaRDI QIDQ3304151FDOQ3304151
Authors: Taku Onodera, Tetsuo Shibuya 
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1804.08285
Recommendations
Cites Work
- Succinct representation of balanced parentheses and static trees
- Fully functional static and dynamic succinct trees
- Compressed representations of sequences and full-text indexes
- Indexing compressed text
- Title not available (Why is that?)
- Optimal Dynamic Sequence Representations
- Representing trees of higher degree
- Balanced Allocations
- Cuckoo hashing
- Space-efficient frameworks for top-\(k\) string retrieval
- Rank/select operations on large alphabets
- Title not available (Why is that?)
- Space efficient suffix trees
- Squeezing succinct data structures into entropy bounds
- Ultra-succinct representation of ordered trees
- Oblivious RAM Revisited
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Title not available (Why is that?)
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Balanced allocations: the heavily loaded case
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Onion ORAM: a constant bandwidth blowup oblivious RAM
Cited In (5)
This page was built for publication: Succinct oblivious RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304151)
