4 Improving Processing and Preprocessing Complexity

Abstract

Section 4.1 tunes the PIR protocol proposed in the previous chapter by reducing its query response time. Section 4.2 tunes the same PIR protocol by reducing shuffling (preprocessing) complexity. This problem appears to be considerably more complex than the one in Section 4.1. Thus Section 4.2 presents theoretical results only. The experimental results form the nucleus of Chapter 5.

In Sections 4.1 and 4.2, the approaches improve different characteristics of the PIR protocol (query response time or preprocessing complexity). In order to compare the effectiveness of these approaches with each other, we propose a single combined criteria to evaluate them in Section 4.3.