Key points are not available for this paper at this time.
We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d 'Oblivious Poly&nial
Naor et al. (Sat,) studied this question.