In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on of power-optimal broadcast, for which it well known that broadcast nature radio transmission can be exploited optimize consumption. Several authors have conjectured NP-complete. provide here formal proof, both general case and geometric one; former case, network topology represented by generic graph with arbitrary weights, whereas latter Euclidean...

We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over wireless radio channel in presence of communication jammer? An inherent challenge solving this problem is known anti-jamming techniques (e.g.,frequency hopping or direct-sequence spread spectrum) which should support device during establishment require spreading (or code) prior to start their communication. This requirement creates circular dependency between...

CSMA/CA protocols rely on the random deferment of packet transmissions. Like most other protocols, was designed with assumption that nodes would play by rules. This can be dangerous, since themselves control their deferment. Indeed, higher programmability network adapters, temptation to tamper software or firmware is likely grow; doing so, a user could obtain much larger share available bandwidth at expense users. We use game-theoretic approach investigate problem selfish behavior in...

We present a set of simple techniques for key establishment over radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellmankey agreement protocol, which known to be vulnerable "man-in-the-middle" attack if two users involved protocol do not share any authenticated information about each other (e.g., public keys, certificates, passwords,shared etc.) prior execution. In this paper, we solve problem by leveraging natural ability authenticate visual and verbal contact....

Until recently, the problem of localization in wireless networks has been mainly studied a nonadversarial setting.Only number solutions have proposed that aim to detect and prevent attacks on systems.In this work, we propose new approach secure based hidden mobile base stations.Our enables with broad spectrum techniques: ultrasonic or radio, received signal strength time flight.Through several examples show how can be used nodecentric infrastructure-centric schemes.We further applied sensor networks.

Channel allocation was extensively studied in the framework of cellular networks. But emergence new system concepts, such as cognitive radio systems, has brought this topic into focus research again. In paper, we study detail problem competitive multi-radio multi-channel wireless We existence Nash equilibria a static game and conclude that, spite non-cooperative behavior devices, their channel results load-balancing solution. addition, consider fairness properties resulting allocations...

Due to their very nature, wireless sensor networks are probably the category of most vulnerable "radio channel jamming"-based denial-of-service (DoS) attacks. An adversary can easily mask events that network should detect by stealthily jamming an appropriate subset nodes; in this way, he prevents them from reporting what they sensing operator. Therefore, even if event is sensed one or several nodes (and otherwise fully connected), operator cannot be informed on time. We show how exploit...

In this work, we propose and analyze a new approach for securing localization location verification in wireless networks based on hidden mobile base stations. Our enables secure with broad spectrum of techniques: ultrasonic or radio, received signal strength time flight. Through several examples show how can be used to node-centric infrastructure-centric schemes. We further applied ad-hoc sensor networks.

Due to their very nature, wireless sensor networks are probably the category of most vulnerable radio channel jamming-based denial-of-service (DoS) attacks. An adversary can easily mask events that network should detect by stealthily jamming an appropriate subset nodes; in this way, he prevents them from reporting what they sensing operator. Therefore, even if event is sensed one or several nodes (and otherwise fully connected), operator cannot be informed on time. We show how exploit...

In this paper, we study the problem of efficient medium access control (MAC) among cognitive radio devices that are equipped with multiple radios and thus capable transmitting simultaneously at different frequencies (channels).We assume contend on each channel using Carrier Sense Multiple Access Collision Avoidance (CSMA/CA) protocol.We two MAC problems: (i) allocation available channels radios, (ii) optimal usage allocated by occupying it.Both problems studied in a game-theoretic setting,...

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors possible (e.g., it is to change a "0" into "1", but not the contrary), we propose integrity (I-codes) for radio communication channel, which enable protection messages exchanged between entities do hold any mutual authentication material (i.e. public keys or shared secret keys). The construction I-codes enables sender encode message such if its violated transmission over receiver...

The last decade has been characterized by a rapid increase in the usage of mobile communications. One main aspects communications is mobility. This means that phones have to switch between base station cells order support uninterrupted all available services within area network coverage. process switching user devices called handover. Accordingly, stations are optimized serve with certain moving velocities based on an and characteristics better handle handovers. However, issues appear when...

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors possible (e.g., it is to change a "0" into "1", but not the contrary), we propose integrity (I-codes) for radio communication channel, which enable protection messages exchanged between entities do hold any mutual authentication material (i.e. public keys or shared secret keys). The construction I-codes enables sender encode message such if its violated transmission over receiver...

We propose SecNav, a new protocol for securing wireless navigation systems. This secures localization and time synchronization in networks by relying on devices' awareness of presence the power-range (coverage area) stations. perform detailed security analysis SecNav show that, compared to existing secure approaches, it prevents widest range attacks navigation. Our implementation using 802.11b devices, shows that this scheme can be efficiently implemented with technologies.

Despite years of intensive research, the main deterrents widely deploying secure communication between wireless nodes remains cumbersome key setup process. In this paper, we address problem and introduce Integrity (I) regions, a novel security primitive that enables message authentication in networks without use preestablished or precertified keys. regions are based on verification entity proximity through time-of-arrival ranging techniques. IRegions can be efficiently implemented with...

HASH(0x3b6160c)

Classical password/PIN-based authentication methods have proven to be vulnerable a broad range of observation attacks (such as key-logging, video-recording or shoulder surfing attacks). In order mitigate these attacks, number solutions been proposed, most them being cognitive schemes (challenge-response protocols that require users perform some kind operations). this paper, we show successful passive side-channel timing on two schemes, well-known Hopper-Blum (HB) protocol and U.S. patent...

Internet of Things (IoT) concept is growing in last few years and number IoT devices increasing rapidly. Individual sensors communicate over network. The LPWAN (Low Power Wide Area Network) networks possess the ability to offer low-cost connection for huge low-power distributed large areas. LoRaWAN a prominent solution this paper existing research work related capacity surveyed, presented discussed.

We introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of pre-established or pre-certified keys. regions are based on verification entity proximity through time-of-arrival ranging techniques. demonstrate how I-regions can be efficiently implemented with ultrasonic ranging, spite fact ultrasound techniques vulnerable to distance enlargement and reduction attacks. further discuss used key establishment...

Classical PIN-entry methods are vulnerable to a broad class of observation attacks (shoulder surfing, key-logging).A number alternative that based on human cognitive skills have been proposed. These can be classified into two classes regarding information available passive adversary: (i) the adversary fully observes entire input and output procedure, (ii) only partially observe and/or output. In this paper we propose novel scheme - Shoulder Surfing Safe Login (SSSL). SSSL is challenge...

This paper reports two attacks on Undercover, a human authentication scheme against passive observers proposed at CHI 2008. The first attack exploits nonuniform behavior in responding to challenges and the second one is based information leaked from or responses visible attacker. can be generalized break alternative Undercover designs presented Pervasive 2009. All exploit design flaws of implementations.