Write, autoreview, editor, reviewer
3,129
edits
(Added a "Optimal communication complexity of the (Q)(S)PIR problem" subsection in "Further Information" section + some minor edit on OT) |
No edit summary |
||
Line 16: | Line 16: | ||
<!-- Tags Any related page or list of protocols is connected by this section--> | <!-- Tags Any related page or list of protocols is connected by this section--> | ||
==Use-cases== | |||
<!-- Use Case (if available) analyses how practical the protocol is--> | |||
===Classical database=== | |||
*Location-based services (to protect user location privacy). | |||
*Queries of electronic medical records (these require decades of information confidentiality; hence security against quantum computing based attacks is necessary) or medical test reports. | |||
*Music and film streaming (user does not want his/her tastes to be revealed to the server). | |||
*Pay-per-view services, where the user should pay a fee to access every single database element. | |||
Quantum (S)PIR protocols may be preferred to their classical counterparts to: | |||
*Achieve (S)PIR with better communication complexity: this is convenient in the case of large databases. | |||
*Achieve (S)PIR with better security: for instance, to secure classical channels as in [[#References|[5]]]. | |||
==Properties== | ==Properties== | ||
Line 74: | Line 85: | ||
* [[Multi-Database Quantum Symmetric Private Information Retrieval for a Quantum Database|Multi-database quantum SPIR protocols in the visible setting for a quantum database]] | * [[Multi-Database Quantum Symmetric Private Information Retrieval for a Quantum Database|Multi-database quantum SPIR protocols in the visible setting for a quantum database]] | ||