Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner; Nikolaos Makriyannis; Samuel Ranellucci; Eliad Tsfadia

doi:10.1007/978-3-031-06944-4_7

EUROCRYPT2022Top-tier venue

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

DOI Publisher

2022Year

7Citations

2Top-tier citations

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.

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

What it claims
Who builds on it
How it compares
Where it falls short

You ask

Your agent calls

Lunesearch_papers

Ask in Lune

Free to start. No credit card required.

Cited by top-tier papers2

Ask how each one uses it

Abstract

Ask about this paper

Ask your agent about it.

Cited by top-tier papers2

Related papers