Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / oblivious transfer, two-party computation, multiplication, OLE, VOLE

Date: received 11 Oct 2021, last revised 12 Oct 2021

Contact author: nikos at fireblocks com, iftachh at taux tau ac il, samuel ranellucci at unboundsecurity com, eliadtsfadia at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20211012:063058 (All versions of this report)

Short URL: ia.cr/2021/1373


[ Cryptology ePrint archive ]