Abstract
For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by \({\mathrm{O}}(\sqrt{n})\) after optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, T., Doorn, L.V.: The ibm pcixcc: A new cryptographic coprocessor for the ibm eserver. Journal of Research and Development 48 (May 2004)
Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.-F.: Breaking the o(n 1/(2k − 1)) barrier for information-theoretic private information retrieval. In: Proceedings of IEEE FOCS 2002, pp. 261–270 (2002)
Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 55–73. Springer, Heidelberg (2000)
Chor, B., Gilboa, N.: Computationally private information retrieval. In: Proceedings of the 29th STOC 1997, pp. 304–313 (1997)
Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. In: Proceedings of IEEE FOCS 1995, pp. 41–51 (1995)
Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM 43(3), 431–473 (1996)
Iliev, A., Smith, S.: Private information storage with logarithm-space secure hardware. In: Proceedings of International Information Security Workshops, pp. 199–214 (2004)
Iliev, A., Smith, S.: Protecting client privacy with trusted computing at the server. IEEE Security & Privacy 3(2), 20–28 (2005)
Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally private information retrieval. In: Proceeding of the 38th IEEE FOCS 1997, pp. 364–373 (1997)
Kushilevitz, E., Ostrovsky, R.: One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 104–121. Springer, Heidelberg (2000)
Ostrovsky, R., Shoup, V.: Private information storage. In: Proceedings of the 29th STOC 1997, pp. 294–303 (1997)
Sion, R., Carbunar, B.: On the computational practicality of private information retrieval. In: Proceedings of NDSS 2007 (2007)
Smith, S., Safford, D.: Practical server privacy with secure coprocessors. IBM Systems Journal 40(3), 683–695 (2001)
Wang, S., Ding, X., Deng, R., Bao, F.: Private information retrieval using trusted hardware. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 49–64. Springer, Heidelberg (2006)
Williams, P., Sion, R.: Usable PIR. In: Proceedings of NDSS 2008 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Y., Ding, X., Deng, R.H., Bao, F. (2008). An Efficient PIR Construction Using Trusted Hardware. In: Wu, TC., Lei, CL., Rijmen, V., Lee, DT. (eds) Information Security. ISC 2008. Lecture Notes in Computer Science, vol 5222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85886-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85886-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85884-3
Online ISBN: 978-3-540-85886-7
eBook Packages: Computer ScienceComputer Science (R0)