Electronic health record sharing can help to improve the accuracy of diagnosis, where security and privacy preservation are critical issues in the systems. In recent years, blockchain has been proposed to be a promising solution to achieve personal health information (PHI) sharing with security and privacy preservation due to its advantages of immutability. This work proposes a blockchain-based secure and privacy-preserving PHI sharing (BSPP) scheme for diagnosis improvements in e-Health systems. Firstly, two kinds of blockchains, private blockchain and consortium blockchain, are constructed by devising their data structures, and consensus mechanisms. The private blockchain is responsible for storing the PHI while the consortium blockchain keeps records of the secure indexes of the PHI. In order to achieve data security, access control, privacy preservation and secure search, all the data including the PHI, keywords and the patients' identity are public key encrypted with keyword search. Furthermore, the block generators are required to provide proof of conformance for adding new blocks to the blockchains, which guarantees the system availability. Security analysis demonstrates that the proposed protocol can meet with the security goals. Furthermor, we implement the proposed scheme on JUICE to evaluate the performance.

Towards Secure and Privacy-Preserving Data Sharing in e-Health Systems via Consortium Blockchain

With the explosive growth of Internet of Things devices and massive data produced at the edge of the network, the traditional centralized cloud computing model has come to a bottleneck due to the bandwidth limitation and resources constraint. Therefore, edge computing, which enables storing and processing data at the edge of the network, has emerged as a promising technology in recent years. However, the unique features of edge computing, such as content perception, real-time computing, and parallel processing, has also introduced several new challenges in the field of data security and privacy-preserving, which are also the key concerns of the other prevailing computing paradigms, such as cloud computing, mobile cloud computing, and fog computing. Despites its importance, there still lacks a survey on the recent research advance of data security and privacy-preserving in the field of edge computing. In this paper, we present a comprehensive analysis of the data security and privacy threats, protection technologies, and countermeasures inherent in edge computing. Specifically, we first make an overview of edge computing, including forming factors, definition, architecture, and several essential applications. Next, a detailed analysis of data security and privacy requirements, challenges, and mechanisms in edge computing are presented. Then, the cryptography-based technologies for solving data security and privacy issues are summarized. The state-of-the-art data security and privacy solutions in edge-related paradigms are also surveyed. Finally, we propose several open research directions of data security in the field of edge computing.

Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues

An electronic health (e-health) record system is a novel application that will bring great convenience in healthcare. The privacy and security of the sensitive personal information are the major concerns of the users, which could hinder further development and widely adoption of the systems. The searchable encryption (SE) scheme is a technology to incorporate security protection and favorable operability functions together, which can play an important role in the e-health record system. In this paper, we introduce a novel cryptographic primitive named as conjunctive keyword search with designated tester and timing enabled proxy reencryption function (Re-dtPECK), which is a kind of a time-dependent SE scheme. It could enable patients to delegate partial access rights to others to operate search functions over their records in a limited time period. The length of the time period for the delegatee to search and decrypt the delegator’s encrypted documents can be controlled. Moreover, the delegatee could be automatically deprived of the access and search authority after a specified period of effective time. It can also support the conjunctive keywords search and resist the keyword guessing attacks. By the solution, only the designated tester is able to test the existence of certain keywords. We formulate a system model and a security model for the proposed Re-dtPECK scheme to show that it is an efficient scheme proved secure in the standard model. The comparison and extensive simulations demonstrate that it has a low computation and storage overhead.

Conjunctive Keyword Search With Designated Tester and Timing Enabled Proxy Re-Encryption Function for E-Health Clouds

Security and privacy protection in cloud computing: Discussions and challenges

Outsourcing medical data and their search services to a third party cloud have been a popular trend for many medical practices, because using healthcare cloud services can help cut down the cost of Electronic Health Records (EHR) systems in terms of front-end ownership cost and IT maintenance burdens. Healthcare cloud applications need searchable encryption with the following two capabilities for protecting data privacy and access privacy: (1) the healthcare providers need to share the encrypted data with authorized users and enable querying over encrypted data, and (2) they also need to keep the query keywords and associated search operations private such that healthcare data hosting service providers cannot gain access to unauthorized content or trace and infer sensitive data stored in the healthcare cloud. This survey paper describes the notion of searchable encryption (SE) in the context of healthcare applications and characterize the SE use cases into four scenarios in healthcare. Then we provide a comprehensive overview of the four representative SE techniques: searchable symmetric encryption (SSE), public key encryption with keyword search (PEKS), attribute-based encryption with keyword search (ABKS), and proxy re-encryption with keyword search (PRES) according to different EHR retrieving scenarios and requirements. We categorize and compare the different SE schemes in terms of their security, efficiency, and functionality. The survey is designed to benefit both experienced researchers in the computer science (CS) field and non-specialists who are domain scientists or healthcare professionals with limited CS and information security background. Thus, we are in favor of technological overview of the state of art searchable encryption models and the underlying key techniques, instead of detailed proofs and constructions of the respective SE algorithms. We describe how the existing SE schemes relate to and differ from one another, and point out the connections between the SE techniques and the security and privacy requirements of healthcare applications and the open research problems.

Searchable Encryption for Healthcare Clouds: A Survey

Further observation on proxy re-encryption with keyword search

All-polymer solar cells (all-PSCs) with mechanical and thermal stability have potential for applications in flexible devices. Polymer acceptors based on naphthalene diimide (NDI) have been widely studied because of their strong electron affinity, high electron mobility, and high mechanical reliability. However, controlling the film morphology of the polymer–polymer blends of NDI-based all-PSCs is difficult. Consequently, all-PSCs based on NDI building blocks exhibit a low fill factor (FF) and a lower power-conversion efficiency (PCE) than state-of-the-art polymer solar cells. In this work, we added a small amount of dicyanodistyrylbenzene (DCB) unit to the NDI-based polymer acceptor N2200 through random copolymerization and synthesized a series of NDI-based terpolymer acceptors PNDIx, where x is the molar concentration of DCB units relative to NDI units. PNDI5 and PNDI10, corresponding to 5% and 10% molar concentrations of DCB, respectively, showed lower crystallization and good miscibility with PBDB-T, a widely used electron-donating copolymer, than the terpolymer based on DCB-free N2200. Moreover, compared to the PBDB-T:N2200 device, the PNDI5-based device exhibited a much higher PCE (8.01%), and an enhanced FF of 0.75 in all-PSCs. These results indicate that ternary random copolymerization is a convenient and effective strategy for optimizing the film morphology of NDI-based polymers, and that the resulting terpolymer acceptor is a promising n-type acceptor for constructing high-performance all-PSCs.

/pdf/naphthalene-diimide-based-random-terpolymer-acceptors-for-ngyh3vw3.pdf

Naphthalene diimide-based random terpolymer acceptors for constructing all-polymer solar cells with enhanced fill factors

Smart grid is a combination of traditional power system engineering and information and communication technology. Smart grid provides users with convenient services through real-time data updates. Multi-dimensional data aggregation can be more flexible for statistical analysis of electricity information. However, most of the existing multi-dimensional data aggregation schemes require the participation of a trusted third party and do not support fault tolerance. In this paper, we propose a fault-tolerant data aggregation scheme supporting fine-grained linear operations in smart grid. Firstly, we used the Chinese remainder theorem to encode the user’s multi-dimensional data and the corresponding weights. Secondly, we construct a privacy-preserving data aggregation scheme without a trusted third party, by combining paillier homomorphic encryption scheme and a secure key agreement protocol. Finally, we use the extended Shamir secret sharing scheme to construct a fault-tolerant data aggregation scheme that supports the reuse of shared key shares. Security analysis results show that our scheme satisfies semantic security and user data privacy protection. Experimental results show that compared with the existing multidimensional data aggregation schemes that require a trusted third party, our scheme does not increase additional computation and communication overhead.

https://ieeexplore.ieee.org/ielx7/6287639/6514899/10173481.pdf

Fault-Tolerant Data Aggregation Scheme Supporting Fine-Grained Linear Operation in Smart Grid

With the rapid growth and the popularization of the Internet, network security problems become increasingly serious. This paper analyzes the impact on several malicious codes on registry access behaviour and builds a rough set of algorithms-based registry access intrusion detection systems. Related attributes are constructed considering both the time sequence attribute and one-time access attribute as our input of the training module. Attribute reduction and rules extraction using rough sets algorithms give the registry access to normal behaviour modal. Experiments show that the system differentiates normal and abnormal registry behaviour successfully.

Registry access anomaly detection system based on the rough set algorithm

The stock market plays an important role in national economic development. Predicting its trend, to ensure market stability, efficiency, and safety, is one of the hottest topics of current research. Some algorithms have been proposed to use in this study, however, the drawback in forecasting accuracy and applicability of the model and other issues limit its application in practice. In this paper, we designed a forgotten-genetic network model to predict the stock index. Finally, a comparison between existing algorithms to verify the validity and applicability of the proposed method in this study.

Longfei Liu

Papers

Further observation on proxy re-encryption with keyword search

Naphthalene diimide-based random terpolymer acceptors for constructing all-polymer solar cells with enhanced fill factors

Fault-Tolerant Data Aggregation Scheme Supporting Fine-Grained Linear Operation in Smart Grid

Registry access anomaly detection system based on the rough set algorithm

Research on stock index forecast based on the forgetting-genetic network model