Single-server private information retrieval with sublinear amortized time
From MaRDI portal
Publication:2170035
DOI10.1007/978-3-031-07085-3_1zbMath1497.68154OpenAlexW4285201849MaRDI QIDQ2170035
Alexandra Henzinger, Dmitry Kogan, Henry Corrigan-Gibbs
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_1
Related Items (4)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for linear locally decodable codes and private information retrieval
- Probabilistic encryption
- Random oracles and non-uniformity
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Yes, there is an oblivious RAM lower bound!
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Private information retrieval with sublinear online time
- Lower bounds for multi-server oblivious RAMs
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Compressible FHE with applications to PIR
- Permuted puzzles and cryptographic hardness
- Private anonymous data access
- Trapdoor hash functions and their applications
- Is There an Oblivious RAM Lower Bound?
- Spooky Encryption and Its Applications
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- On the Instantiability of Hash-and-Sign RSA Signatures
- 2-Server PIR with Sub-Polynomial Communication
- Function Secret Sharing
- Private information retrieval
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Towards 3-query locally decodable codes of subexponential length
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Batch codes and their applications
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Random Oracles and Auxiliary Input
- Decomposable searching problems I. Static-to-dynamic transformation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Software protection and simulation on oblivious RAMs
- Upper bound on the communication complexity of private information retrieval
- 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
- Lower Bounds for Oblivious Data Structures
- How to delegate computations
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Information Security and Privacy
- Distributed Point Functions and Their Applications
- Information Security
- Delegation for bounded space
- Automata, Languages and Programming
- Automata, Languages and Programming
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Single-server private information retrieval with sublinear amortized time
