Paper 2021/1373
Highly Efficient OT-Based Multiplication Protocols
Iftach Haitner, Nikolaos Makriyannis, 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
- A minor revision of an IACR publication in EUROCRYPT 2022
- Keywords
- oblivious transfertwo-party computationmultiplicationOLEVOLE
- Contact author(s)
-
nikos @ fireblocks com
iftachh @ taux tau ac il
samuel ranellucci @ coinbase 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
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1373,
author = {Iftach Haitner and Nikolaos Makriyannis and Samuel Ranellucci and Eliad Tsfadia},
title = {Highly Efficient {OT}-Based Multiplication Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1373},
year = {2021},
url = {https://eprint.iacr.org/2021/1373}
}