Pages that link to "Item:Q3000537"
From MaRDI portal
The following pages link to Perfectly Secure Oblivious RAM without Random Oracles (Q3000537):
Displayed 21 items.
- 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)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (Q3012949) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← 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)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- (Q5743385) (← links)
- (Q5743386) (← links)
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead (Q6138098) (← links)
- \textsf{MacORAMa}: optimal oblivious RAM with integrity (Q6190099) (← links)