Single-server private information retrieval with sublinear amortized time
From MaRDI portal
Publication:2170035
Recommendations
Cites work
- 3-query locally decodable codes of subexponential length
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Automata, Languages and Programming
- Automata, Languages and Programming
- Batch codes and their applications
- Can we access a database both locally and privately?
- Compressible FHE with applications to PIR
- Decomposable searching problems I. Static-to-dynamic transformation
- Delegation for bounded space
- Distributed Point Functions and Their Applications
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Foundations of Cryptography
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Function secret sharing
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to delegate computations
- scientific article; zbMATH DE number 1617942 (Why is no real title available?)
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (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 1754644 (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?)
- Information Security
- Information Security and Privacy
- Is there an oblivious RAM lower bound?
- Lower bounds for linear locally decodable codes and private information retrieval
- Lower bounds for multi-server oblivious RAMs
- Lower bounds for oblivious data structures
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- On lattices, learning with errors, random linear codes, and cryptography
- On the instantiability of hash-and-sign RSA signatures
- Permuted puzzles and cryptographic hardness
- Private anonymous data access
- Private information retrieval
- Private information retrieval with sublinear online time
- Probabilistic encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Random Oracles and Auxiliary Input
- Random oracles and non-uniformity
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Software protection and simulation on oblivious RAMs
- Spooky Encryption and Its Applications
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Time space tradeoffs for attacks against one-way functions and PRGs
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- Towards 3-query locally decodable codes of subexponential length
- Towards doubly efficient private information retrieval
- Trapdoor hash functions and their applications
- Upper bound on the communication complexity of private information retrieval
- Yes, there is an oblivious RAM lower bound!
Cited in
(27)- Towards doubly efficient private information retrieval
- Private information retrieval with sublinear online time
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Verifiable single-server private information retrieval
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- Automata, Languages and Programming
- Optimal single-server private information retrieval
- Lower bound framework for differentially private and oblivious data structures
- Lower bounds for (batch) PIR with private preprocessing
- Limits of breach-resistant and snapshot-oblivious RAMs
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Near-optimal private information retrieval with preprocessing
- Lower-bounds on public-key operations in PIR
- Efficient pre-processing PIR without public-key cryptography
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Hintless single-server private information retrieval
- Pseudorandom functions with weak programming privacy and applications to private information retrieval
- Single-server client preprocessing PIR with tight space-time trade-off
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Information-theoretic multi-server private information retrieval with client preprocessing
- Towards practical doubly-efficient private information retrieval
- Scalable multi-server private information retrieval
- Multi-server doubly efficient PIR in the classical model and beyond
- Two-server private information retrieval in sublinear time and quasilinear space
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
- On circuit private, multikey and threshold approximate homomorphic encryption
This page was built for publication: Single-server private information retrieval with sublinear amortized time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170035)
