With the accelerating growth of the digital economy, data has emerged as a core asset, making secure and private data trading a pressing necessity. However, traditional centralized data trading platforms face critical challenges, including identity exposure, data leakage, unclear ownership, and lack of trust. Although decentralized, blockchain-based solutions have been proposed, they typically protect only subsets of these properties and seldom provide a unified, verifiable privacy architecture over the entire trading lifecycle. This article introduces a novel decentralized data trading system that comprehensively integrates Groth16-based zero-knowledge proofs (ZKPs), Merkle tree–based data ownership commitments, and smart contracts on blockchain. The proposed system ensures identity anonymity, data confidentiality, ownership traceability, and behavioral privacy while supporting regulatory auditability. Rather than proposing new cryptographic primitives, we reformulate data trading as a zero-knowledge–verifiable privacy problem and embed the resulting privacy logic into the protocol and contract design. The main contributions are as follows. (1) Developing a unified zero-knowledge privacy layer that combines Groth16-based ZKPs with proxy re-encryption, allowing participants to prove transaction eligibility without disclosing identity attributes while keeping traded data encrypted end-to-end. (2) Constructing a zero-knowledge-based ownership lifecycle in which Merkle trees are repurposed as privacy-preserving ownership commitment structures that support unlinkable ownership proof, secure ownership transfer, and privacy-preserving traceability. (3) Designing a malleability-aware ZKP execution framework for Groth16 proofs, implemented via dedicated “anti-malleability” contracts that bind proofs to ownership states, fresh randomness, and protocol stages, thereby mitigating proof malleability and unsafe reuse across the registration–sale–transfer lifecycle. (4) Integrating a trusted regulatory authority into the architecture to enable compliant yet anonymous audits and formulate a system-wide privacy framework covering identity, data, ownership, behavioral, and audit dimensions. Experimental results demonstrate that the system achieves strong privacy guarantees and low on-chain overhead, offering a more robust and privacy-centric approach to data transactions than existing solutions.

BACKGROUND: Cancer's complexity and heterogeneity pose significant challenges for personalized treatment. Accurate classification of patients into molecular subtypes is critical for targeted therapy and improved outcomes. However, existing methods often fail to simultaneously capture inter-patient heterogeneity and shared molecular patterns in driver gene profiles. RESULTS: To address this limitation, we propose DriverSub-SVM, a novel framework for interpretable cancer subtype classification that integrates patient-specific and cohort-wide driver gene information. Our method first models the bidirectional influence between mutated and dysregulated genes via a random walk on a functional interaction network. It then applies Bayesian Personalized Ranking (BPR) to infer personalized driver gene rankings for each patient. These rankings are aggregated into a consensus driver gene set using the Condorcet. Subsequently, a One-Against-One Multiclass Support Vector Machine (OAO-MSVM) classifies patients based on their gene-level profiles. Evaluated on multiple TCGA datasets, DriverSub-SVM outperformed four state-of-the-art methods, achieving higher accuracy and identifying clinically relevant genes associated with prognosis and therapeutic response. CONCLUSION: DriverSub-SVM offers an effective and interpretable approach for cancer subtype classification by bridging individual heterogeneity and population-level patterns. It enhances understanding of tumor biology and holds promise for precision oncology and biomarker discovery. The source code is available at https://github.com/sjunrong/DriverSub-SVM .

This paper deals with the design of optimal multiple gravity assist trajectories. An algorithm combining search space exploring and PCA (principal component analysis) is proposed. In this algorithm, firstly estimate the general position of function value valley by initializing a number of samples in global search space, and pick out a part of excellent samples from the initial samples. Then cluster the remaining excellent samples into several communities, researching on each community by PCA (principal component analysis), which can reflects the relationship between objective function and variables, as well as provide the densest direction of samples distribution. Count out distribution range of samples in each community which also represents the space size of it. Divide the communities in which we can find a better value when search with standard differential evolution algorithm into several small spaces from the direction we find. Finally, search the optimal value with standard differential evolution algorithm in every small space gained. Experimental results show that this method can effectively improve the optimization results.