Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

7-2006

Abstract

Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impractical to deploy due to the prohibitively high communication and computation complexity. The recent trend in outsourcing databases fuels the research on practical PIR schemes. In this paper, we propose a new PIR system by making use of trusted hardware. Our system is proven to be information theoretically secure. Furthermore, we derive the computation complexity lower bound for hardware-based PIR schemes and show that our construction meets the lower bounds for both the communication and computation costs, respectively.

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Computer Security - ESORICS 2006: 11th European Symposium on Research in Computer Security, Hamburg, Germany, September 18-20: Proceedings

Volume

4189

First Page

49

Last Page

64

ISBN

9783540446019

Identifier

10.1007/11863908_4

Publisher

Springer

City or Country

Berlin

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1007/11863908_4

Share

COinS