<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">JERA</journal-id><journal-title-group><journal-title>Journal of Electronic Research and Application</journal-title></journal-title-group><issn>2208-3502</issn><eissn>2208-3510</eissn><publisher><publisher-name>Bio-Byword Scientific Publishing Pty. Ltd.</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26689/JERA.v10i8.15210</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>Research on a Trustworthy Collaborative Computing Mechanism for Cross-Domain Sensitive Data Based on Secure Multi-party Computation</title><url>https://artdesignp.com/journal/JERA/10/8/10.26689/JERA.v10i8.15210</url><author>YangHao,ChenMutong,NiXiong</author><pub-date pub-type="publication-year"><year>2026</year></pub-date><volume>10</volume><issue>8</issue><history><date date-type="pub"><published-time>2026-09-03</published-time></date></history><abstract>In the digital economy era, cross-domain data circulation has shifted from traditional data exchange to value-based collaborative computing. Cross-institutional data in scenarios such as shipping trade, financial risk control, government supervision, and supply chain collaboration possess characteristics of high sensitivity, strong ownership, and high compliance constraints. Direct sharing of raw data can easily lead to issues such as leakage of commercial secrets, exposure of customer resources, violation of cross-border data regulations, and ambiguity in liability determination. Secure Multi-Party Computation (MPC), with its characteristics of &amp;ldquo;data not leaving the domain, value can be calculated, and results can be trusted&amp;rdquo;, has become the core privacy-enhancing technology for resolving the core privacy challenges in cross-domain sensitive data collaboration. This paper takes secret sharing, obfuscation circuits, and inadvertent transmission as the core protocols, integrates blockchain, DID, and smart contract technologies, builds a trusted collaborative computing mechanism for sensitive data across various domains, and constructs a standardized task lifecycle and on-chain-off-chain collaborative governance system. By verifying the effectiveness of the mechanism in four typical industry scenarios, it systematically analyzes the core bottlenecks in the implementation of the MPC project, such as performance, standardization, malicious protection, and result inference, and proposes template compilation, verifiable auditing, and privacy governance optimization solutions, providing a reference for the construction of a trusted collaborative infrastructure for privacy data across various domains.</abstract><keywords>Secure multi-party computation, Cross-domain data circulation, Sensitive data, Secret sharing, Garbled circuits, Blockchain, DID, Trusted collaborative computing</keywords></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>[1] &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Shamir A, 1979, How to Share a Secret. Communications of the ACM, 22(11): 612&amp;ndash;613.
[2] &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Yao A, 1982, Protocols for Secure Computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 160&amp;ndash;164.
[3] &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Yao A, 1986, How to Generate and Exchange Secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 162&amp;ndash;167.
[4] &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Goldreich O, Micali S, Wigderson A, 1987, How to Play Any Mental Game. Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 218&amp;ndash;229.
[5] &amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Ben-Or M, Goldwasser S, Wigderson A, 1988, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1&amp;ndash;10.</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
