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

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

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

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

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

Cites Work

• Overdrive: making SPDZ great again
• Improved primitives for MPC over mixed arithmetic-binary circuits
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Improved Primitives for Secure Multiparty Integer Computation
• Implementing Pairings at the 192-Bit Security Level
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography

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)