Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
From MaRDI portal
Publication:2139652
DOI10.1007/978-3-030-84259-8_22zbMath1486.68053OpenAlexW3192142816MaRDI QIDQ2139652
B. Chandrasekaran, Waqar Aqeel, Elaine Shi, Bruce M. Maggs
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_22
Related Items (5)
Single-server private information retrieval with sublinear amortized time ⋮ Programmable distributed point functions ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained keys for invertible pseudorandom functions
- Private constrained PRFs (and more) from LWE
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Private information retrieval with sublinear online time
- Private anonymous data access
- Universal service-providers for database private information retrieval (extended abstract)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
- The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
- 2-Server PIR with Sub-Polynomial Communication
- Function Secret Sharing
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Private information retrieval
- Batch codes and their applications
- Software protection and simulation on oblivious RAMs
- How to Garble RAM Programs?
- Modified ranks of tensors and the size of circuits
- Information Security and Privacy
- Sometimes-Recurse Shuffle
- Garbled RAM Revisited
- 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
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
