An analysis of short-term fairness in wireless media access protocols (poster session)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance evaluation of a fair backoff algorithm for IEEE 802.11 DFWMAC
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
S-ARP: a Secure Address Resolution Protocol
ACSAC '03 Proceedings of the 19th Annual Computer Security Applications Conference
IEEE 802.11 rate adaptation: a practical approach
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Modeling the short-term unfairness of IEEE 802.11 in presence of hidden terminals
Performance Evaluation
Computational Puzzles as Sybil Defenses
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Understanding Linux Network Internals
Understanding Linux Network Internals
Portcullis: protecting connection setup from denial-of-capability attacks
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
TARP: Ticket-based address resolution protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Malicious JavaScript Insertion through ARP Poisoning Attacks
IEEE Security and Privacy
Enhanced ARP: preventing ARP poisoning-based man-in-the-middle attacks
IEEE Communications Letters
Network Security Technologies and Solutions
Network Security Technologies and Solutions
An efficient solution to the ARP cache poisoning problem
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
MAC Access Delay of IEEE 802.11 DCF
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In this paper, we propose a new mechanism for counteracting ARP (Address Resolution Protocol) poisoning-based Man-in-the-Middle (MITM) attacks in a subnet, where wired and wireless nodes can coexist. The key idea is that even a new node can be protected from an ARP cache poisoning attack if the mapping between an IP and the corresponding MAC addresses is resolved through fair voting among neighbor nodes under the condition that the number of good nodes is larger than that of malicious nodes. Providing fairness in voting among the nodes that are heterogeneous in terms of the processing capability and access medium is quite a challenge. We attempt to achieve fairness in voting using the uniform transmission capability of Ethernet LAN cards and smaller medium access delays of Ethernet than for wireless LAN. Although there is another scheme that resolves the same issue based on voting, i.e. MR-ARP, the voting fairness is improved further by filtering the voting reply messages from the too-early responding nodes, and the voting-related key parameters are determined analytically considering the fairness in voting. This paper shows that fairness in voting can be achieved using the proposed approach, overcoming the limitations of other voting-based schemes, and ARP poisoning-based MITM attacks can be mitigated in a more generalized environment through experiments.