Reducing the servers' computation in private information retrieval: PIR with preprocessing
From MaRDI portal
Publication:1880406
zbMath1083.68036MaRDI QIDQ1880406
Amos Beimel, Tal Malkin, Yuval Ishai
Publication date: 27 September 2004
Published in: Journal of Cryptology (Search for Journal in Brave)
PrivacyDistributed databasesInformation-theoretic protocolsSub-linear communicationSub-linear computation
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
Single-server private information retrieval with sublinear amortized time ⋮ 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 ⋮ General constructions for information-theoretic private information retrieval ⋮ Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem ⋮ Private information retrieval with sublinear online time
This page was built for publication: Reducing the servers' computation in private information retrieval: PIR with preprocessing
