LZLin Zhang

Lin Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lin Zhang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Quaternary codes and their binary images

    by Yansheng Wu, Chao Li, Lin Zhang, Fu Xiao

    Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are constructed by simplicial complexes. Specifically, the Lee weight distributions of the resulting quaternary codes are determined and two infinite families of four-Lee-weight quaternary codes are obtained. Compared to the databases of $\mathbb Z_4$ codes by Aydin {\em et al.}, at least nine new quaternary codes are found. Thanks to the special structure of the defining sets, we have the ability to determine whether the Gray images of certain obtained quaternary codes are linear or not. This allows us to obtain two infinite families of binary nonlinear codes and one infinite family of binary minimal linear codes. Furthermore, utilizing these minimal binary codes, some secret sharing schemes as a byproduct also are established.

  • Open Access

    GT-Bidding: Group Trust Model of P2P Network Based on Bidding

    by Lin Zhang, Xinyan Wei, Yanwen Huang, Haiping Huang, Xiong Fu, Ruchuan Wang

    Due to the lack of trusted third parties as guarantees in peer-to-peer (P2P) networks, how to ensure trusted transactions between peers has become a research hotspot. However, the open and distributed characteristics of P2P networks have brought challenges to network security, and there are problems such as node fraud and unavailability of services in the network. To solve the problem of how to select trusted transaction peers in P2P groups, a new trust model, GT-Bidding, is proposed in this paper. This model follows the bidding process of human society. First, each service peer applies for a group of guarantee peers and carries out credit mortgages for this service. Second, based on the entropy and TOPSIS method (Technology for Order Preference by Similarity to an Ideal Solution) approaching the ideal solution, a set of ideal trading sequences is selected. Then, the transaction impact function is used to assign weights to the selected guarantee peers and service nodes, respectively; thus, the comprehensive trust of each service node can be calculated. Finally, the service peer is verified using feedback based on the specific confidence level, which encourages the reputation of the service and its guarantee peers to update. Experiments show that GT-Bidding improves the successful transaction rate and resists complex attacks.


  • Open Access

    Trust Evaluation Model Based on PSO and LSTM for Huge Information Environments

    by Zhang Lin, Huang Yanwen, Xuan Jie, Fu Xiong, Lin Qiaomin, Wang Ruchuan

    Due to the challenge of increasing data volume, the traditional trust model is unable to manage data with high efficiency and effectively extract useful information hidden in big data. To fully utilize big data and combine machine learning with trust evaluation, a trust evaluation model based on Long short‐term memory (LSTM) is presented. The powerful learning ability, expressive ability and dynamic timing of LSTM can be applied to study data while avoiding the vanishing and exploding gradient phenomena of traditional Recurrent neural networks (RNNs) to ensure that the model can learn sequences of random length and provide accurate trust evaluation. Targeting the performance instability caused by the LSTM model's random initialization of weights and thresholds, Particle swarm optimization (PSO), one of the intelligent algorithms, is introduced to find global optimal initial weights and thresholds. Experiments proved that the trust model proposed in this paper has high accuracy and contributes a new idea for trust evaluation in big data environments.


  • Open Access

    Privacy Protection of Social Networks Based on Classified Attribute Encryption

    by Lin Zhang, Li Li, Eric Medwedeff, Haiping Huang, Xiong Fu, Ruchuan Wang

    With the rapid development of social networks, privacy has also attracted attention. Based on this problem, a privacy protection scheme for social networks based on classified attribute encryption (PPSSN) is proposed for the data owner and attribute management server to manage user permissions; the approach reduces data owner overhead and also avoids use of a property management server to limit access user collusion attacks. To balance the privacy and security of data publication, this scheme classifies users and designs access control for different users and different privileges. In addition, this paper also introduces a good friend data cache mechanism to improve and optimize the original scheme to reduce the cost of decryption. The efficiency and system overhead of the proposed scheme are compared and analyzed based on experiments. The experiments show that the proposed scheme improves query efficiency, reduces system cost, and enhances privacy security.


  • Open Access

    A Trajectory Privacy Preserving Scheme in the CANNQ Service for IoT

    by Lin Zhang, Chao Jin, Hai-Ping Huang, Xiong Fu, Ru-Chuan Wang

    Nowadays, anyone carrying a mobile device can enjoy the various location-based services provided by the Internet of Things (IoT). ‘Aggregate nearest neighbor query’ is a new type of location-based query which asks the question, ‘what is the best location for a given group of people to gather?’ There are numerous, promising applications for this type of query, but it needs to be done in a secure and private way. Therefore, a trajectory privacy-preserving scheme, based on a trusted anonymous server (TAS) is proposed. Specifically, in the snapshot queries, the TAS generates a group request that satisfies the spatial K-anonymity for the group of users—to prevent the location-based service provider (LSP) from an inference attack—and in continuous queries, the TAS determines whether the group request needs to be resent by detecting whether the users will leave their secure areas, so as to reduce the probability that the LSP reconstructs the users’ real trajectories. Furthermore, an aggregate nearest neighbor query algorithm based on strategy optimization, is adopted, to minimize the overhead of the LSP. The response speed of the results is improved by narrowing the search scope of the points of interest (POIs) and speeding up the prune of the non-nearest neighbors. The security analysis and simulation results demonstrated that our proposed scheme could protect the users’ location and trajectory privacy, and the response speed and communication overhead of the service, were superior to other peer algorithms, both in the snapshot and continuous queries.


  • Open Access

    Energy-Aware VM Initial Placement Strategy Based on BPSO in Cloud Computing

    by Xiong Fu, Qing Zhao, Junchang Wang, Lin Zhang, Lei Qiao

    In recent years, high energy consumption has gradually become a prominent problem in a data center. With the advent of cloud computing, computing and storage resources are bringing greater challenges to energy consumption. Virtual machine (VM) initial placement plays an important role in affecting the size of energy consumption. In this paper, we use binary particle swarm optimization (BPSO) algorithm to design a VM placement strategy for low energy consumption measured by proposed energy efficiency fitness, and this strategy needs multiple iterations and updates for VM placement. Finally, the strategy proposed in this paper is compared with other four strategies through simulation experiments. The results show that our strategy for VM placement has better performance in reducing energy consumption than the other four strategies, and it can use less active hosts than others.


  • Open Access

    A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

    by Lin Zhang, Na Yin, Xiong Fu, Qiaomin Lin, Ruchuan Wang

    With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.


  • Trusted Decision Mechanism Based on Fuzzy Logic for Open Network

    by Lin Zhang, Ruchuan Wang, Haiyan Wang

    Trust mechanism will be an important trend in the field of security for open network. But, as an important factor risk is little considered in trust model. In this paper, Further works are done in trust and risk separately. In course of trust propagation, direct interaction information of the middle recommendation node is presented, which expresses the importance of subjective factor. About risk mechanism, two important factors are considered to improve the corresponding algorithms: length-limit of the risk propagation path and pre-operation process before integrating these paths. With the help of fuzzy logic technology, the trusted decision mechanism is presented which is based on trust and risk. Experimental results and some cases show that the new trusted decision mechanism is reasonable and high-powered.