Actively Secure OT-Extension from q-ary Linear Codes

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

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
Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks : Proceeding of the 11th International Conference on Security and Cryptography for Networks
EditorsDario Catalano, Roberto De Prisco
Number of pages16
Volume11035
PublisherSpringer
Publication date2018
Pages333-348
ISBN (Print)978-3-319-98112-3
ISBN (Electronic)978-3-319-98113-0
DOIs
Publication statusPublished - 2018
Event11th Conference on Security and Cryptography for Networks - Hotel La Bussola, Amalfi, Italy
Duration: 4 Sep 20187 Sep 2018
http://scn18.di.unisa.it/

Conference

Conference11th Conference on Security and Cryptography for Networks
LocationHotel La Bussola
CountryItaly
CityAmalfi
Period04/09/201807/09/2018
Internet address
SeriesLecture Notes in Computer Science
Volume11035
ISSN0302-9743

Keywords

  • cryptographic protocols
  • oblivious transfer

Cite this

Cascudo, I., Christensen, R. B., & Gundersen, J. S. (2018). Actively Secure OT-Extension from q-ary Linear Codes. In D. Catalano, & R. De Prisco (Eds.), Security and Cryptography for Networks: Proceeding of the 11th International Conference on Security and Cryptography for Networks (Vol. 11035, pp. 333-348). Springer. Lecture Notes in Computer Science, Vol.. 11035 https://doi.org/10.1007/978-3-319-98113-0_18
Cascudo, Ignacio ; Christensen, René Bødker ; Gundersen, Jaron Skovsted. / Actively Secure OT-Extension from q-ary Linear Codes. Security and Cryptography for Networks: Proceeding of the 11th International Conference on Security and Cryptography for Networks. editor / Dario Catalano ; Roberto De Prisco. Vol. 11035 Springer, 2018. pp. 333-348 (Lecture Notes in Computer Science, Vol. 11035).
@inproceedings{118b4f195af24670a52d8b3dd31c6382,
title = "Actively Secure OT-Extension from q-ary Linear Codes",
abstract = "We consider recent constructions of 1-out-of-N OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orr{\'u} 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. Weanalyze these trade-offs in some concrete cases",
keywords = "cryptographic protocols, oblivious transfer",
author = "Ignacio Cascudo and Christensen, {Ren{\'e} B{\o}dker} and Gundersen, {Jaron Skovsted}",
year = "2018",
doi = "10.1007/978-3-319-98113-0_18",
language = "English",
isbn = "978-3-319-98112-3",
volume = "11035",
pages = "333--348",
editor = "Dario Catalano and {De Prisco}, Roberto",
booktitle = "Security and Cryptography for Networks",
publisher = "Springer",
address = "Germany",

}

Cascudo, I, Christensen, RB & Gundersen, JS 2018, Actively Secure OT-Extension from q-ary Linear Codes. in D Catalano & R De Prisco (eds), Security and Cryptography for Networks: Proceeding of the 11th International Conference on Security and Cryptography for Networks. vol. 11035, Springer, Lecture Notes in Computer Science, vol. 11035, pp. 333-348, Amalfi, Italy, 04/09/2018. https://doi.org/10.1007/978-3-319-98113-0_18

Actively Secure OT-Extension from q-ary Linear Codes. / Cascudo, Ignacio; Christensen, René Bødker; Gundersen, Jaron Skovsted.

Security and Cryptography for Networks: Proceeding of the 11th International Conference on Security and Cryptography for Networks. ed. / Dario Catalano; Roberto De Prisco. Vol. 11035 Springer, 2018. p. 333-348 (Lecture Notes in Computer Science, Vol. 11035).

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Actively Secure OT-Extension from q-ary Linear Codes

AU - Cascudo, Ignacio

AU - Christensen, René Bødker

AU - Gundersen, Jaron Skovsted

PY - 2018

Y1 - 2018

N2 - 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. Weanalyze these trade-offs in some concrete cases

AB - 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. Weanalyze these trade-offs in some concrete cases

KW - cryptographic protocols

KW - oblivious transfer

U2 - 10.1007/978-3-319-98113-0_18

DO - 10.1007/978-3-319-98113-0_18

M3 - Article in proceeding

SN - 978-3-319-98112-3

VL - 11035

SP - 333

EP - 348

BT - Security and Cryptography for Networks

A2 - Catalano, Dario

A2 - De Prisco, Roberto

PB - Springer

ER -

Cascudo I, Christensen RB, Gundersen JS. Actively Secure OT-Extension from q-ary Linear Codes. In Catalano D, De Prisco R, editors, Security and Cryptography for Networks: Proceeding of the 11th International Conference on Security and Cryptography for Networks. Vol. 11035. Springer. 2018. p. 333-348. (Lecture Notes in Computer Science, Vol. 11035). https://doi.org/10.1007/978-3-319-98113-0_18