EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Modeling vulnerabilities of ad hoc routing protocols
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Visualization of wormholes in sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
A modular correctness proof of IEEE 802.11i and TLS
Proceedings of the 12th ACM conference on Computer and communications security
An RFID Distance Bounding Protocol
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Practical Attacks on Proximity Identification Systems (Short Paper)
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Detecting relay attacks with timing-based protocols
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Slede: a domain-specific verification framework for sensor network security protocol implementations
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Attacks on time-of-flight distance bounding channels
WiSec '08 Proceedings of the first ACM conference on Wireless network security
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
Distance bounding in noisy environments
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Statistical wormhole detection in sensor networks
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Deriving secrecy in key establishment protocols
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
So near and yet so far: distance-bounding attacks in wireless networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Secure neighborhood discovery: a fundamental element for mobile ad hoc networking
IEEE Communications Magazine
Secure positioning in wireless networks
IEEE Journal on Selected Areas in Communications
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Wormhole-resilient secure neighbor discovery in underwater acoustic networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
MSN: mutual secure neighbor verification in multi-hop wireless networks
Security and Communication Networks
CTAC: Control traffic tunneling attacks' countermeasures in mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Computer and System Sciences
Hi-index | 0.00 |
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant compromise of the dependent functionality of wireless systems, numerous works proposed solutions to secure ND. Nonetheless, until very recently, there has been no formal analysis of secure ND protocols. We close this gap in [24], but we concentrate primarily on the derivation of an impossibility result for a class of protocols. In this paper, we focus on reasoning about specific protocols. First, we contribute a number of extensions and refinements on the framework of [24]. As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND with other protocols. Then, we propose and analyze two secure ND protocols: We revisit one of the protocols analyzed in [24], and introduce and prove correct a more elaborate challenge-response protocol.