# zbMATH — the first resource for mathematics

Actively secure OT-extension from $$q$$-ary linear codes. (English) Zbl 06957561
Catalano, Dario (ed.) et al., Security and cryptography for networks. 11th international conference, SCN 2018, Amalfi, Italy, September 5–7, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-98112-3/pbk; 978-3-319-98113-0/ebook). Lecture Notes in Computer Science 11035, 333-348 (2018).
Summary: 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.
For the entire collection see [Zbl 1397.94004].
##### MSC:
 68P25 Data encryption (aspects in computer science) 94A60 Cryptography
Full Text: