Oblivious Transfer and n-Variate Linear Function Evaluation

摘要

We define a new cryptographic primitive which is called Oblivious n-variate Linear Function Evaluation with choice space C and denoted by C-OLFE. The primitive captures a variety of well-known cryptographic primitives and is an interesting stepstone in secure protocol design. We present a statistically secure reduction from (n/1)-OT to kn invocations of C-OLFE_n, where k is the security parameter and C contains all unit vectors of length n. The reduction allows us to reverse (n/1)-OT for any integer n ≥ 2.