Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner; Nikolaos Makriyannis; Samuel Ranellucci; Eliad Tsfadia

doi:10.1007/978-3-031-06944-4_7

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

We present a new OT -based two-party multiplication protocol that is almost as efficient as Gilboa’s semi-honest protocol (Crypto ’99), but has a high-level of security against malicious adversaries without further compilation. The achieved security suffices for many applications, and, assuming DDH, can be cheaply compiled into full security.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings
Editors	Orr Dunkelman, Stefan Dziembowski
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	180-209
Number of pages	30
ISBN (Print)	9783031069437
DOIs	https://doi.org/10.1007/978-3-031-06944-4_7
State	Published - 2022
Event	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 - Trondheim, Norway Duration: 30 May 2022 → 3 Jun 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13275 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022
Country/Territory	Norway
City	Trondheim
Period	30/05/22 → 3/06/22

Access to Document

10.1007/978-3-031-06944-4_7

Cite this

Haitner, I., Makriyannis, N., Ranellucci, S., & Tsfadia, E. (2022). Highly Efficient OT-Based Multiplication Protocols. In O. Dunkelman, & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 180-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13275 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06944-4_7

Haitner, Iftach ; Makriyannis, Nikolaos ; Ranellucci, Samuel et al. / Highly Efficient OT-Based Multiplication Protocols. Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. editor / Orr Dunkelman ; Stefan Dziembowski. Springer Science and Business Media Deutschland GmbH, 2022. pp. 180-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2656c551535e4676a2633d2af2a079ff,

title = "Highly Efficient OT-Based Multiplication Protocols",

abstract = "We present a new OT -based two-party multiplication protocol that is almost as efficient as Gilboa{\textquoteright}s semi-honest protocol (Crypto {\textquoteright}99), but has a high-level of security against malicious adversaries without further compilation. The achieved security suffices for many applications, and, assuming DDH, can be cheaply compiled into full security.",

author = "Iftach Haitner and Nikolaos Makriyannis and Samuel Ranellucci and Eliad Tsfadia",

note = "Publisher Copyright: {\textcopyright} 2022, International Association for Cryptologic Research.; 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 ; Conference date: 30-05-2022 Through 03-06-2022",

year = "2022",

doi = "10.1007/978-3-031-06944-4_7",

language = "אנגלית",

isbn = "9783031069437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "180--209",

editor = "Orr Dunkelman and Stefan Dziembowski",

booktitle = "Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings",

address = "גרמניה",

}

Haitner, I, Makriyannis, N, Ranellucci, S & Tsfadia, E 2022, Highly Efficient OT-Based Multiplication Protocols. in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13275 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 180-209, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 30/05/22. https://doi.org/10.1007/978-3-031-06944-4_7

Highly Efficient OT-Based Multiplication Protocols. / Haitner, Iftach; Makriyannis, Nikolaos; Ranellucci, Samuel et al.
Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. ed. / Orr Dunkelman; Stefan Dziembowski. Springer Science and Business Media Deutschland GmbH, 2022. p. 180-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13275 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Highly Efficient OT-Based Multiplication Protocols

AU - Haitner, Iftach

AU - Makriyannis, Nikolaos

AU - Ranellucci, Samuel

AU - Tsfadia, Eliad

PY - 2022

Y1 - 2022

N2 - We present a new OT -based two-party multiplication protocol that is almost as efficient as Gilboa’s semi-honest protocol (Crypto ’99), but has a high-level of security against malicious adversaries without further compilation. The achieved security suffices for many applications, and, assuming DDH, can be cheaply compiled into full security.

AB - We present a new OT -based two-party multiplication protocol that is almost as efficient as Gilboa’s semi-honest protocol (Crypto ’99), but has a high-level of security against malicious adversaries without further compilation. The achieved security suffices for many applications, and, assuming DDH, can be cheaply compiled into full security.

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

U2 - 10.1007/978-3-031-06944-4_7

DO - 10.1007/978-3-031-06944-4_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85131952447

SN - 9783031069437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 180

EP - 209

BT - Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings

A2 - Dunkelman, Orr

A2 - Dziembowski, Stefan

PB - Springer Science and Business Media Deutschland GmbH

T2 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022

Y2 - 30 May 2022 through 3 June 2022

ER -

Haitner I, Makriyannis N, Ranellucci S, Tsfadia E. Highly Efficient OT-Based Multiplication Protocols. In Dunkelman O, Dziembowski S, editors, Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 180-209. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-06944-4_7

Highly Efficient OT-Based Multiplication Protocols

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this