Actively Secure OT-Extension from q-ary Linear Codes

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

1 Citationer (Scopus)
96 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.

OriginalsprogEngelsk
TitelSecurity and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings : Proceeding of the 11th International Conference on Security and Cryptography for Networks
RedaktørerDario Catalano, Roberto De Prisco
Antal sider16
Vol/bind11035
ForlagSpringer
Publikationsdato2018
Sider333-348
ISBN (Trykt)978-3-319-98112-3
ISBN (Elektronisk)978-3-319-98113-0
DOI
StatusUdgivet - 2018
Begivenhed11th Conference on Security and Cryptography for Networks - Hotel La Bussola, Amalfi, Italien
Varighed: 4 sep. 20187 sep. 2018
http://scn18.di.unisa.it/

Konference

Konference11th Conference on Security and Cryptography for Networks
LokationHotel La Bussola
Land/OmrådeItalien
ByAmalfi
Periode04/09/201807/09/2018
Internetadresse
NavnLecture Notes in Computer Science
Vol/bind11035
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Actively Secure OT-Extension from q-ary Linear Codes'. Sammen danner de et unikt fingeraftryk.

Citationsformater