Quantum symmetrically-private information retrieval
From MaRDI portal
Publication:2390235
DOI10.1016/j.ipl.2004.02.003zbMath1177.68081arXivquant-ph/0307076OpenAlexW1999075844MaRDI QIDQ2390235
Ronald de Wolf, Iordanis Kerenidis
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0307076
Quantum computation (81P68) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Related Items (10)
Quantum private query with perfect user privacy against a joint-measurement attack ⋮ Selling multiple secrets to a single buyer ⋮ Novel classical post-processing for quantum key distribution-based quantum private query ⋮ Robust quantum private queries ⋮ Private database queries using one quantum state ⋮ Quantum private information retrieval has linear communication complexity ⋮ Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity ⋮ Optimal bounds for parity-oblivious random access codes ⋮ Relativistic quantum private database queries ⋮ Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol
Cites Work
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Protecting data privacy in private information retrieval schemes
- Private information retrieval
- Quantum Oblivious Transfer
- Upper bound on the communication complexity of private information retrieval
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
This page was built for publication: Quantum symmetrically-private information retrieval
