It is a challenging problem to delegate the computation of a polynomial on encrypted data to a server in an oblivious and verifiable way. In this paper, we formally define Verifiable and Private Oblivious Polynomial Evaluation (VPOPE) scheme. We design a scheme called Verifiable IND-CFA Paillier based Private Oblivious Polynomial Evaluation (VIP-POPE). Using security properties of Private Polynomial Evaluation (PPE) schemes and Oblivious Polynomial Evaluation (OPE) schemes, we prove that our scheme is proof unforgeability, indistinguishability against chosen function attack, and client privacy-secure under the Decisional Composite Residuosity assumption in the random oracle model.
CITATION STYLE
Gajera, H., Giraud, M., Gérault, D., Das, M. L., & Lafourcade, P. (2020). Verifiable and Private Oblivious Polynomial Evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12024 LNCS, pp. 49–65). Springer. https://doi.org/10.1007/978-3-030-41702-4_4
Mendeley helps you to discover research relevant for your work.