Efficient blockchain-based knowledge data sharing with All-or-Nothing Transform threshold secret scheme

The increasing reliance on decentralized infrastructures for knowledge management necessitates secure, scalable, and efficient data sharing mechanisms. This paper proposes an efficient blockchain-based knowledge data sharing framework that combines the Greedy Threshold Set Cover Protocol (Greedy TSCP) with an All-or-Nothing Transform (AONT) to form a novel threshold secret sharing scheme without encryption. The scheme addresses the limitations of traditional polynomial-based and modular arithmetic approaches by offering lightweight computation and eliminating the need for interpolation. We formalize the security guarantees of the proposed GreedyTSCP-AONT scheme under the Universally Composable (UC) framework, providing an ideal functionality and proving its realization against static adversaries (who fix the set of corrupted servers before the protocol begins) and rushing adversaries (who may delay honest-party messages within the bounded-delay network model). The construction achieves information-theoretic security and leverages decentralized storage nodes to avoid single points of failure, while blockchain integration ensures transparency, tamper resistance, and auditability. The scheme is especially suited for large-scale knowledge data sharing in distributed environments, where conventional secret sharing schemes become computationally infeasible. Experimental evaluations show notable efficiency improvements over Shamir-based and Chinese Remainder Theorem (CRT)-based methods, demonstrating the practical viability of our approach for secure, high-throughput knowledge dissemination.