Pages that link to "Item:Q1690292"
From MaRDI portal
The following pages link to Towards doubly efficient private information retrieval (Q1690292):
Displaying 14 items.
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← 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)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE (Q6652894) (← links)
- Reusable online-efficient commitments (Q6653022) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)
- Fully malicious authenticated PIR (Q6653043) (← links)
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds (Q6653044) (← links)
