Optimal single-server private information retrieval

DOI10.1007/978-3-031-30545-0_14MaRDI QIDQ6138096zbMATH OpenOpenAlexFDO

Authors Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi

Publication date 16 January 2024

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30545-0_14

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Privacy of data (68P27)

Recommendations

• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Efficient pre-processing PIR without public-key cryptography
• Towards doubly efficient private information retrieval
• Verifiable single-server private information retrieval from LWE with binary errors
• Single-server private information retrieval with sublinear amortized time

Cites work

• scientific article; zbMATH DE number 1670844 (Why is no real title available?)
• scientific article; zbMATH DE number 5604104 (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 1759771 (Why is no real title available?)
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Automata, Languages and Programming
• Batch codes and their applications
• Can we access a database both locally and privately?
• Constraining pseudorandom functions privately
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Delegation for bounded space
• Distributed Point Functions and Their Applications
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Information Security and Privacy
• Lightweight, maliciously secure verifiable function secret sharing
• Modified ranks of tensors and the size of circuits
• Private anonymous data access
• Private constrained PRFs (and more) from LWE
• Private information retrieval
• Private information retrieval with sublinear online time
• Private puncturable PRFs from standard lattice assumptions
• Privately constraining and programming PRFs, the LWE way
• Programmable distributed point functions
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• Sorting in \(c \log n\) parallel steps
• Spooky Encryption and Its Applications
• Spooky interaction and its discontents: compilers for succinct two-message argument systems
• Towards doubly efficient private information retrieval
• Universal service-providers for database private information retrieval (extended abstract)
• Watermarking cryptographic functionalities from standard lattice assumptions

Cited in

(7)

• Towards practical doubly-efficient private information retrieval
• Multi-server doubly efficient PIR in the classical model and beyond
• Efficient pre-processing PIR without public-key cryptography
• Lower-bounds on public-key operations in PIR
• 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

This page was built for publication: Optimal single-server private information retrieval

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