Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials

Algorithm 3

The query generation algorithm (user).

	Input: the index .
(1)	Randomly generate -bit-long primes subject to gcd and gcd and compute .
(2)	Randomly choose for and set .
(3)	Randomly choose and compute .
(4)	Set .
(5)	Compute .//The symmetric keyis kept by the user and private for the DB server.
	Output:.