Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
From MaRDI portal
Publication:2139652
Recommendations
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Towards doubly efficient private information retrieval
- scientific article; zbMATH DE number 1759771
- Single-server private information retrieval with sublinear amortized time
- scientific article; zbMATH DE number 2090941
Cites work
- scientific article; zbMATH DE number 5604104 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1559546 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Automata, Languages and Programming
- Batch codes and their applications
- Can we access a database both locally and privately?
- Constrained keys for invertible pseudorandom functions
- Constraining pseudorandom functions privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Function secret sharing
- Garbled RAM revisited
- How to garble RAM programs?
- Information Security and Privacy
- Modified ranks of tensors and the size of circuits
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On lattices, learning with errors, random linear codes, and cryptography
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Private anonymous data access
- Private constrained PRFs (and more) from LWE
- Private information retrieval
- Private information retrieval with sublinear online time
- Private puncturable PRFs from standard lattice assumptions
- Software protection and simulation on oblivious RAMs
- Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
- The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries
- Towards doubly efficient private information retrieval
- Universal service-providers for database private information retrieval (extended abstract)
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
Cited in
(13)- Lower bounds for (batch) PIR with private preprocessing
- Optimal single-server private information retrieval
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Near-optimal private information retrieval with preprocessing
- Programmable distributed point functions
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Single-server private information retrieval with sublinear amortized time
- Private information retrieval with sublinear online time
- Efficient pre-processing PIR without public-key cryptography
- Lower-bounds on public-key operations in PIR
- Towards doubly efficient private information retrieval
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
This page was built for publication: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139652)
