Preprint Article Version 1 This version is not peer-reviewed

SMPTC3: Secure Multi-party Protocol Based Trusted Cross-chain Contracts

Version 1 : Received: 27 July 2024 / Approved: 28 July 2024 / Online: 30 July 2024 (09:28:06 CEST)

How to cite: Mao, H.; Nie, T.; Yu, M.; Dong, X.; Li, X.; Yu, G. SMPTC3: Secure Multi-party Protocol Based Trusted Cross-chain Contracts. Preprints 2024, 2024072248. https://doi.org/10.20944/preprints202407.2248.v1 Mao, H.; Nie, T.; Yu, M.; Dong, X.; Li, X.; Yu, G. SMPTC3: Secure Multi-party Protocol Based Trusted Cross-chain Contracts. Preprints 2024, 2024072248. https://doi.org/10.20944/preprints202407.2248.v1

Abstract

We propose an innovative approach called SMPTC3, designed specifically to enhance security and privacy in cross-chain transaction verification. This approach addresses multi-chain, multi-participant information exchange and large-scale cross-chain transfers, resisting various types of malicious attacks. We leverage the verifiability of cross-chain transactions based on smart contracts and innovatively transform transaction information into confidential sets, organizing them into quadratic secret polynomials. By utilizing secret sharing and random distribution techniques, we construct a secure multiparty computation method, tailored for cross-chain transactions. To enhance the efficiency of cross-chain transactions, we introduce cross-chain batch processing technology, grouping inter-chain transactions into cross-chain transaction sets. Unlike traditional distributed notary technologies, SMPTC3 designates honest participants as a cross-chain notary group, reducing the time required for redundant signature confirmations and significantly lowering the possibility of malicious notaries. Theoretical analysis and empirical experiments demonstrate that SMPTC3 is highly efficient in addressing cross-chain transaction security issues.

Keywords

Blockchain; Cross-chain; Multi-party Secure Computation; Security

Subject

Computer Science and Mathematics, Information Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.