Secure coprocessor-based private information retrieval without periodical preprocessing

Authors:
Peishun Wang;Huaxiong Wang;Josef Pieprzyk
Affiliations:
University of Wollongong, NSW, Australia;Macquarie University, NSW, Australia and Nanyang Technological University, Singapore;Nanyang Technological University, Singapore
Venue:
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Year:
2010

Citing 12
Cited 0

Computationally private information retrieval (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Private information retrieval

Journal of the ACM (JACM)
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Using a High-Performance, Programmable Secure Coprocessor

FC '98 Proceedings of the Second International Conference on Financial Cryptography
Practical server privacy with secure coprocessors

IBM Systems Journal - End-to-end security
Protecting Client Privacy with Trusted Computing at the Server

IEEE Security and Privacy
A Geometric Approach to Information-Theoretic Private Information Retrieval

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
An Efficient PIR Construction Using Trusted Hardware

ISC '08 Proceedings of the 11th international conference on Information Security
Almost optimal private information retrieval

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Single-database private information retrieval with constant communication rate

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Private information retrieval using trusted hardware

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Early works on Private Information Retrieval (PIR) focused on minimizing the necessary communication overhead. They seemed to achieve this goal but at the expense of query response time. To mitigate this weakness, protocols with secure coprocessors were introduced. They achieve optimal communication complexity and better online processing complexity. Unfortunately, all secure coprocessor-based PIR protocols require heavy periodical preprocessing. In this paper, we propose a new protocol, which is free from the periodical preprocessing while offering the optimal communication complexity and almost optimal online processing complexity. The proposed protocol is proven to be secure.