Authenticated sublinear quantum private information retrieval
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A cryptographic test of quantumness and certifiable randomness from a single quantum device
- Capacity of Quantum Private Information Retrieval With Colluding Servers
- Capacity of Quantum Private Information Retrieval With Multiple Servers
- Classical homomorphic encryption for quantum circuits
- Classical verification of quantum computations
- Computationally-secure and composable remote state preparation
- Deniable encryption in a Quantum world
- Fully homomorphic encryption over the integers
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- Modern Cryptography Volume 2
- On lattices, learning with errors, random linear codes, and cryptography
- Private information retrieval
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum homomorphic encryption for polynomial-sized circuits
- Quantum private information retrieval has linear communication complexity
- Quantum private information retrieval with lattice-based access authentication
- Quantum private information retrieval with sublinear communication complexity
- Quantum symmetrically-private information retrieval
- Robust information-theoretic private information retrieval
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
This page was built for publication: Authenticated sublinear quantum private information retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860564)