Highly efficient OT-based multiplication protocols
From MaRDI portal
Publication:2169999
DOI10.1007/978-3-031-06944-4_7zbMath1496.94047OpenAlexW3206175866MaRDI QIDQ2169999
Eliad Tsfadia, Iftach Haitner, Samuel Ranellucci, Nikolaos Makriyannis
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_7
Cites Work
- Unnamed Item
- Unnamed Item
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Security and composition of multiparty cryptographic protocols
- Actively secure setup for SPDZ
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Homomorphic secret sharing from lattices without FHE
- Maliciously secure oblivious linear function evaluation with constant overhead
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Multiparty Computation from Somewhat Homomorphic Encryption
- Function Secret Sharing
- Functional Encryption: Definitions and Challenges
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
- Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
- Secure Arithmetic Computation with No Honest Majority
- Foundations of Cryptography
- Oblivious Polynomial Evaluation
This page was built for publication: Highly efficient OT-based multiplication protocols
