Actively Secure OT-Extension from q-ary Linear Codes

Ignacio Cascudo; René Bødker Christensen; Jaron Skovsted Gundersen

doi:10.1007/978-3-319-98113-0_18

Actively Secure OT-Extension from q-ary Linear Codes

Ignacio Cascudo, René Bødker Christensen, Jaron Skovsted Gundersen

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

1 Citation (Scopus)

100 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 language	English
Title of host publication	Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings : Proceeding of the 11th International Conference on Security and Cryptography for Networks
Editors	Dario Catalano, Roberto De Prisco
Number of pages	16
Volume	11035
Publisher	Springer
Publication date	2018
Pages	333-348
ISBN (Print)	978-3-319-98112-3
ISBN (Electronic)	978-3-319-98113-0
DOIs	https://doi.org/10.1007/978-3-319-98113-0_18
Publication status	Published - 2018
Event	11th Conference on Security and Cryptography for Networks - Hotel La Bussola, Amalfi, Italy Duration: 4 Sept 2018 → 7 Sept 2018 http://scn18.di.unisa.it/

Conference

Conference	11th Conference on Security and Cryptography for Networks
Location	Hotel La Bussola
Country/Territory	Italy
City	Amalfi
Period	04/09/2018 → 07/09/2018
Internet address	http://scn18.di.unisa.it/

Series	Lecture Notes in Computer Science
Volume	11035
ISSN	0302-9743

Keywords

cryptographic protocols
oblivious transfer

Access to Document

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

Accepted author manuscriptAccepted author manuscript, 452 KB

https://eprint.iacr.org/2018/603.pdf

AUB Link

Search for the material in Aalborg University Library's search engine

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 - 11th International Conference, SCN 2018, Proceedings: Proceeding of the 11th International Conference on Security and Cryptography for Networks (Vol. 11035, pp. 333-348). Springer. 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 - 11th International Conference, SCN 2018, Proceedings: 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{\textquoteright}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.",

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",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "333--348",

editor = "Dario Catalano and {De Prisco}, Roberto",

booktitle = "Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings",

address = "Germany",

note = "11th Conference on Security and Cryptography for Networks ; Conference date: 04-09-2018 Through 07-09-2018",

url = "http://scn18.di.unisa.it/",

}

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 - 11th International Conference, SCN 2018, Proceedings: 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, 11th Conference on Security and Cryptography for Networks, 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 - 11th International Conference, SCN 2018, Proceedings: 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 proceeding › Article in proceeding › Research › peer-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. We analyze 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. We analyze these trade-offs in some concrete cases.

KW - cryptographic protocols

KW - oblivious transfer

UR - http://www.scopus.com/inward/record.url?scp=85053595962&partnerID=8YFLogxK

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

T3 - Lecture Notes in Computer Science

SP - 333

EP - 348

BT - Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings

A2 - Catalano, Dario

A2 - De Prisco, Roberto

PB - Springer

T2 - 11th Conference on Security and Cryptography for Networks

Y2 - 4 September 2018 through 7 September 2018

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 - 11th International Conference, SCN 2018, Proceedings: 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). doi: 10.1007/978-3-319-98113-0_18

Actively Secure OT-Extension from q-ary Linear Codes

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Presentation of research results

11th Conference on Security and Cryptography for Networks

On the Interaction Between Linear Codes, Secret Sharing, and Multiparty Computation

Cite this

Actively Secure OT-Extension from q-ary Linear Codes

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Activities

Presentation of research results

11th Conference on Security and Cryptography for Networks

Research output

On the Interaction Between Linear Codes, Secret Sharing, and Multiparty Computation

Cite this