An Efficient and Unconditionally-Secure Oblivious Polynomial Evaluation Protocol

As two-party protocols, most of the existing oblivious polynomial evaluation schemes use oblivious transfer to realize oblivious evaluation for polynomial, They are high in computation complexity, which blocks their practical application. In this paper, we propose an oblivious polynomial evaluation protocol, the protocol does not rely on any cryptographic assumption and is unconditionally-secure. Again, the protocol does not rely on any third party and involves only extremely simple computation. OPE protocols can find many applications, such as protocols for private comparison of data, for mutually authenticated key exchange based on (possibly weak) passwords, and for anonymous coupons, and can be used as the basic building block to achieve asymmetry in public-key traitor tracing schemes.