Pages that link to "Item:Q4910289"
From MaRDI portal
The following pages link to Distributed Oblivious RAM for Secure Two-Party Computation (Q4910289):
Displaying 26 items.
- 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)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← 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)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← 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)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
