| 1. |
|
|
| 2. |
- Ristanovic, N., et al.
(författare)
-
Adaptive Message Authentication for Vehicular Networks
- 2009
-
Ingår i: Proceedings of the Sixth International Workshop on Vehicular Ad Hoc Networks, VANET 2009.. ; , s. 121-122
-
Konferensbidrag (refereegranskat)abstract
- Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues; especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Message Authentication (AMA), a lightweight filtering scheme that reduces the number of cryptographic operations performed by the nodes. Based only on local observations and with no additional communication channel, our scheme achieves global improvement of network performance. We show through simulation that the scheme successfully adapts the number of cryptographic operations to the locally observed number of adversaries.
|
|
| 3. |
- Flury, M., et al.
(författare)
-
Effectiveness of distance-decreasing attacks against impulse radio ranging
- 2010
-
Ingår i: Proceedings of the Third ACM Conference on Wireless Network Security (WiSec). - : ASSOC COMPUTING MACHINERY. - 9781605589237 ; , s. 117-128
-
Konferensbidrag (refereegranskat)abstract
- We expose the vulnerability of an emerging wireless ranging technology, impulse radio ultra-wide band (IR-UWB), to distance-decreasing attacks on the physical communication layer (PITY). These attacks violate the security of secure ranging protocols that allow two wireless devices to securely estimate the distance between them, with the guarantee that the estimate is an upper-bound on the actual distance. Such protocols serve as crucial building blocks in security-sensitive applications such as location tracking, physical access control, or localization.Prior works show the theoretical possibility of PHY attacks bypassing cryptographic mechanisms used by secure ranging protocols. They also demonstrates that for physical layers used in ISO 14443 RFID and wireless sensor networks, some PHY attacks are indeed feasible. IR-UWB was proposed as a possible solution, but we show that the de facto standard for IR-UWB, IEEE 802.15.4a, does not automatically provide security against such attacks. We find that with the mandatory modes of the standard an external attacker can decrease the measured distance by as much as 140 meters with a high probability (above 99%).
|
|
| 4. |
- Freudiger, J., et al.
(författare)
-
Mix-zones for Location Privacy in Vehicular Networks
- 2007
-
Ingår i: Proceedings of the First International Workshop on Wireless Networking for Intelligent Transportation Systems (Win-ITS).
-
Konferensbidrag (refereegranskat)abstract
- Vehicular Networks (VNs) seek to provide, among other applications, safer driving conditions. To do so, vehicles need to periodically broadcast safety messages providing preciseposition information to nearby vehicles. However, this frequentmessaging (e.g., every 100 to 300ms per car) greatly facilitates the tracking of vehicles, as it suffices to eavesdrop the wireless medium. As a result, the drivers privacy is atstake. In order to mitigate this threat, while complying with the safety requirements of VNs, we suggest the creation ofmix-zones at appropriate places of the VN. We propose to do so with the use of cryptography, and study analytically how the combination of mix-zones into mix-networks brings forth location privacy in VNs. Finally, we show by simulations that the proposed mix system is effective in various scenarios.
|
|
| 5. |
- Haghani, P., et al.
(författare)
-
Efficient and Robust Secure Aggregation for Sensor Networks
- 2007
-
Ingår i: Proceedings of the Third IEEE ICNP Workshop on Secure Network Protocols (NPSec). ; , s. 1-6
-
Konferensbidrag (refereegranskat)abstract
- Wireless Sensor Networks (WSNs) rely on in networkaggregation for efficiency, however, this comes at aprice: A single adversary can severely influence the outcomeby contributing an arbitrary partial aggregate value. Securein-network aggregation can detect such manipulation [2]. Butas long as such faults persist, no aggregation result can beobtained. In contrast, the collection of individual sensor nodevalues is robust and solves the problem of availability, yet in an inefficient way. Our work seeks to bridge this gap in secure data collection: We propose a system that enhances availability with an efficiency close to that of in-network aggregation. To achieve this, our scheme relies on costly operations to localize and exclude nodes that manipulate the aggregation, but only when a failure is detected. The detection of aggregation disruptions and the removal of faulty nodes provides robustness. At the same time, after removing faulty nodes, the WSN can enjoy low cost (secure) aggregation. Thus, the high exclusion cost is amortized, and efficiency increases.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
- Papadimitratos, Panagiotis, et al.
(författare)
-
Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks
- 2010
-
Ingår i: IEEE Journal on Selected Areas in Communications. - : IEEE. - 0733-8716 .- 1558-0008. ; 28:7, s. 1036-1045
-
Tidskriftsartikel (refereegranskat)abstract
- Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, called parasitic adversary, who seeks to exploit sensor networks by obtaining measurements in an unauthorized way. As a countermeasure, we first employ a randomized key refreshing: with low communication cost, it aims at confining (but not eliminating) the effects of the adversary. Moreover, our low-complexity solution, GossiCrypt, leverages on the large scale of sensor networks to protect data confidentiality, efficiently and effectively. GossiCrypt applies symmetric key encryption to data at their source nodes; and it applies re-encryption at a randomly chosen subset of nodes en route to the sink. The combination of randomized key refreshing and GossiCrypt protects data confidentiality with a probability of almost 1; we show this analytically and with simulations. In addition, the energy consumption of GossiCrypt is lower than a public-key based solution by several orders of magnitude.
|
|
