High-performance multi-party computation for binary circuits based on oblivious transfer
type: Item
instance of: scholarly article
title: High-performance multi-party computation for binary circuits based on oblivious transfer
zbMATH Open document ID: 1470.94080
author: Sai Sheshank Burra
author: Enrique Larraia
author: Jesper Buus Nielsen
author: Peter Sebastian Nordholt
author: Claudio Orlandi
author: Emmanuela Orsini
author: Peter Scholl
author: N. P. Smart
published in: Journal of Cryptology
publication date: 2021-08-10T00:00:00Z
full work available at URL: high-performance-multiparty-computation-for-binary-circuits-based-on-oblivious-transfer(da950287-6eda-4904-a59e-9e27b1e608f3).html
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7380420
zbMATH Keywords: multi-party computation
zbMATH Keywords: oblivious transfer
zbMATH Keywords: secret sharing
describes a project that uses: VIFF
describes a project that uses: VMCrypt
describes a project that uses: MiniLEGO
describes a project that uses: TASTY
describes a project that uses: FairplayMP
MaRDI profile type: Publication
OpenAlex ID: W3175787086
cites work: Two-Output Secure Computation with Malicious Adversaries
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Q4343426
cites work: Q4228503
cites work: Universally Composable Security
cites work: A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
cites work: Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
cites work: On the Security of the “Free-XOR” Technique
cites work: Asynchronous Multiparty Computation: Theory and Implementation
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
cites work: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
cites work: A Unified Approach to MPC with Preprocessing Using OT
cites work: Foundations of Cryptography
cites work: OT-Combiners via Secure Computation
cites work: On Robust Combiners for Oblivious Transfer and Other Primitives
cites work: Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
cites work: TinyKeys: a new approach to efficient multi-party computation
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q3549728
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Secure Arithmetic Computation with No Honest Majority
cites work: Efficient Implementation of the Orlandi Protocol
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: The IPS Compiler: Optimizations, Variants and Concrete Efficiency
cites work: Dishonest Majority Multi-Party Computation for Binary Circuits
cites work: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
cites work: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: LEGO for Two-Party Secure Computation
cites work: Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
cites work: Secure Two-Party Computation Is Practical
cites work: Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15--17, 2009. Proceedings
cites work: Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
DOI: 10.1007/S00145-021-09403-1
description: scientific article; zbMATH DE number 7380420