Abstract
Early works on Private Information Retrieval (PIR) focused on minimizing the necessary communication overhead. Theyseemed 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 opti-mal communication complexity and almost optimal online processing complexity. The proposed protocol is proven to be secure.
Original language | English |
---|---|
Title of host publication | Information Security 2010 - Proceedings of the Eighth Australasian Information Security Conference, AISC 2010 |
Editors | C. Boyd, W. Susilo |
Place of Publication | Sydney, Australia |
Publisher | Australian Computer Society |
Pages | 5-11 |
Number of pages | 7 |
Volume | 105 |
ISBN (Print) | 9781920682866 |
Publication status | Published - 2010 |
Event | 8th Australasian Information Security Conference, AISC 2010 - Brisbane, QLD, Australia Duration: 19 Jan 2010 → 20 Jan 2010 |
Other
Other | 8th Australasian Information Security Conference, AISC 2010 |
---|---|
Country/Territory | Australia |
City | Brisbane, QLD |
Period | 19/01/10 → 20/01/10 |