Highly efficient OT-based multiplication protocols

DOI10.1007/978-3-031-06944-4_7MaRDI QIDQ2169999zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06944-4_7

zbMATH Keywords

Gilboa's semi-honest protocoltwo-party multiplication protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• More efficient oblivious transfer extensions
• Efficient oblivious transfer protocols
• A new approach to practical active-secure two-party computation
• Atomic Secure Multi-party Multiplication with Low Communication
• Secure two-party computation via cut-and-choose oblivious transfer

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• Actively secure setup for SPDZ
• Breaking the circuit size barrier for secure computation under DDH
• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
• Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
• Efficient protocols for oblivious linear function evaluation from ring-LWE
• Foundations of Cryptography
• Function secret sharing
• Functional encryption: definitions and challenges
• Homomorphic secret sharing from lattices without FHE
• Maliciously secure oblivious linear function evaluation with constant overhead
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation for dishonest majority: from passive to active security at low cost
• Oblivious Polynomial Evaluation
• Secure Arithmetic Computation with No Honest Majority
• Security and composition of multiparty cryptographic protocols

Cited in

(1)

• High-performance multi-party computation for binary circuits based on oblivious transfer

This page was built for publication: Highly efficient OT-based multiplication protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169999)