Cryptology ePrint Archive: Report 2018/603

Actively Secure OT-Extension from q-ary Linear Codes

Ignacio Cascudo and René Bødker Christensen and Jaron Skovsted Gundersen

Abstract: We consider recent constructions of $1$-out-of-$N$ OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orrú et al. (CT-RSA 2017), based on binary error-correcting codes. We generalize their constructions such that $q$-ary codes can be used for any prime power $q$. This allows to reduce the number of base $1$-out-of-$2$ OT's that are needed to instantiate the construction for any value of $N$, at the cost of increasing the complexity of the remaining part of the protocol. We analyze these trade-offs in some concrete cases.

Category / Keywords: cryptographic protocols / oblivious transfer

Original Publication (with minor differences): Security and Cryptography for Networks (SCN 2018). Lecture Notes in Computer Science, vol 11035

Date: received 14 Jun 2018, last revised 18 Sep 2019

Contact author: rene at math aau dk

Available format(s): PDF | BibTeX Citation

Note: In the published version of this work, we were unfortunately not aware of "Fast actively secure OT extension for short secrets" by Patra et al. This version adds a remark about that paper.

Version: 20190918:072415 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]