Lower-bounds on public-key operations in PIR

DOI10.1007/978-3-031-58751-1_3MaRDI QIDQ6637562

Mohammad Hajiabadi, Jesko Dujmovic

Publication date: 13 November 2024

zbMATH Keywords

lower bounds communication complexity private information retrieval PIR generic group model GGM OT extension

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data encryption (aspects in computer science) (68P25)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Limits on the power of garbling techniques for public-key encryption
On the round complexity of OT extension
Lower bounds on obfuscation from all-or-nothing encryption primitives
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 information retrieval with sublinear online time
Efficient range-trapdoor functions and applications: rate-1 OT and more
Private set intersection in the internet setting from lightweight oblivious PRF
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
Single-server private information retrieval with sublinear amortized time
Batch-OT with optimal rate
Trapdoor hash functions and their applications
Amortizing rate-1 OT and applications to PIR and PSI
Lower bounds on the efficiency of encryption and digital signature schemes
Oblivious Transfer Is Symmetric
Evaluating Branching Programs on Encrypted Data
Advances in Cryptology - CRYPTO 2003
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
Optimal single-server private information retrieval
Lower bounds for (batch) PIR with private preprocessing
The pseudorandom oracle model and ideal obfuscation
To label, or not to label (in generic groups)
Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
Limits of preprocessing for single-server PIR

This page was built for publication: Lower-bounds on public-key operations in PIR