ZKFDT: A Fair Exchange Scheme for Data Trading Based on Efficient Zero-Knowledge Proofs
In zero-trust environments, fair exchange schemes have long faced challenges of low efficiency and high computational overhead when verifying the integrity of large-scale data. To address these issues, this paper proposes ZKFDT, an efficient data fair exchange scheme based on optimized zero-knowledge proof algorithms, offering improvements in efficiency, fairness, and security. In terms of efficiency, ZKFDT leverages IPFS’s hash-based addressing mechanism to significantly reduce network communication overhead compared to traditional data transmission methods, while also optimizing the multi-scalar multiplication algorithm, improving proof generation efficiency by 2x. Regarding security, ZKFDT adopts the more secure ABR23 protocol, addressing the malleability attack vulnerabilities of Groth16 while maintaining its low communication overhead. Through the implementation of smart contracts, including proof verification, atomic swaps, and time-lock functionality, ZKFDT ensures fairness and immutability in data transactions. Experimental results show that ZKFDT demonstrates high efficiency and practical feasibility in large-scale data transaction applications.
Authors
- Yuhao Fu
- Fan Yang (ORCID: https://orcid.org/0000-0002-5757-6727)
- Jing Li (ORCID: https://orcid.org/0000-0002-2256-9818)
- Jianwei Liu (ORCID: https://orcid.org/0000-0002-5632-945X)
- Wei Wan
- Chun Long
Institutions
- Chinese Academy of Sciences (CN)
- Computer Network Information Center (CN)
Publication Details
- Published
- 2024-12-17
- DOI
- https://doi.org/10.1109/trustcom63139.2024.00303
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Chinese Academy of Sciences
- Research and Development