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

DOI10.1007/S10623-017-0424-7MaRDI QIDQ1650437zbMATH OpenOpenAlexWikidataFDO

Authors Maki Yoshida, Satoshi Obana

Publication date 3 July 2018

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

communication complexityinformation-theoretical securitylower boundnon-interactivesecure multi-party computation

Mathematics Subject Classification ID

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

Recommendations

• On the (in)efficiency of non-interactive secure multiparty computation
• An efficient construction of non-interactive secure multiparty computation
• Non-interactive secure multiparty computation
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• Robust non-interactive multiparty computation against constant-size collusion

Cites work

• Efficient general-adversary multi-party computation
• General secure multi-party computation from any linear secret-sharing scheme
• scientific article; zbMATH DE number 1952886 (Why is no real title available?)
• Non-interactive secure multiparty computation
• On \(d\)-multiplicative secret sharing
• On the (in)efficiency of non-interactive secure multiparty computation
• On the communication complexity of secure computation
• Player simulation and general adversary structures in perfect multiparty computation
• Robust non-interactive multiparty computation against constant-size collusion

Cited in

(11)

• Robust non-interactive multiparty computation against constant-size collusion
• The price of low communication in secure multi-party computation
• Non-interactive multiparty computation without correlated randomness
• On the message complexity of secure multiparty computation
• An efficient construction of non-interactive secure multiparty computation
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• Efficient information-theoretic multi-party computation over non-commutative rings
• Blockchains enable non-interactive MPC
• On the (in)efficiency of non-interactive secure multiparty computation
• Non-interactive secure multiparty computation
• Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650437)