In this paper we study the two fundamental functionalities
oblivious polynomial evaluation in the exponent
, and introduce a new technique for designing efficient secure protocols for these problems (and others). Our starting point is the  technique (CRYPTO 2011) for verifiable delegation of polynomial evaluations, using
. We use this tool, that is useful to achieve
, in order to achieve
setting. Our results imply new simple and efficient oblivious polynomial evaluation (OPE) protocols. We further show that our OPE protocols are readily used for secure set-intersection, implying much simpler protocols in the plain model. As a side result, we demonstrate the usefulness of algebraic PRFs for various search functionalities, such as keyword search and oblivious transfer with adaptive queries. Our protocols are secure under full simulation-based definitions in the presence of malicious adversaries.