Projects per year
We describe an actively secure OT extension protocol in the random oracle model with efficiency very close to the passively secure IKNP protocol of Ishai et al. (Crypto 2003). For computational security parameter $\kappa$, our protocol requires $\kappa$ base OTs, and is the first practical, actively secure protocol to match the cost of the passive IKNP extension in this regard. The added communication cost is only additive in $O(\kappa)$, independent of the number of OTs being created, while the computation cost is essentially two finite field operations per extended OT. We present implementation results that show our protocol takes no more than 5% more time than the passively secure IKNP extension, in both LAN and WAN environments, and so is essentially optimal with respect to the passive protocol.
|Title of host publication||Advances in Cryptology - CRYPTO 2015|
|Number of pages||18|
|Publication status||Published - 20 Aug 2015|
|Name||Lecture Notes in Computer Science|
Bibliographical noteDate of Acceptance: 08/05/2015
- Oblivious transfer