Pages that link to "Item:Q3102186"
From MaRDI portal
The following pages link to Oblivious RAM with O((logN)3) Worst-Case Cost (Q3102186):
Displayed 39 items.
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions (Q2799096) (← links)
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database (Q2817461) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- (Q3304151) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- 3D Visibility Representations of 1-planar Graphs (Q4625104) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- (Q5743385) (← links)
- (Q5743386) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)
- A theory of composition for differential obliviousness (Q6085261) (← links)
- M-ORAM Revisited: Security and Construction Updates (Q6108627) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead (Q6138098) (← links)
- \textsf{MacORAMa}: optimal oblivious RAM with integrity (Q6190099) (← links)
- Multi-user image retrieval with suppression of search pattern leakage (Q6195205) (← links)