Pages that link to "Item:Q2876659"
From MaRDI portal
The following pages link to Optimizing ORAM and Using It Efficiently for Secure Computation (Q2876659):
Displaying 28 items.
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval (Q1656051) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← 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)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← 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)
- Three-Party ORAM for Secure Computation (Q2811139) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) (← links)
- Multi-user binary tree based ORAM scheme (Q2951204) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Succinct oblivious RAM (Q3304151) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← 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)
- M-ORAM Revisited: Security and Construction Updates (Q6108627) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- Random-index oblivious RAM (Q6169549) (← links)
- Maliciously Secure Multi-Client ORAM (Q6487223) (← links)
