Trending topic recommendation (TTR) has become a popular social service for social users to obtain interesting topics based on public social contents. Due to sensitive privacy, the traditional differential privacy (DP) methods are used to protect social contents. However, these DP methods rely on a fully trusted third party (TTP) without considering protecting the correlations of social keywords, and do not support the privacy-preserving online social content publication. In this paper, we propose a novel local DP-based trending topic recommendation (LDPTR) scheme to perform high-quality online TTR services while achieving local privacy-preserving social contents. Specifically, LDPTR first clusters the social keywords with high correlations into noisy graph classes based on a graph-based LDP (GLDP) algorithm for ensuring the keyword correlation privacy. Second, LDPTR adopts a novel mechanism called 2-compressive sensing indistinguishability (CSI) to generate noisy social topics, thereby preventing the user-linkage attack and breaking the curse of high-dimensional LDP. Then, a dynamic graph-based CSI (DGCSI) algorithm is proposed to protect the online social content privacy while ensuring data usability. Furthermore, LDPTR calculates the trending topics-of-interest with high burstiness by using a TDS model-based topic burstiness (TMTB) algorithm, which achieves effective TTR services. Our LDPTR scheme satisfies -LDP by detailed security analysis. Extensive experiments over two real-world datasets show that proposed LDPTR gets high data utility while ensuring high-level privacy.
Cross-chain interoperability can expand the ability of data interaction and value circulation between different blockchains, especially the value interaction and information sharing between industry consortium blockchains. However, some current public blockchain cross-chain technologies or data migration schemes between consortium blockchains need help to meet the consortium blockchain requirements for efficient two-way data interaction. The critical issue to solve in cross-chain technology is improving the efficiency of cross-chain exchange while ensuring the security of data transmission outside the consortium blockchain. In this article, we design a cross-chain architecture based on blockchain oracle technology. Then, we propose a bidirectional information cross-chain interaction approach (CCIO) based on the former architecture, we novelly improve three traditional blockchain oracle patterns, and we combine a mixture of symmetric and asymmetric keys to encrypt private information to ensure cross-chain data security. The experimental results demonstrate that the proposed CCIO approach can achieve efficient and secure two-way cross-chain data interactions and better meet the application needs of large-scale consortium blockchains.
1 January 2014 in Mathematical Problems in Engineering
Nowadays, internet is becoming a suitable way of accessing the databases. Such data are exposed to various types of attack with the aim to confuse the ownership proofing or the content protection. In this paper, we propose a new approach based on fragile zero watermarking for the authentication of numeric relational data. Contrary to some previous databases watermarking techniques which cause some distortions in the original database and may not preserve the data usability constraints, our approach simply seeks to generate the watermark from the original database. First, the adopted method partitions the database relation into independent square matrix groups. Then, group‐based watermarks are securely generated and registered in a trusted third party. The integrity verification is performed by computing the determinant and the diagonal’s minor for each group. As a result, tampering can be localized up to attribute group level. Theoretical and experimental results demonstrate that the proposed technique is resilient against tuples insertion, tuples deletion, and attributes values modification attacks. Furthermore, comparison with recent related effort shows that our scheme performs better in detecting multifaceted attacks.
With the widespread popularity of mobile devices and geolocation-related services, spatial keyword data has exploded in recent years. As an application, people are accustomed to using specific keywords to search for data in a given geometric range. To protect user privacy, searchable encryption technologies are used to encrypt data and user queries. Most existing works focus on either spatial attributes or keyword attributes over encrypted spatial keyword data, which cannot solve the problem of geographic keyword range queries directly. And several other works considering these two attributes have some limitations in terms of query efficiency and security assurance. In this article, we propose an efficient privacy-preserving geographic keyword Boolean range query (EPBRQ) scheme to solve existing challenges in the current work. In particular, we design a recoding algorithm to break the limits of the current work to achieve lower time complexity and employ secure Knn computation to protect user data privacy comprehensively. The security analysis shows that our solution can well protect the privacy of data and queries from cloud server threats. And numerous experiments based on real-world data also show that our scheme provides better query efficiency than existing works.
With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.
Identifying associations between lncRNAs and diseases can help understand disease-related lncRNAs and facilitate disease diagnosis and treatment. The dual-network integrated logistic matrix factorization (DNILMF) model has been used for drug–target interaction prediction, and good results have been achieved. We firstly applied DNILMF to lncRNA–disease association prediction (DNILMF-LDA). We combined different similarity kernel matrices of lncRNAs and diseases by using nonlinear fusion to extract the most important information in fused matrices. Then, lncRNA–disease association networks and similarity networks were built simultaneously. Finally, the Gaussian process mutual information (GP-MI) algorithm of Bayesian optimization was adopted to optimize the model parameters. The 10-fold cross-validation result showed that the area under receiving operating characteristic (ROC) curve (AUC) value of DNILMF-LDA was 0.9202, and the area under precision-recall (PR) curve (AUPR) was 0.5610. Compared with LRLSLDA, SIMCLDA, BiwalkLDA, and TPGLDA, the AUC value of our method increased by 38.81%, 13.07%, 8.35%, and 6.75%, respectively. The AUPR value of our method increased by 52.66%, 40.05%, 37.01%, and 44.25%. These results indicate that DNILMF-LDA is an effective method for predicting the associations between lncRNAs and diseases.