Titlebook: Security and Privacy in Ad-hoc and Sensor Networks; Second European Work Refik Molva,Gene Tsudik,Dirk Westhoff Conference proceedings 2005

傻瓜

Statistical Wormhole Detection in Sensor Networks,nd they provide probabilistic results. The first mechanism, called the Neighbor Number Test (NNT), detects the increase in the number of the neighbors of the sensors, which is due to the new links created by the wormhole in the network. The second mechanism, called the All Distances Test (ADT), dete

网络添麻烦

Arrhythmia

Climate

RFID Authentication Protocol with Strong Resistance Against Traceability and Denial of Service Attathese protocols suffer from many security threats, especially from the DoS (Denial of Service) attacks. In this paper, we discuss location privacy problem and show vulnerabilities of RFID authentication protocols. And then, we will suggest a strong authentication protocol against location tracing, s

Cumbersome

cluster

An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices,amir method and the Interleave method whereas their speed mainly depends on the (joint) Hamming weight of the scalars. To increase the speed, the scalars are usually deployed using some general representation which provides a lower (joint) Hamming weight than the binary representation. However, by u

灰姑娘

Side Channel Attacks on Message Authentication Codes,s paper we show that side channel attacks can be applied to message authentication codes, even if the countermeasure is applied to the underlying block cipher. In particular, we show that EMAC, OMAC, and PMAC are vulnerable to our attack. Based on simple power analysis, we show that several key bits

Defense

来这真柔软

Side Channel Attacks on Message Authentication Codes, can be extracted, and based on differential power analysis, we present selective forgery against these MACs. Our results suggest that protecting block ciphers against side channel attacks is not sufficient, and countermeasures are needed for MACs as well.

异常

Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks,and protocols, and it provides a rigorous method for proving that a given routing protocol is secure. We demonstrate the approach by representing known and new attacks on SAODV in our framework, and by proving that ARAN is secure in our model.