Skip to main content
SpringerLink
Log in

Private Information Retrieval with Result Verification for More Servers

  • Conference paper
  • First Online:
Applied Cryptography and Network Security (ACNS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13906))

Included in the following conference series:

  • 715 Accesses

Abstract

Private information retrieval (PIR) allows a client to retrieve an element from a database without revealing which element is downloaded to the database servers. PIR protocols with unconditional privacy and sublinear (in n) communication complexity can be constructed assuming multiple honest-but-curious servers. This assumption however cannot be guaranteed in many real life scenarios such as using cloud servers as database servers. We consider an multi-server information-theoretic PIR with result verification (PIR-RV) model where the client can detect the existence of malicious servers even if only one server is honest. We construct a t-private k-server PIR-RV protocol for arbitrary \(k\ge 2\) and \(1 \le t < k\), and show its security for \(2 \le k\le 5\). The protocol’s communication complexity is \(O(\frac{k^2}{t} (\frac{nk}{t})^{ 1 / (\lfloor (2k-1)/t\rfloor -1)} \log p )\), where p is the size of finite field.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pp. 551–569 (2016)

    Google Scholar 

  2. Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: a unified construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 912–926. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-48224-5_74

    Chapter  Google Scholar 

  3. Beimel, A., Ishai, Y., Kushilevitz, E.: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2), 213–247 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the O(\(n^{1/(2k-1)}\)) barrier for information-theoretic private information retrieval. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 261–270. IEEE (2002)

    Google Scholar 

  5. Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 326–341. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36413-7_24

    Chapter  Google Scholar 

  6. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 1995 Proceedings, 36th Annual Symposium on Foundations of Computer Science (1995)

    Google Scholar 

  7. Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. Cryptology ePrint Archive (2012)

    Google Scholar 

  8. Dvir, Z., Gopi, S.: 2-server PIR with subpolynomial communication. J. ACM (JACM) 63(4), 1–15 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: Proceedings of the Forty-first Annual ACM Symposium on Theory Of Computing, pp. 39–44 (2009)

    Google Scholar 

  10. Goldberg, I.: Improving the robustness of private information retrieval. In: 2007 IEEE Symposium on Security and Privacy (SP2007), pp. 131–148. IEEE (2007)

    Google Scholar 

  11. Graham, R., Sloane, N.: Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1), 37–43 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gupta, T., Crooks, N., Mulhern, W., Setty, S., Walfish, M.: Scalable and private media consumption with popcorn. In: Usenix Symposium on Networked Systems Design & Implementation (2015)

    Google Scholar 

  13. Ke, P., Zhang, L.F.: Two-server private information retrieval with result verification. In: 2022 IEEE International Symposium on Information Theory (ISIT), pp. 408–413. IEEE (2022)

    Google Scholar 

  14. Khoshgozaran, A., Shahabi, C.: Private information retrieval techniques for enabling location privacy in location-based services. In: Bettini, C., Jajodia, S., Samarati, P., Wang, X.S. (eds.) Privacy in Location-Based Applications. LNCS, vol. 5599, pp. 59–83. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03511-1_3

    Chapter  Google Scholar 

  15. Kurosawa, K.: How to correct errors in multi-server PIR. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 564–574. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34621-8_20

    Chapter  Google Scholar 

  16. Poole, D.: Linear algebra: a modern introduction. Cengage Learning (2014)

    Google Scholar 

  17. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  18. Woodruff, D., Yekhanin, S.: A geometric approach to information-theoretic private information retrieval. In: 20th Annual IEEE Conference on Computational Complexity (CCC2005), pp. 275–284. IEEE (2005)

    Google Scholar 

  19. Yang, E.Y., Xu, J., Bennett, K.H.: Private information retrieval in the presence of malicious failures. In: Proceedings 26th Annual International Computer Software and Applications, pp. 805–810. IEEE (2002)

    Google Scholar 

  20. Yannuzzi, M., Milito, R., Serral-Gracià, R., Montero, D., Nemirovsky, M.: Key ingredients in an IoT recipe: Fog computing, cloud computing, and more fog computing. In: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), pp. 325–329. IEEE (2014)

    Google Scholar 

  21. Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM (JACM) 55(1), 1–16 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhang, L.F., Safavi-Naini, R.: Verifiable multi-server private information retrieval. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 62–79. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07536-5_5

    Chapter  Google Scholar 

  23. Zhang, L.F., Wang, H., Wang, L.P.: Byzantine-robust private information retrieval with low communication and efficient decoding. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 1079–1085 (2022)

    Google Scholar 

  24. Zhao, L., Wang, X., Huang, X.: Verifiable single-server private information retrieval from LWE with binary errors. Inf. Sci. 546, 897–923 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  25. Zhu, L., Lin, C., Lin, F., Zhang, L.F.: Post-quantum cheating detectable private information retrieval. In: Meng, W., Jensen, C.D. (eds.) ICT Systems Security and Privacy Protection. SEC 2022. IFIP Advances in Information and Communication Technology, vol. 648, pp. 431–448. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-06975-8_25

Download references

Acknowledgement

The authors thank the anonymous reviewers for their helpful comments. This work was supported by Natural Science Foundation of Shanghai (No. 21ZR1443000) and National Natural Science Foundation of China (No. 61602304).

Author information

Authors and Affiliations

  1. ShanghaiTech University, Shanghai, China

    Pengzhen Ke & Liang Feng Zhang

Authors
  1. Pengzhen Ke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Feng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Feng Zhang .

Editor information

Editors and Affiliations

  1. NTT Social Informatics Laboratories, Tokyo, Japan

    Mehdi Tibouchi

  2. Indiana University at Bloomington, Bloomington, IN, USA

    XiaoFeng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ke, P., Zhang, L.F. (2023). Private Information Retrieval with Result Verification for More Servers. In: Tibouchi, M., Wang, X. (eds) Applied Cryptography and Network Security. ACNS 2023. Lecture Notes in Computer Science, vol 13906. Springer, Cham. https://doi.org/10.1007/978-3-031-33491-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-33491-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-33490-0

  • Online ISBN: 978-3-031-33491-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation