Single database private information retrieval with logarithmic communication

DOI10.1007/978-3-540-27800-9_5MaRDI QIDQ5315290zbMATH OpenOpenAlexFDO

Authors Yan-Cheng Chang

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98755

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Single-database private information retrieval with constant communication rate
• scientific article; zbMATH DE number 5009196
• scientific article; zbMATH DE number 1559546
• Almost optimal private information retrieval
• Symmetrically private information retrieval. (Extended abstract)

Cited in

(23)

• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• Privacy-enhanced attribute-based private information retrieval
• Verifiable single-server private information retrieval
• Amortizing rate-1 OT and applications to PIR and PSI
• Symmetrically private information retrieval. (Extended abstract)
• Hypercubes and private information retrieval
• scientific article; zbMATH DE number 5009196 (Why is no real title available?)
• Computationally private information retrieval with polylogarithmic communication
• Similarity Based Interactive Private Information Retrieval
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
• Information Security
• Single-database private information retrieval with constant communication rate
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Sublinear secure computation from new assumptions
• Optimal single-server private information retrieval
• Efficient pre-processing PIR without public-key cryptography
• Single-server client preprocessing PIR with tight space-time trade-off
• Scalable multi-server private information retrieval
• A communication-efficient private matching scheme in client-server model
• Two-server private information retrieval in sublinear time and quasilinear space

This page was built for publication: Single database private information retrieval with logarithmic communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315290)