Dengzhi Liu

A secure cloud-assisted urban data sharing framework for ubiquitous-cities

Abstract With the accelerated process of urbanization, more and more people tend to live in cities. In order to deal with the big data that are generated by citizens and public city departments, new information and communication technologies are utilized to process the urban data, which makes it more easier to manage. Cloud computing is a novel computation technology. After cloud computing was commercialized, there have been lot of cloud-based applications. Since the cloud service is provided by the third party, the cloud is semi-trusted. Due to the features of cloud computing, there are many security issues in cloud computing. Attribute-based encryption (ABE) is a promising cryptography technique which can be used in the cloud to solve many security issues. In this paper, we propose a framework for urban data sharing by exploiting the attribute-based cryptography. In order to fit the real world ubiquitous-cities utilization, we extend our scheme to support dynamic operations. In particular, from the part of performance analysis, it can be concluded that our scheme is secure and can resist possible attacks. Moreover, experimental results and comparisons show that our scheme is more efficient in terms of computation.

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.

Secure Authentication in Cloud Big Data with Hierarchical Attribute Authorization Structure

With the fast growing demands for the big data, we need to manage and store the big data in the cloud. Since the cloud is not fully trusted and it can be accessed by any users, the data in the cloud may face threats. In this paper, we propose a secure authentication protocol for cloud big data with a hierarchical attribute authorization structure. Our proposed protocol resorts to the tree-based signature to significantly improve the security of attribute authorization. To satisfy the big data requirements, we extend the proposed authentication protocol to support multiple levels in the hierarchical attribute authorization structure. Security analysis shows that our protocol can resist the forgery attack and replay attack. In addition, our protocol can preserve the entities privacy. Comparing with the previous studies, we can show that our protocol has lower computational and communication overhead.

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.

Secure Verifiable Database Supporting Efficient Dynamic Operations in Cloud Computing

Storage is one of the main services that the cloud provides users. Utilizing the cloud to store large amounts of data can alleviate the cost of storage and the hardware investment on the local side, which is very important for resource-restricted clients. An emerging issue for clients is how to verify the database in the could after outsourcing their data to the cloud. Many verifiable database (VDB) schemes have been proposed by researchers that can solve this issue. However, some of the existing schemes cannot satisfy the practical requirements of database verifiability. In this paper, we propose a secure verifiable database scheme that is based on the polynomial commitment for cloud computing, which can realize the verifiability of database records in the cloud. Moreover, the proposed scheme can support public verifiability in that all clients in the system can verify the database. In addition, we use the BLS signature and the index-hash table to construct dynamic operations for the database. Security analysis shows that our scheme can achieve real-world security requirements. The simulation results show that our scheme is more efficient than similar schemes.

Trustworthiness Evaluation-based Routing Protocol for Incompletely Predictable Vehicular Ad hoc Networks

Incompletely predictable vehicular ad hoc networks is a type of networks where vehicles move in a certain range or just in a particular tendency, which is very similar to some circumstances in reality. However, how to route in such type of networks more efficiently according to the node motion characteristics and related historical big data is still an open issue. In this paper, we propose a novel routing protocol named trustworthiness evaluation-based routing protocol (TERP). In our protocol, trustworthiness of each individual is calculated by the cloud depending on the attribute parameters uploaded by the corresponding vehicle. In addition, according to the trustworthiness provided by the cloud, vehicles in the network choose reliable forward nodes and complete the entire route. The analysis shows that our protocol can effectively improve the fairness of the trustworthiness judgement. In the simulation, our protocol has a good performance in terms of the packet delivery ratio, normalized routing overhead and average end-to-end delay.

S-SurF: An Enhanced Secure Bulk Data Dissemination in Wireless Sensor Networks

Wireless sensor networks (WSNs) have recently gained a lot of attentions as a hot topic of research, with extensive applications being explored. In WSNs, bulk data dissemination protocols are responsible for reprogramming, which have been proposed for efficiency and security. However, few of them can simultaneously achieve both reliability and security. To address this problem, we propose an enhanced protocol entitled Secure Survival of the Fittest (S-SurF) based on SurF [6] in this paper. The proposed protocol is composed of four main phases: packet preprocessing, flooding, negotiation and data verification. Moreover, S-SurF incorporates a time-reliability model to predict the minimum completion time and hence seizes the most opportune moment to transit between flooding and negotiation schemes. In addition, extensive analysis proves the efficiency and security of S-SurF.

Localization Technology in Wireless Sensor Networks Using RSSI and LQI: A Survey

For Wireless Sensor Networks (WSN), low-cost precise localization is the most essential requirement. Localization techniques based on RSSI is cost effective when be in comparison with TDOA, TOA and AOA. Because it doesn’t need any extra power, hardware or bandwidth. In this paper, we simply introduce some related theory and techniques, such as TDOA, TOA and AOA in Wireless Sensor Networks. Localization error can be declined by observing both RSSI and LQI at the same time. We survey a dynamic distance estimation method based on RSSI and LQI, and present a comparison of some algorithms based on the theory. By analyzing the model of radio wave propagation loss and empirical data from real measurement, the method is to use discrete linear lines to approximate the real attenuation of RSSI and LQI.

Enhanced Remote Password-Authenticated Key Agreement Based on Smart Card Supporting Password Changing

Cryptographic scheme is the safeguard for achieving secure communication in networks and distributed systems. Smart card-based password authentication has become a common authentication method to enhance the security of a system. So far, many schemes about smart card-based password authentication have been proposed for preventing various kinds of attacks. In this paper, we first analyze Sun et al.’s scheme and find out that it may be vulnerable to malicious server attack, password guessing attack, user impersonation attack. And then, we propose an enhanced remote password-authenticated key agreement scheme based on smart card to thwart the above security threats. Through the security analysis and performance comparison, our enhanced scheme is proved to be secure and efficient.

A Novel Clustering Solution for Wireless Sensor Networks

Wireless Sensor Network (WSN) deploys a large amount number of nodes into its monitored range, where watchers can monitor the real-time environment parameter by compressing packets transferred by the cluster head nodes from local regions. In WSN, the resource of energy is restricted. Energy efficient clustering solutions are required to keep a long lifetime and enough data packets by extending the run time of CHs. In this paper, we propose a novel clustering solution to improve the selection and rotation of CHs. The presented solution includes two key parts: a new cluster selection based on the distance to the energy-centroid of the cluster and a new cluster rotation solution based on the residual energy level of the node in order to evenly distribute the energy load among all sensors nodes. In particular, the distance between the node and the energy-centroid in EEC when it comes to the rotation of the cluster head node. Our simulation is based on the platform NS-2. The simulate part presents the performance comparison among EEC and the conventional protocols such as LEACH and LEACH-C in terms of energy efficient, the network lifetime and data packets received by the BS. It is worth noting that EEC outperforms the existing protocols from our simulation results.