Abstract
The well-known SARG04 protocol can be used in a private query application to generate an oblivious key. By usage of the key, the user can retrieve one out of N items from a database without revealing which one he/she is interested in. However, the existing SARG04-based private query protocols are vulnerable to the attacks of faked data from the database since in its canonical form, the SARG04 protocol lacks means for one party to defend attacks from the other. While such attacks can cause significant loss of user privacy, a variant of the SARG04 protocol is proposed in this paper with new mechanisms designed to help the user protect its privacy in private query applications. In the protocol, it is the user who starts the session with the database, trying to learn from it bits of a raw key in an oblivious way. An honesty test is used to detect a cheating database who had transmitted faked data. The whole private query protocol has O(N) communication complexity for conveying at least N encrypted items. Compared with the existing SARG04-based protocols, it is efficient in communication for per-bit learning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3), 592–629 (2000). Earlier version in STOC 98
Giovannetti, V., Lloyd, S., Maccone, L.: Quantum private queries. Phys. Rev. Lett. 100, 230502 (2008)
Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84, 022313 (2011)
Yu, F., Qiu, D.W.: Coding-based quantum private database query using entanglement. Quantum Inf. Comput. 14(1&2), 0091–0106 (2014)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the 36rd IEEE Symposium on Foundations of Computer Science, pp. 41–50. Also, in Journal of the ACM, vol. 45, 1998 (1995)
Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.: Breaking the \(\text{ O }(n^{1/(2k-1)})\) barrier for information-theoretic private information retrieval. In: Proceedings of 43rd IEEE FOCS, pp. 261–270 (2002)
Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: 24th ICALP, LNCS 1256, pp. 401–407 (1997)
Hogg, T., Zhang, L.: Private database queries using quantum states with limited coherence times. Int. J. Quantum Inf. 7(02), 459C474 (2009)
Jakobi, M., et al.: Practical private database queries based on a quantum-key-distribution protocol. Phys. Rev. A 83, 022301 (2011)
Zhang, J.L., Guo, F.Z., Gao, F., Liu, B., Wen, Q.Y.: Private database queries based on counterfactual quantum key distribution. Phys. Rev. A 88(2), 022334 (2013)
Yang, Y.G., Zhang, M.O., Yang, R.: Private database queries using one quantum state. Quantum Inf. Process. (2014). doi:10.1007/s11128-014-0902-z
Scarani, V., Acin, A., Ribordy, G., et al.: Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations. Phys. Rev. Lett. 92(5), 057901 (2004)
Rao, M.V.P., Jakobi, M.: Towards communication-efficient quantum oblivious key distribution. Phys. Rev. A 87(1), 012331 (2013)
Acknowledgments
This work was supported in part by the National Natural Science Foundation (Grant Nos. 61272058, 61070164, 61272415, 61472452), the Natural Science Foundation of Guangdong Province of China (Grant Nos. 2014A030310265, S2012010008767), and the Science and Technology Planning Project of Guangdong Province of China under Grant (Grant No. 2013B010401015).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yu, F., Qiu, D., Situ, H. et al. Enhancing user privacy in SARG04-based private database query protocols. Quantum Inf Process 14, 4201–4210 (2015). https://doi.org/10.1007/s11128-015-1091-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-015-1091-0