You are looking at a specific version 20211012:063058 of this paper. See the latest version.

Paper 2021/1373

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner and Nikolaos Makriyannis and Samuel Ranellucci and Eliad Tsfadia

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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
oblivious transfertwo-party computationmultiplicationOLEVOLE
Contact author(s)
nikos @ fireblocks com,iftachh @ taux tau ac il,samuel ranellucci @ unboundsecurity com,eliadtsfadia @ gmail com
History
2022-04-19: last of 2 revisions
2021-10-12: received
See all versions
Short URL
https://ia.cr/2021/1373
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.