Pages that link to "Item:Q1690292"
From MaRDI portal
The following pages link to Towards doubly efficient private information retrieval (Q1690292):
Displaying 25 items.
- Can we access a database both locally and privately? (Q1690289) (← links)
- Reducing the servers' computation in private information retrieval: PIR with preprocessing (Q1880406) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- 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)
- Robust information-theoretic private information retrieval (Q2642258) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Fault-tolerant symmetrically-private information retrieval (Q2831055) (← links)
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate (Q3562891) (← links)
- Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
- Private Information Retrieval Over Gaussian MAC (Q4958239) (← links)
- A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers (Q5498730) (← 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)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- On Private Information Retrieval Supporting Range Queries (Q6485999) (← 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)