Barely doubly-efficient SimplePIR
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A Framework for Efficient and Composable Oblivious Transfer
- Black box crypto is useless for doubly efficient PIR
- Can we access a database both locally and privately?
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- How (not) to instantiate ring-LWE
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- On cryptography with auxiliary input
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Permuted puzzles and cryptographic hardness
- Provably weak instances of Ring-LWE
- Provably weak instances of ring-LWE revisited
- Reducing the servers computation in private information retrieval: PIR with preprocessing
- Replication is not needed: single database, computationally-private information retrieval
- Towards doubly efficient private information retrieval
- Towards practical doubly-efficient private information retrieval
This page was built for publication: Barely doubly-efficient SimplePIR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447175)