Yongjun Ren

Mutual Verifiable Provable Data Auditing in Public Cloud Storage

Cloud storage is now a hot research topic in information technology. In cloud storage, date security properties such as data confidentiality, integrity and availability become more and more important in many commercial applications. Recently, many provable data possession (PDP) schemes are proposed to protect data integrity. In some cases, it has to delegate the remote data possession checking task to some proxy. However, these PDP schemes are not secure since the proxy stores some state information in cloud storage servers. Hence, in this paper, we propose an efficient mutual verifiable provable data possession scheme, which utilizes Diffie-Hellman shared key to construct the homomorphic authenticator. In particular, the verifier in our scheme is stateless and independent of the cloud storage service. It is worth noting that the presented scheme is very efficient compared with the previous PDP schemes, since the bilinear operation is not required.

Evidential Quality Preserving of Electronic Record in Cloud Storage

Cloud storage is now a hot research topic in information technology, which has changed the technical architecture and implementation method of electronic records management. However, due to loss of physical control of the electronic record in cloud storage environment, it is more difficult to guarantee the evidential quality for manager. In this paper, we analyzes the requirements of evidential quality preserving for electronic record in cloud storage based on information security theory. Moreover we construct the first technology framework of the evidential quality preserving for electronic record in cloud storage. In addition, the integration method to insure the authenticity, integrity, and reliability of electronic records, which is an serious technical challenge, in cloud storage is studied. Finally, we present the first evidential quality preserving shcheme of electronic record based on Diffie-Hellman key agreement and provable data possession.

A Secure Identity-Based Dynamic Group Data Sharing Scheme for Cloud Computing

Cloud computing is a newfound service which has a rapid growth in IT industry in recent years. With the development of social network, the group data sharing system has been developed to store and process the large amounts of data. Due to the cloud service is provided by the third party, the cloud server is semi-trusted. In this paper, we propose a secure identity-based dynamic group data sharing scheme for cloud computing, which is based on a transplanted group signature algorithm to perform the identity authorization and authentication. In order to make the group members share data efficiently, we utilize a multi-owner searchable encryption mechanism to realize the group data sharing. The security analysis shows that our proposed scheme can resist many possible attacks. In addition, the performance analysis shows that this scheme can be implemented with low computational cost.

A hierarchical clustering based method to evaluate reuse of rare earth tailings under cloud computing environment

Because of their unique electronic, magnetic and optical features, the rare earth has become an important strategic resource. Moreover, improving the exploitation of rare earth resources is very significant. To our knowledge, for the first time the hierarchical clustering technology under Map Reduce environment is utilized to process the experiment data of the tailings of rare earth ion in this paper. According to analyze of the experiment data, the leaching trend of rare earth ions in tailings under optimum conditions is researched. Finally, the data analysis shows that when the volume of sampling location is 400xa0ml, it can not only increase the concentration of rare earth ions in the leaching solution to ensure the economy and maneuverability of subsequent rare earth enrichment, but also insure the leaching rate of rare earth in the tailings and improve the utilization ratio of rare earth resources.

A RFID Based Localization Algorithm for Wireless Sensor Networks

The localization technology takes an important role in real-time alarm and rapid response. In this paper, we propose a novel localization method for wireless sensor network which is based on Radio Frequency Identification technology (RBLOCA). This method combines above both techniques and achieves the localization in WSN. The method not only has the advantages of real-time monitoring and low cost of WSN, but also has the characteristics of fast and repeatable use of RFID technology. Experimental results show that the proposed method can achieve a higher positioning accuracy. At the same time, the energy consumption of nodes is also very low. Therefore, we can get the method has a wide range of applications in a number of scenarios such as the forest fire alarm system, underwater sensor network.

Performance Comparison of Typical and Improved LEACH Protocols in Wireless Sensor Network

Wireless sensor network (WSN) is a collection of mobile or fixed sensor nodes, where sensor nodes can communicate with each other or the base station (BS) to transmit the necessary information for different applications. The energy of the nodes is constrained and non-replaceable, which leads to design energy efficient protocols to extend the lifetime of WSN, such as the well-known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol and the improved LEACH protocols. In this paper, LEACH, LEACH-C, TEEN and DEEC are simulated and compared to figure out the suitable application environment for them. Simulation is divided into two parts. The first part of simulation focuses on the discussion of the best percentage of nodes selected to be the cluster-heads. In addition, the location of BS inside or outside of the network has significant influence on the performances of different protocols. The second part of the simulation shows the performances of the number of sensors still alive, number of data signals received by BS and total energy dissipation in four different protocols.

Preservation Mechanism of Electronic Record Based on Erasure Code and Multi Copies in Cloud Storage

With the rapid growth of cloud storage center, the cumulative volume of data reaches EB and even ZB from PB. As a result, both network size and the number of storage nodes continue to grow explosively, while the data failure rate is still increasing. Cloud storage centers encode the raw data into erasure codes, to save the system overhead as much as possible meanwhile guarantee the reliability of data. However, the state-of-art erasure codes techniques still rely on a conventional centralized model which results in unaffordable encoding/decoding cost, and thus cannot adapt to the data-intensive processing requirements for distributed cloud storage environments. In the paper, the preservation mechanism of combining erasure code and copy backup is proposed, to improve the reliability of electronic records in cloud storage. This paper focuses on the erasure code archiving of electronic documents and puts forward the ability aware erasure code filing of electronic documents. Moreover, the corresponding implementation algorithm and steps are described.