Efficient pre-processing PIR without public-key cryptography

DOI10.1007/978-3-031-58751-1_8MaRDI QIDQ6637568zbMATH OpenFDO

Authors Ashrujit Ghoshal, Mingxun Zhou, Elaine Shi

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58751-1_8

zbMATH Keywords

pseudorandom functionstwo-server preprocessing PIR scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Towards doubly efficient private information retrieval
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• scientific article; zbMATH DE number 1759771
• Private information retrieval with preprocessing based on the approximate GCD problem

Cites work

• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• An enciphering scheme based on a card shuffle
• Automata, Languages and Programming
• Constraining pseudorandom functions privately
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Cuckoo hashing
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• scientific article; zbMATH DE number 5009196 (Why is no real title available?)
• scientific article; zbMATH DE number 5604104 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• Information Security and Privacy
• Optimal single-server private information retrieval
• Private constrained PRFs (and more) from LWE
• Private information retrieval with sublinear online time
• Private puncturable PRFs from standard lattice assumptions
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• The mix-and-cut shuffle: small-domain encryption secure against N queries
• Trapdoor hash functions and their applications

Cited in

(10)

• Optimal single-server private information retrieval
• Lower bounds for (batch) PIR with private preprocessing
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• 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
• Information-theoretic multi-server private information retrieval with client preprocessing
• Scalable multi-server private information retrieval
• Two-server private information retrieval in sublinear time and quasilinear space
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: Efficient pre-processing PIR without public-key cryptography

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