On the (in)efficiency of non-interactive secure multiparty computation
type: Item
instance of: scholarly article
title: On the (in)efficiency of non-interactive secure multiparty computation
zbMATH Open document ID: 1403.68069
author: Maki Yoshida
author: Satoshi Obana
published in: Designs, Codes and Cryptography
publication date: 2018-07-03T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6898273
zbMATH Keywords: secure multi-party computation
zbMATH Keywords: non-interactive
zbMATH Keywords: information-theoretical security
zbMATH Keywords: communication complexity
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: s10623-017-0424-7
OpenAlex ID: W2789739729
cites work: On \(d\)-multiplicative secret sharing
cites work: Non-Interactive Secure Multiparty Computation
cites work: Robust non-interactive multiparty computation against constant-size collusion
cites work: Player simulation and general adversary structures in perfect multiparty computation
cites work: Q3374918
cites work: On the Communication Complexity of Secure Computation
cites work: Efficient General-Adversary Multi-Party Computation
cites work: Q4414265
cites work: On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
Wikidata QID: Q130068006
DOI: 10.1007/S10623-017-0424-7
description: scientific article; zbMATH DE number 6898273