Towards practical doubly-efficient private information retrieval

DOI10.1007/978-3-031-78679-2_14MaRDI QIDQ6979725zbMATH OpenFDO

Authors Hiroki Okada, Rachel Player, Simon Pohmann, Christian Weinert

Publication date 23 May 2025

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

zbMATH Keywords

doubly efficient PIRFHE for RAM

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Cryptography (94A60)

Cites work

• 2-server PIR with subpolynomial communication
• 3-query locally decodable codes of subexponential length
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A tight lower bound for restricted PIR protocols
• An improved RNS variant of the BFV homomorphic encryption scheme
• Batch codes and their applications
• Can we access a database both locally and privately?
• Distributed Point Functions and Their Applications
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Efficient public key encryption based on ideal lattices (extended abstract)
• Fast polynomial factorization and modular composition
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• On ideal lattices and learning with errors over rings
• Optimal single-server private information retrieval
• Path ORAM
• Perfectly secure oblivious RAM without random oracles
• Private information retrieval with sublinear online time
• Querying databases privately. A new approach to private information retrieval.
• Single-server private information retrieval with sublinear amortized time
• Towards 3-query locally decodable codes of subexponential length
• Towards doubly efficient private information retrieval

Cited in

(3)

• On algebraic homomorphic encryption and its applications to doubly-efficient PIR
• Multi-server doubly efficient PIR in the classical model and beyond
• Two-server private information retrieval in sublinear time and quasilinear space

This page was built for publication: Towards practical doubly-efficient private information retrieval

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