The following pages link to Path ORAM (Q4561506):
Displayed 18 items.
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← 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)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← 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)
- PAC privacy: automatic privacy measurement and control of data processing (Q6145927) (← links)
- \textsf{MacORAMa}: optimal oblivious RAM with integrity (Q6190099) (← links)