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

DOI10.1007/S10623-024-01379-WMaRDI QIDQ6564095zbMATH OpenFDO

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)

zbMATH Keywords

MPCdata availabilityEthereum shardingproof of custody

Mathematics Subject Classification ID

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

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

Cites work

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

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)