Efficient pre-processing PIR without public-key cryptography

DOI10.1007/978-3-031-58751-1_8MaRDI QIDQ6637568

Elaine Shi, Ashrujit Ghoshal, Mingxun Zhou

Publication date: 13 November 2024

zbMATH Keywords

pseudorandom functionstwo-server preprocessing PIR scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

PIR with client-side preprocessing: information-theoretic constructions and lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Private constrained PRFs (and more) from LWE
• Private information retrieval with sublinear online time
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• Trapdoor hash functions and their applications
• The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
• An Enciphering Scheme Based on a Card Shuffle
• 2-Server PIR with Sub-Polynomial Communication
• Cuckoo hashing
• Information Security and Privacy
• Automata, Languages and Programming
• Constraining Pseudorandom Functions Privately
• Private Puncturable PRFs from Standard Lattice Assumptions
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Optimal single-server private information retrieval
• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE

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