On the (in)efficiency of non-interactive secure multiparty computation

DOI10.1007/s10623-017-0424-7zbMath1403.68069OpenAlexW2789739729WikidataQ130068006 ScholiaQ130068006MaRDI QIDQ1650437

Maki Yoshida, Satoshi Obana

Publication date: 3 July 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-017-0424-7

zbMATH Keywords

lower boundcommunication complexitysecure multi-party computationinformation-theoretical securitynon-interactive

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (1)

Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions

Cites Work

• Unnamed Item
• Unnamed Item
• On \(d\)-multiplicative secret sharing
• Robust non-interactive multiparty computation against constant-size collusion
• Player simulation and general adversary structures in perfect multiparty computation
• On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
• Efficient General-Adversary Multi-Party Computation
• On the Communication Complexity of Secure Computation
• Non-Interactive Secure Multiparty Computation

This page was built for publication: On the (in)efficiency of non-interactive secure multiparty computation