Hybrid wireless mesh protocol (HWMP), the default routing protocol of IEEE 802.11s, was described. HWMP provided two routing modes: on-demand and proactive. An efficient cooperation method of the two routing modes was...
详细信息
Hybrid wireless mesh protocol (HWMP), the default routing protocol of IEEE 802.11s, was described. HWMP provided two routing modes: on-demand and proactive. An efficient cooperation method of the two routing modes was proposed. It was implemented and its performance was evaluated. The experimental results show that HWMP has lower average latency and higher data transmission throughput compared with ad-hoc on demand distance vector routing (AODV).
The formal definition of broadcast signcryption was proposed, and based on ECDSA, a verifiable broadcast signcryption ECBSC was constructed which could signcrypt and broadcast messagers to multiple recipients. Without...
详细信息
The formal definition of broadcast signcryption was proposed, and based on ECDSA, a verifiable broadcast signcryption ECBSC was constructed which could signcrypt and broadcast messagers to multiple recipients. Without any additional cost, it could also signcrypt multiple messages to multiple recipients. A recipients only obtained relevant messages from the ciphertext. A third party could verify the signcryption text publicly by the method of ECDSA. ECBSC is more efficient than trivial n-recipient scheme which uses SC-BLS repeatedly, and can be used in multicast communication.
To avoid the problem of transferability of verification right, the way to ensure that only those who had designated verifier's private keys could verify the validity of signatures was researched. An ECC-based new ...
详细信息
To avoid the problem of transferability of verification right, the way to ensure that only those who had designated verifier's private keys could verify the validity of signatures was researched. An ECC-based new designated verifier signature scheme was proposed, which could avoid the limitation of delegatability. It was supposed that whether a designated verifier signature possess non-delegatability could be judged by the format of the verifying equation. A general format was also proposed with which the designated verifier signature schemes could avoid the limitation of delegatability. Based on the idea above, a modification of the SKM scheme was made.
The security issues of location discovery were investigated, including challenges, possible security attacks and security requirements. Also, the principles, features and limitations of typical secure positioning meth...
详细信息
The security issues of location discovery were investigated, including challenges, possible security attacks and security requirements. Also, the principles, features and limitations of typical secure positioning methods were discussed and presented, in order to assist researchers to select and design the secure positioning solutions for a particular sensor networks application. Finally, the further directions of research in this area were introduced.
Based on tradeoffs analysis of abnormal behavior and detection methods, a multi-source traffic features analysis and abnormal detection method was proposed. The distribution characteristics of the flow size, IP addres...
详细信息
Based on tradeoffs analysis of abnormal behavior and detection methods, a multi-source traffic features analysis and abnormal detection method was proposed. The distribution characteristics of the flow size, IP addresses and ports were analyzed and found to be efficacious in traffic patterns analysis. The Renyi entropy was employed to fuse the multi-source information captured by different traffic features, and an abnormal behavior detection method was presented. Because of using the multi-source information, the models could detect many kinds of abnormal behaviors, which was an impossible mission for many other traditional abnormal detection methods. The experimental results based on actual network data show that the proposed abnormal detection methods are effective in detecting known and unknown attacks with high-accuracy detection rate and low complexity.
Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting bro...
Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting broadcast nature of wireless networks. OR relies on the global knowledge of networks to select relays and determine priorities. In this paper, we propose a new routing scheme, OxDSR, which combines OR and dynamic source routing (DSR) and performs opportunistic transmissions with the help of the local information and the traditional route obtained by DSR. By taking the duplicates and additional wireless resource consumed by multiple ACK frames into consideration, we propose a new metric, equivalent data rate, to select and prioritize relays. Extensive simulation study shows that the proposed OxDSR is more resilient and achieves higher throughput than DSR based on the expected transmission count routing metric.
Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly ...
详细信息
Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.
A link analysis model for passive UHF RFID system in LOS indoor environment is developed and demonstrated. Using this model, the power received by tag and the read performance are investigated. The multipath fading an...
详细信息
It is well known that the Chinese Remainder Theorem （CRT） can greatly improve the performances of RSA cryptosystem in both running times and memory requirements. However, if the implementation of CRT-based RSA is ca...
详细信息
It is well known that the Chinese Remainder Theorem （CRT） can greatly improve the performances of RSA cryptosystem in both running times and memory requirements. However, if the implementation of CRT-based RSA is careless, an attacker can reveal some secret information by exploiting hardware fault cryptanalysis. In this paper, we present some fault attacks on a type of CRT-RSA algorithms namely BOS type schemes including the original BOS scheme proposed by Blomer, Otto, and Seifert at CCS 2003 and its modified scheme proposed by Liu et al. at DASC 2006. We first demonstrate that if some special signed messages such as m = 0, ±1 are dealt carelessly, they can be exploited by an adversary to completely break the security of both the BOS scheme and Liu et al.＇s scheme. Then we present a new permanent fault attack on the BOS scheme with a success probability about 25%. Lastly, we propose a polynomial time attack on Liu et al.＇s CRT-RSA algorithm, which combines physical fault injection and lattice reduction techniques when the public exponent is short.
Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for...
详细信息
Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.
暂无评论