Publication Type

Conference Proceeding Article

Publication Date

9-2008

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 after optimization.

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Information Security: 11th International Conference, ISC 2008, Taipei, Taiwan, September 15-18: Proceedings

Volume

5222

First Page

64

Last Page

79

ISBN

9783540858867

Identifier

10.1007/978-3-540-85886-7_5

Publisher

Springer Verlag

City or Country

Berlin

Additional URL

http://dx.doi.org/10.1007/978-3-540-85886-7_5

Share

COinS