Low cost constant round MPC combining BMR and oblivious transfer
From MaRDI portal
Publication:5919016
DOI10.1007/s00145-020-09355-yzbMath1453.94085OpenAlexW2950849082MaRDI QIDQ5919016
Carmit Hazay, Eduardo Soria-Vazquez, Peter Scholl
Publication date: 6 November 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/2594665
Related Items (2)
Actively secure half-gates with minimum overhead under duplex networks ⋮ TinyKeys: a new approach to efficient multi-party computation
Uses Software
Cites Work
- Unnamed Item
- Optimizing authenticated garbling for faster secure two-party computation
- A proof of security of Yao's protocol for two-party computation
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Efficient pseudorandom correlation generators: silent OT extension and more
- Secure multi-party computation without agreement
- A Unified Approach to MPC with Preprocessing Using OT
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Efficient Three-Party Computation from Cut-and-Choose
- On the Security of the “Free-XOR” Technique
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- More Efficient Constant-Round Multi-party Computation from BMR and SHE
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Improved Garbled Circuit: Free XOR Gates and Applications
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Scalable and Unconditionally Secure Multiparty Computation
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Scalable Secure Multiparty Computation
This page was built for publication: Low cost constant round MPC combining BMR and oblivious transfer
