High-performance multi-party computation for binary circuits based on oblivious transfer
From MaRDI portal
Publication:2044760
DOI10.1007/s00145-021-09403-1zbMath1470.94080OpenAlexW3175787086MaRDI QIDQ2044760
Enrique Larraia, Nigel P. Smart, Peter Sebastian Nordholt, Sai Sheshank Burra, Claudio Orlandi, Emmanuela Orsini, Jesper Buus Nielsen, Peter Scholl
Publication date: 10 August 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/portal/da/publications/high-performance-multiparty-computation-for-binary-circuits-based-on-oblivious-transfer(da950287-6eda-4904-a59e-9e27b1e608f3).html
Related Items
More efficient oblivious transfer extensions ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ High-throughput secure three-party computation with an honest majority ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Actively secure setup for SPDZ
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
- Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
- Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15--17, 2009. Proceedings
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A Unified Approach to MPC with Preprocessing Using OT
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
- 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
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Semi-homomorphic Encryption and Multiparty Computation
- Two-Output Secure Computation with Malicious Adversaries
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Efficient Implementation of the Orlandi Protocol
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- LEGO for Two-Party Secure Computation
- Asynchronous Multiparty Computation: Theory and Implementation
- Secure Two-Party Computation Is Practical
- Foundations of Cryptography
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- Universally Composable Security
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Advances in Cryptology - CRYPTO 2003
- OT-Combiners via Secure Computation
- TinyKeys: a new approach to efficient multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
