An Efficient PIR Construction Using Trusted Hardware

• Published in: Information Security pp. 64 - 79
• Main Authors: Yang, Yanjiang, Ding, Xuhua, Deng, Robert H., Bao, Feng
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Access Pattern; Binary Search; Protocol Execution; Query Execution; User Query
• ISBN: 3540858849; 9783540858843
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-85886-7_5

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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathrm{O}}(\sqrt{n})$\end{document} after optimization.