eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

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
Creative Commons Attribution
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},
      note = {\url{https://eprint.iacr.org/2021/1373}},
      url = {https://eprint.iacr.org/2021/1373}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.