The following pages link to (Q5743385):
Displaying 26 items.
- 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)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- Succinct oblivious RAM (Q3304151) (← 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)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Random-index oblivious RAM (Q6169549) (← links)
- Multi-client Oblivious RAM Secure Against Malicious Servers (Q6487224) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
