Research Article
Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials
Algorithm 2
Algorithm
with access to
. | Input: the public modulus , and the RSA ciphertext . | (1) | Randomly choose an integer and compute . | (2) | Set and randomly generate a bivariate polynomial . | (3) | Set and run . | (4) | Compute the greatest common divisor . | | Output:. |
|