{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:42:41Z","timestamp":1769766161802,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10623-024-01379-w","type":"journal-article","created":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T13:03:37Z","timestamp":1711544617000},"page":"2055-2083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient secure multi-party computation for proof of custody in Ethereum sharding"],"prefix":"10.1007","volume":"92","author":[{"given":"Yuxin","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9985-1782","authenticated-orcid":false,"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,27]]},"reference":[{"key":"1379_CR1","unstructured":"Aly A., Cong K., Cozzo D., Keller M., Orsini E., Rotaru D., Scherer O., Scholl P., Smart N., Tanguy T., et al.: Scale\u2013mamba v1. 12: Documentation. Accessed May (2021)."},{"key":"1379_CR2","doi-asserted-by":"crossref","unstructured":"Aly A., Orsini E., Rotaru D., Smart N.P., Wood T.: Zaphod: efficiently combining LSSS and garbled circuits in scale. In: Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 33\u201344 (2019).","DOI":"10.1145\/3338469.3358943"},{"key":"1379_CR3","doi-asserted-by":"crossref","unstructured":"Aranha D.F., Fuentes-Castaeda L., Knapp E., Menezes A., Rodr\u00ediguez-Henr\u00edquez F.: Implementing pairings at the 192-bit security level. In: International Conference on Pairing-Based Cryptography (2012).","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"1379_CR4","unstructured":"Baum C., Cozzo D., Smart N.P.: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ. Cryptology ePrint Archive, Paper 2019\/035. https:\/\/eprint.iacr.org\/2019\/035 (2019)."},{"key":"1379_CR5","unstructured":"Beekhuizen C.: BLS12-381 deterministic account hierarchy. https:\/\/github.com\/ethereum\/EIPs\/blob\/e2ef8830c75890eca505833c14734b7d9f8bab6f\/EIPS\/eip-2334.md (2019)."},{"key":"1379_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Efraim A., Nielsen M., Omri E.: Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing. In: Applied Cryptography and Network Security: 17th International Conference, ACNS 2019, Bogota, Colombia, June 5\u20137, 2019, Proceedings 17, pp. 530\u2013549. Springer, New York (2019).","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"1379_CR7","unstructured":"Boneh D., Gorbunov S., Wahby R.S., Wee H., Wood C.A., Zhang Z.: BLS Signatures. Internet-Draft draft-irtf-cfrg-bls-signature-05, Internet Engineering Task Force (June 2022). Work in Progress. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-bls-signature\/05\/."},{"key":"1379_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D., Lynn B., Shacham H.: Short Signatures from the Weil Pairing. In: International Conference on the Theory and Application of Cryptology and Information Security (2001).","DOI":"10.1007\/3-540-45682-1_30"},{"key":"1379_CR9","unstructured":"Bowe S.: BLS12-381: new zk-SNARK elliptic curve construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/ (2017)."},{"key":"1379_CR10","unstructured":"Buterin V., Feist D.: EIP-4844: shard blob transactions. https:\/\/eips.ethereum.org\/EIPS\/eip-4844 (2022)."},{"key":"1379_CR11","unstructured":"Buterin V.: An explanation of the sharding + DAS proposal. https:\/\/hackmd.io\/@vbuterin\/sharding_proposal#ELI5-data-availability-sampling (2022)."},{"key":"1379_CR12","unstructured":"Buterin V.: Ethereum: a next-generation smart contract and decentralized application platform. https:\/\/ethereum.org\/en\/whitepaper\/ (2014)."},{"key":"1379_CR13","unstructured":"Buterin V.: Exploring elliptic curve pairings. https:\/\/medium.com\/@VitalikButerin\/exploring-elliptic-curve-pairings-c73c1864e627 (2017)."},{"key":"1379_CR14","unstructured":"Buterin V.: Extending skin-in-the-game of notarization with proofs of custody. https:\/\/ethresear.ch\/t\/extending-skin-in-the-game-of-notarization-with-proofs-of-custody\/1639 (2018)."},{"key":"1379_CR15","unstructured":"Buterin V.: Proof of custody game design. https:\/\/github.com\/ethereum\/consensus-specs\/issues\/568 (2019)."},{"key":"1379_CR16","doi-asserted-by":"crossref","unstructured":"Canetti R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001). IEEE.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1379_CR17","doi-asserted-by":"crossref","unstructured":"Catrina O., De\u00a0Hoogh S.: Improved primitives for secure multiparty integer computation. In: Security and Cryptography for Networks: 7th International Conference, SCN 2010, Amalfi, Italy, September 13\u201315, 2010. Proceedings 7, pp. 182\u2013199. Springer, New York (2010).","DOI":"10.1007\/978-3-642-15317-4_13"},{"key":"1379_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Escudero D., Frederiksen T., Keller M., Scholl P., Volgushev N.: New primitives for actively-secure MPC over rings with applications to private machine learning. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1102\u20131120 (2019). IEEE.","DOI":"10.1109\/SP.2019.00078"},{"key":"1379_CR19","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Fitzi M., Kiltz E., Nielsen J.B., Toft T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Theory of Cryptography Conference, pp. 285\u2013304. Springer, New York (2006).","DOI":"10.1007\/11681878_15"},{"key":"1379_CR20","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I.B.: On the randomness of Legendre and Jacobi sequences. In: Advances in Cryptology-Proceedings of CRYPRO 88 (1989).","DOI":"10.1007\/0-387-34799-2_13"},{"key":"1379_CR21","unstructured":"Data61: MP-SPDZ. https:\/\/github.com\/data61\/MP-SPDZ (2019)."},{"key":"1379_CR22","unstructured":"Drake J.: 1-bit aggregation-friendly custody bonds. https:\/\/ethresear.ch\/t\/1-bit-aggregation-friendly-custody-bonds\/2236 (2018)."},{"key":"1379_CR23","doi-asserted-by":"crossref","unstructured":"Escudero D., Ghosh S., Keller M., Rachuri R., Scholl P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Annual International Cryptology Conference, pp. 823\u2013852. Springer, New York (2020).","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"1379_CR24","unstructured":"Ethereum Foundation: Ethereum distributed validator specification. https:\/\/github.com\/ethereum\/distributed-validator-specs (2022)."},{"key":"1379_CR25","unstructured":"Ethereum Foundation: the Ethereum specification for Proof of custody. https:\/\/github.com\/ethereum\/consensus-specs\/tree\/dev\/specs\/_features\/custody_game (2023)."},{"key":"1379_CR26","unstructured":"Ethereum: Danksharding. https:\/\/ethereum.org\/en\/roadmap\/danksharding\/ (2023)."},{"key":"1379_CR27","unstructured":"Ethereum: Data Availability. https:\/\/ethereum.org\/en\/developers\/docs\/data-availability\/ (2023)."},{"key":"1379_CR28","unstructured":"Ethereum: Upgrading Ethereum to radical new heights. https:\/\/ethereum.org\/en\/upgrades\/."},{"key":"1379_CR29","unstructured":"Falk B.H., Noble D.: Secure computation over lattices and elliptic curves. Cryptology ePrint Archive (2020)."},{"key":"1379_CR30","unstructured":"Feist D.: A 0.001 bit proof of custody. https:\/\/ethresear.ch\/t\/a-0-001-bit-proof-of-custody\/7409 (2020)."},{"key":"1379_CR31","unstructured":"Feist D.: Data availability checks. https:\/\/dankradfeist.de\/ethereum\/2019\/12\/20\/data-availability-checks.html (2019)."},{"key":"1379_CR32","unstructured":"Feist D.: Proof of concept of an Eth2 secret shared validator node. https:\/\/github.com\/dankrad\/python-ssv (2020)."},{"key":"1379_CR33","unstructured":"Feist D.: Update the proof of custody construction using inputs from the Khovratovich audit. https:\/\/github.com\/ethereum\/consensus-specs\/issues\/1378 (2019)."},{"key":"1379_CR34","unstructured":"Feist D.: Use Legendre as a PRF for the proof of custody. https:\/\/github.com\/ethereum\/consensus-specs\/issues\/1080 (2019)."},{"key":"1379_CR35","unstructured":"Feist D.: Using the Legendre symbol as a PRF for the Proof of custody. https:\/\/ethresear.ch\/t\/using-the-legendre-symbol-as-a-prf-for-the-proof-of-custody\/5169 (2019)."},{"key":"1379_CR36","doi-asserted-by":"crossref","unstructured":"Grassi L., Rechberger C., Rotaru D., Scholl P., Smart N.P.: MPC-friendly symmetric key primitives. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 430\u2013443 (2016).","DOI":"10.1145\/2976749.2978332"},{"key":"1379_CR37","doi-asserted-by":"crossref","unstructured":"Keller M., Orsini E., Scholl P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 830\u2013842 (2016).","DOI":"10.1145\/2976749.2978357"},{"key":"1379_CR38","doi-asserted-by":"crossref","unstructured":"Keller M., Pastro V., Rotaru D.: Overdrive: making SPDZ great again. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 158\u2013189. Springer, New York (2018).","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"1379_CR39","doi-asserted-by":"crossref","unstructured":"Keller M.: MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1575\u20131590 (2020).","DOI":"10.1145\/3372297.3417872"},{"key":"1379_CR40","doi-asserted-by":"crossref","unstructured":"Luu L., Teutsch J., Kulkarni R., Saxena P.: Demystifying incentives in the consensus computer. In: the 22nd ACM SIGSAC Conference (2015).","DOI":"10.1145\/2810103.2813659"},{"key":"1379_CR41","doi-asserted-by":"crossref","unstructured":"Nishide T., Ohta K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Public Key Cryptography\u2013PKC 2007: 10th International Conference on Practice and Theory in Public-Key Cryptography Beijing, China, April 16-20, 2007. Proceedings 10, pp. 343\u2013360. Springer, New York (2007).","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"1379_CR42","unstructured":"Panther Team: Understanding distributed validator technology (DVT). https:\/\/blog.pantherprotocol.io\/understanding-distributed-validator-technology-dvt\/#private-key-custody (2022)."},{"key":"1379_CR43","unstructured":"Roos C., Li B.: What is DVT and how does it improve staking on ethereum? https:\/\/blog.obol.tech\/what-is-dvt-and-how-does-it-improve-staking-on-ethereum\/ (2022)."},{"key":"1379_CR44","unstructured":"Rotaru D., Smart N.P., Tanguy T., Vercauteren F., Wood T.: Actively Secure Setup for SPDZ. Cryptology ePrint Archive, Report 2019\/1300 (2019)."},{"key":"1379_CR45","doi-asserted-by":"crossref","unstructured":"Rotaru D., Wood T.: MArBled circuits: mixing arithmetic and Boolean circuits with active security. In: International Conference on Cryptology in India, pp. 227\u2013249. Springer, New York (2019).","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"1379_CR46","unstructured":"SecureSCM: security analysis. Deliverable D9.2, EU FP7 Project Secure Supply Chain Management (SecureSCM) (2009)."},{"key":"1379_CR47","unstructured":"Smart N.P., Alaoui Y.T.: Distributing any elliptic curve based protocol. Cryptology ePrint Archive, Paper 2019\/768. https:\/\/eprint.iacr.org\/2019\/768 (2019)."},{"key":"1379_CR48","unstructured":"SSV Networks: SSV Tech Overview. https:\/\/ssv.network\/tech\/#ssv-technical-overview (2022)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01379-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01379-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01379-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T03:26:01Z","timestamp":1731641161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01379-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,27]]},"references-count":48,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1379"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01379-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,27]]},"assertion":[{"value":"29 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}