Robust multiparty computation with faster verification time

DOI10.1007/978-3-319-93638-3_8MaRDI QIDQ1784445zbMATH OpenOpenAlexFDO

Authors Souradyuti Paul, Ananya Shrivastava

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93638-3_8

zbMATH Keywords

fairnessrobustnessmulti-party computationblockchainEthereum

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Fast large-scale honest-majority MPC for malicious adversaries
• Fast large-scale honest-majority MPC for malicious adversaries
• Verifiable computation in multiparty protocols with honest majority
• Robust Multiparty Computation with Linear Communication Complexity
• Minimising communication in honest-majority MPC by batchwise multiplication verification

Cited in

(4)

• Efficient secure multi-party computation for proof of custody in Ethereum sharding
• Absentia: secure multiparty computation on ethereum
• Game-Theoretic Analysis of an Incentivized Verifiable Computation System
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic

This page was built for publication: Robust multiparty computation with faster verification time

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