[Resource Topic] 2021/1373: Highly Efficient OT-Based Multiplication Protocols

Welcome to the resource topic for 2021/1373

Title:
Highly Efficient OT-Based Multiplication Protocols

Authors: Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, 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.

ePrint: https://eprint.iacr.org/2021/1373

Talk: https://www.youtube.com/watch?v=f9QyAk5f7uM

Slides: https://iacr.org/submit/files/slides/2022/eurocrypt/eurocrypt2022/243/slides.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .