Hintless single-server private information retrieval

DOI10.1007/978-3-031-68400-5_6MaRDI QIDQ6653046zbMATH OpenFDO

Authors Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz-Wu

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68400-5_6

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites work

• 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 1759771 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• Algorithms in HElib
• Automata, Languages and Programming
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• Compressible FHE with applications to PIR
• High-dimensional probability. An introduction with applications in data science
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• Lossy trapdoor functions and their applications
• Lower bounds for (batch) PIR with private preprocessing
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• Private information retrieval with sublinear online time
• Single-server private information retrieval with sublinear amortized time
• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH

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

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