Near-optimal private information retrieval with preprocessing
From MaRDI portal
Publication:6582182
DOI10.1007/978-3-031-48618-0_14MaRDI QIDQ6582182
Charalampos Papamanthou, Arthur Lazzaretti
Publication date: 2 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Locally decodable codes and private information retrieval schemes.
- Private constrained PRFs (and more) from LWE
- Private information retrieval with sublinear online time
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
- Communication Optimal Tardos-Based Asymmetric Fingerprinting
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- 2-Server PIR with Sub-Polynomial Communication
- Private information retrieval
- Towards 3-query locally decodable codes of subexponential length
- 3-Query Locally Decodable Codes of Subexponential Length
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Information Security
- Automata, Languages and Programming
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- A Simpler Rate-Optimal CPIR Protocol
- Universal service-providers for private information retrieval
This page was built for publication: Near-optimal private information retrieval with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582182)
