On multiparty garbling of arithmetic circuits
type: Item
instance of: scholarly article
title: On multiparty garbling of arithmetic circuits
zbMATH Open document ID: 1447.94020
DOI: 10.1007/978-3-030-03332-3_1
author: Aner Ben-Efraim
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005632
zbMATH Keywords: arithmetic garbled circuits
zbMATH Keywords: constant round MPC
zbMATH Keywords: multiparty garbling
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 1
OpenAlex ID: W2794924128
cites work: How to Garble Arithmetic Circuits
cites work: Concrete efficiency improvements for multiparty garbling with an honest majority
cites work: On the Security of the “Free-XOR” Technique
cites work: Q4783722
cites work: Asynchronous Multiparty Computation: Theory and Implementation
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
cites work: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
cites work: Foundations of Cryptography
cites work: Fast garbling of circuits under standard assumptions
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
cites work: LEGO for Two-Party Secure Computation
cites work: Secure Two-Party Computation Is Practical
cites work: Two Halves Make a Whole
cites work: Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
description: scientific article; zbMATH DE number 7005632