Paper 2018/603
Actively Secure OT-Extension from q-ary Linear Codes
Ignacio Cascudo, 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.
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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Security and Cryptography for Networks (SCN 2018). Lecture Notes in Computer Science, vol 11035
- DOI
- 10.1007/978-3-319-98113-0_18
- Keywords
- oblivious transfer
- Contact author(s)
- rene @ math aau dk
- History
- 2019-09-18: last of 2 revisions
- 2018-06-18: received
- See all versions
- Short URL
- https://ia.cr/2018/603
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/603,
author = {Ignacio Cascudo and René Bødker Christensen and Jaron Skovsted Gundersen},
title = {Actively Secure {OT}-Extension from q-ary Linear Codes},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/603},
year = {2018},
doi = {10.1007/978-3-319-98113-0_18},
url = {https://eprint.iacr.org/2018/603}
}
