Pages that link to "Item:Q2875144"
From MaRDI portal
The following pages link to Oblivious RAMs without cryptogrpahic assumptions (Q2875144):
Displayed 12 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)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (Q3012949) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- (Q5743385) (← links)
- (Q5743386) (← links)