\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
type: Item
instance of: scholarly article
title: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
zbMATH Open document ID: 1428.94060
DOI: 10.1007/978-3-319-78375-8_17
author: Fabrice Benhamouda
author: Huijia Lin
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6900713
MaRDI profile type: Publication
full work available at URL: 978-3-319-78375-8 17
OpenAlex ID: W2794717746
Recommended article: On multiparty garbling of arithmetic circuits
Recommended article: Round-optimal secure multi-party computation
Recommended article: High-performance multi-party computation for binary circuits based on oblivious transfer
Recommended article: Round optimal secure multiparty computation from minimal assumptions
Recommended article: Q4343427
Recommended article: Round-optimal and communication-efficient multiparty computation
Recommended article: Topics in Cryptology – CT-RSA 2006
Recommended article: A New Efficient Protocol for k-out-of-n Oblivious Transfer
Recommended article: Q3518415
description: scientific article; zbMATH DE number 6900713