Security association established by authentication schemes enables wireless networks resilient from external attacks. However, an enhanced security guarantee will influence network performance more or less. In this pa...
详细信息
Security association established by authentication schemes enables wireless networks resilient from external attacks. However, an enhanced security guarantee will influence network performance more or less. In this paper, we observe the detailed actions of a security association in the procedure of establishment and shift, in a wireless mesh network (WMN), i.e. a typical multi-hop network. To investigate the behaviors of security association in different environment, several experiments are implemented in our testbed with discriminatory parameters sets, such as routing efficiency, topology diversity and subsequent traffic load. he quantified interactions between security association and network performance are exposed by the comparison of representative parameters. Meanwhile, a guideline is suggested for the design of access schemes which take both security and QoS into account.
Supply chain management is the major field for RFID application. However, little work has been conducted to address the security issues in this context. Existing RFID solutions cannot be applied directly in this field...
详细信息
Supply chain management is the major field for RFID application. However, little work has been conducted to address the security issues in this context. Existing RFID solutions cannot be applied directly in this field because of a set of special RFID security requirements to be addressed for supply chain management. The major contribution of this paper is to identify the unique set of security requirements for secure RFID communications in supply chains, propose a universally composable model that satisfies the security requirements, and design a lightweight protocol that realizes the universally composable model. This paper further defines the security requirement of unlinkability, and classifies the typical RFID protocols according to the security requirements.
In 2000, a new type of multi-secret sharing scheme, called the multiple secret sharing scheme, is proposed by Chien et al., in which more than one secret instead of only one secret can be shared in the same sharing se...
详细信息
ISBN:
(纸本)9780769532585
In 2000, a new type of multi-secret sharing scheme, called the multiple secret sharing scheme, is proposed by Chien et al., in which more than one secret instead of only one secret can be shared in the same sharing session. In 2004, Yang et al. proposed another implementation of the above scheme based on Shamir's secret sharing to reduce the complexity of computation. In 2005, Pang et al. also proposed a more efficient implementation of Yangpsilas scheme. However, all these schemes have no property of verification and cannot authenticate the entity of the participant and the message. Motivated by these concerns, a new verifiable (t, n) multiple secret sharing scheme is proposed, which is based on Pang et alpsilas scheme. And then, some analyses are made on the proposed scheme.
No-wait flowshops with flowtime minimization are typical NP-Complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a ...
详细信息
No-wait flowshops with flowtime minimization are typical NP-Complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in this paper by which the objective of an offspring being obtained just by objective increments and computational time can be considerably reduced. HGAI (Hybrid GA based on objective Increment) is proposed by integrating genetic algorithm with a local search method. A heuristic is constructed to generate an individual of initial population and a crossover operator is introduced for mating process. HGAI is compared with two best so far algorithms for the considered problem on 110 benchmark instances. Computational results show that HGAI outperforms the existing two in effectiveness with a little more computation time.
Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flo...
详细信息
Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flowshop scheduling problems with both the makespan and the total flow time minimization. The proposed algorithm makes use of the principle of non-dominated sorting, coupled with the use of elitist solutions strategy. To improve efficiency, two effective multi-objective local search procedures based on objective increment are applied on each chromosome in the archive. Experimental results show that the proposal outperforms the other three heuristics both on effectiveness and efficiency.
An identity-based broadcast encryption protocol for ad hoc networks is proposed. Whenever a new mobile ad hoc network is formed, the proposed protocol only requires each group member to broadcast his/her identity to c...
详细信息
An identity-based broadcast encryption protocol for ad hoc networks is proposed. Whenever a new mobile ad hoc network is formed, the proposed protocol only requires each group member to broadcast his/her identity to construct the group key, which avoids a large number of message exchanges between group members like group key management protocols proposed previously. Hence it is highly efficient in terms of member removal to construct a new network. In addition, our protocol is also efficient in computation since the encryption and the decryption only require two bilinear pair computations. Furthermore, we show that the new protocol is provably secure under the standard model.
Owing to the difference of soil water in the farm,a system of variable rate irrigation was developed with Visual C++ and MapObjects that can save water as well as can improve economy *** water content can be forecaste...
详细信息
Owing to the difference of soil water in the farm,a system of variable rate irrigation was developed with Visual C++ and MapObjects that can save water as well as can improve economy *** water content can be forecasted by using the forecast model of soil water,according to the real soil water content of different sampling sites in this *** or not can be decided by comparing the current soil content with the light drought and serious drought index of the *** water amount of irrigation can be decided by the analysis of economy benefit according to the model of water consumption-yield,thus the irrigation prescription map can be created..This system can also query the information of fields,manage and analysis the data of *** test was performed in national precision agriculture demo farm.
In this paper, a collusion-resistant matrix system (CRMS) for group key managements is presented. The CRMS is defined as a collection of subsets of users, and the keys held by users in CRMS are organized in a hierarch...
详细信息
In this paper, a collusion-resistant matrix system (CRMS) for group key managements is presented. The CRMS is defined as a collection of subsets of users, and the keys held by users in CRMS are organized in a hierarchical matrix manner. After describing the join and leave protocols, we prove that CRMS has lceil2N/trceil-collusion resistant capability. Moreover, the suggestion of how to select the parameters in CRMS is given. The simulated experiments show that CRMS is a practical group key management in wireless networks.
Sensor networks are resource-constrained, which makes developing efficient key distribution scheme a challenging problem. In general, many key distribution techniques are designed to address the trade-off between limi...
详细信息
ISBN:
(纸本)9781424432127
Sensor networks are resource-constrained, which makes developing efficient key distribution scheme a challenging problem. In general, many key distribution techniques are designed to address the trade-off between limited resources and security, no key distribution technique is ideal to all the scenarios where sensor networks are used. In this paper, we primarily focus on storage requirements of several key distribution schemes in sensor networks, and obtain their lower bounds on the amount of information each user has to keep secret by modeling the key distribution schemes with an information theoretic framework.
Security and privacy of wireless sensor networks are key research issues recently. Most existing researches regarding wireless sensor network security consider homogenous sensor networks. To achieve better security an...
详细信息
Security and privacy of wireless sensor networks are key research issues recently. Most existing researches regarding wireless sensor network security consider homogenous sensor networks. To achieve better security and performance, we adopt a heterogeneous wireless sensor network (HWSN) model that consists of physically different types of sensor nodes. This paper presents a secure message distribution scheme with configurable privacy for HWSNs, which takes advantage of powerful high-end sensor nodes. The scheme establishes a message distribution topology in an efficient and secure manner. The sensor node can only generate one signature for all the messages for all the users, which can greatly save the communication and computation costs of the sensor node. On the other hand, the user can only know the messages intended for him based on a pre-set policy, which can meet the requirement of the privacy. We show that the scheme has small bandwidth requirements and it is resilient against the node compromise attack.
暂无评论