One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Denial of Service in Sensor Networks
Computer
Digital Signatures for Flows and Multicasts
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
The feasibility of launching and detecting jamming attacks in wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On link layer denial of service in data wireless LANs: Research Articles
Wireless Communications & Mobile Computing
Introduction to Coding Theory
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A coding-theoretic approach for efficient message verification over insecure channels
Proceedings of the second ACM conference on Wireless network security
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Modern Communications Jamming Principles and Techniques
Modern Communications Jamming Principles and Techniques
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Jamming sensor networks: attack and defense strategies
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
We address the problem of allowing authorized users, who do not preshare a common key, to effectively exchange key establishment messages over an insecure channel in the presence of jamming and message insertion attacks. In this work, we jointly consider the security and efficiency of key exchange protocols, focusing on the interplay between message fragmentation, jamming resilience, and verification complexity for protocol optimization. Finally, we present three fragment verification schemes and demonstrate through analysis and simulation that in comparison with existing approaches, they can significantly decrease the amount of time required for key establishment without degrading the guaranteed level of security.