In this paper, we propose a protocol for Oblivious Polynomial Evaluation (OPE) considering a multi-variate polynomial. There are two parties, Alice who has a secret multi-variate polynomial f and Bob who has an input x=(x 1,...,x T ). Thus, Bob wants to compute f(x) without any information leakage: Alice learns nothing about x and Bob learns only what can be inferred from f(x). In [4], the authors proposed a solution for this problem using Oblivious Transfer (OT) protocol only. In this paper, we propose efficient OPE protocols for the multi-variate case based upon additive and multiplicative homomorphic encryption schemes defined on the same domain. Our protocol only reveals the number of monomials. © 2009 Springer-Verlag.
CITATION STYLE
Gavin, G., & Minier, M. (2009). Oblivious multi-variate polynomial evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5922 LNCS, pp. 430–442). https://doi.org/10.1007/978-3-642-10628-6_28
Mendeley helps you to discover research relevant for your work.