Efficient secure multi-party computation for proof of custody in Ethereum sharding

DOI10.1007/S10623-024-01379-WzbMATH Open1542.94143MaRDI QIDQ6564095FDOQ6564095

Authors: Yuxin Tong, Xiang Xie, Kang Yang, Rui Zhang, Rui Xue 

Publication date: 28 June 2024

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

Recommendations

• Absentia: secure multiparty computation on ethereum
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities
• Robust multiparty computation with faster verification time
• Fast large-scale honest-majority MPC for malicious adversaries
• Fast large-scale honest-majority MPC for malicious adversaries

zbMATH Keywords

MPCdata availabilityEthereum shardingproof of custody

Mathematics Subject Classification ID

Macroeconomic theory (monetary models, models of taxation) (91B64) Cryptography (94A60)

Cites Work

• Implementing pairings at the 192-bit security level
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Improved primitives for secure multiparty integer computation
• Theory of Cryptography
• Overdrive: making SPDZ great again
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Improved primitives for MPC over mixed arithmetic-binary circuits

This page was built for publication: Efficient secure multi-party computation for proof of custody in Ethereum sharding

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