Journal
SCIENTIFIC REPORTS
Volume 4, Issue -, Pages -Publisher
NATURE PORTFOLIO
DOI: 10.1038/srep07537
Keywords
-
Categories
Funding
- NSFC [61300181, 61272057, 61202434, 61170270, 61100203, 61121061, 61202317]
- Beijing Natural Science Foundation [4122054]
- Beijing Higher Education Young Elite Teacher Project [YETP0475, YETP0477]
- Program for Science & Technology Innovation Talents in Universities of Henan Province [13HASTIT042]
- Young Key Teacher Foundation of Henan Province's Universities [2012GGJS-157]
- Natural Science Foundation of Henan Province [132300410316, 132300410313]
- Natural Science Foundation of Education Bureau of Henan Province [12B120009, 13A110800, 13B110150]
Ask authors/readers for more resources
Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message a(1)a(2) ..a(l) from database, the user Alice has to query l times to get each a(i). In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each a(i) contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available