Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Towards a theory for securing time synchronization in wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Effectiveness of distance-decreasing attacks against impulse radio ranging
Proceedings of the third ACM conference on Wireless network security
Wormhole-resilient secure neighbor discovery in underwater acoustic networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A randomized countermeasure against parasitic adversaries in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Design of a secure distance-bounding channel for RFID
Journal of Network and Computer Applications
Formal Reasoning about Physical Properties of Security Protocols
ACM Transactions on Information and System Security (TISSEC)
A note on a privacy-preserving distance-bounding protocol
ICICS'11 Proceedings of the 13th international conference on Information and communications security
MSN: mutual secure neighbor verification in multi-hop wireless networks
Security and Communication Networks
Secure Neighborhood Creation in Wireless Ad Hoc Networks using Hop Count Discrepancies
Mobile Networks and Applications
CTAC: Control traffic tunneling attacks' countermeasures in mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SecureArray: improving wifi security with fine-grained physical-layer information
Proceedings of the 19th annual international conference on Mobile computing & networking
Journal of Computer and System Sciences
Hi-index | 0.25 |
Pervasive computing systems will likely be deployed in the near future, with the proliferation of wireless devices and the emergence of ad hoc networking as key enablers. Coping with mobility and the volatility of wireless communications in such systems is critical. Neighborhood discovery (ND) - the discovery of devices directly reachable for communication or in physical proximity - becomes a fundamental requirement and building block for various applications. However, the very nature of wireless mobile networks makes it easy to abuse ND and thereby compromise the overlying protocols and applications. Thus, providing methods to mitigate this vulnerability and secure ND is crucial. In this article we focus on this problem and provide definitions of neighborhood types and ND protocol properties, as well as a broad classification of attacks. Our ND literature survey reveals that securing ND is indeed a difficult and largely open problem. Moreover, given the severity of the problem, we advocate the need to formally model neighborhoods and analyze ND schemes.