Private information retrieval with sublinear online time
From MaRDI portal
Publication:2055601
DOI10.1007/978-3-030-45721-1_3OpenAlexW2918752259MaRDI QIDQ2055601
Dmitry Kogan, Henry Corrigan-Gibbs
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_3
Related Items (12)
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Garbled circuits with sublinear evaluator ⋮ Single-server private information retrieval with sublinear amortized time ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Programmable distributed point functions ⋮ Optimal single-server private information retrieval ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ How to compress encrypted data ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Random-index PIR and applications
Cites Work
- Private constrained PRFs (and more) from LWE
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Private anonymous data access
- Trapdoor hash functions and their applications
- Universal service-providers for database private information retrieval (extended abstract)
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- 2-Server PIR with Sub-Polynomial Communication
- Function Secret Sharing
- Semi-homomorphic Encryption and Multiparty Computation
- Private information retrieval
- Towards 3-query locally decodable codes of subexponential length
- Batch codes and their applications
- Evaluating Branching Programs on Encrypted Data
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Upper bound on the communication complexity of private information retrieval
- 3-Query Locally Decodable Codes of Subexponential Length
- Fully homomorphic encryption using ideal lattices
- Modified ranks of tensors and the size of circuits
- How to use indistinguishability obfuscation
- Functional Signatures and Pseudorandom Functions
- Distributed Point Functions and Their Applications
- Information Security
- Theory of Cryptography
- Automata, Languages and Programming
- Constraining Pseudorandom Functions Privately
- Private Puncturable PRFs from Standard Lattice Assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Universal service-providers for private information retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Private information retrieval with sublinear online time
