Quantum private information retrieval has linear communication complexity
From MaRDI portal
Publication:2018821
DOI10.1007/s00145-014-9180-2zbMath1335.68084DBLPjournals/joc/BaumelerB15arXiv1304.5490OpenAlexW2094133109WikidataQ56475320 ScholiaQ56475320MaRDI QIDQ2018821
Publication date: 25 March 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.5490
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (4)
Quantum Cryptography: Key Distribution and Beyond ⋮ Quantum private information retrieval has linear communication complexity ⋮ Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits
Cites Work
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Quantum private information retrieval has linear communication complexity
- Quantum symmetrically-private information retrieval
- Quantum Private Information Retrieval with Sublinear Communication Complexity
- Quantum Private Queries
- Private information retrieval
- A property of quantum relative entropy with an application to privacy in quantum communication
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A single quantum cannot be cloned
- Optimal Bounds for Quantum Bit Commitment
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
This page was built for publication: Quantum private information retrieval has linear communication complexity
