Actively Secure OT-Extension from q-ary Linear Codes

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

36 Downloads (Pure)

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 - 11th International Conference, SCN 2018, Proceedings : 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