Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials

Table 3

The theoretical performance analyses of PIR protocols.

Schemes	Batching			/bits
Yi et al. [6]	No
Li et al. [7]	No
Ours	Yes		9

: CC represents a valid computational complexity for the user. : we use ERQ to denote the extension ratio of the query, i.e., . : CO of unit bit represents the communication overhead, i.e., .