The Experts below are selected from a list of 126 Experts worldwide ranked by ideXlab platform
Tongtong Li - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Malicious Link Detection in Multi-Hop Wireless Sensor Networks
2019 IEEE Global Communications Conference (GLOBECOM), 2019Co-Authors: Yuan Liang, Tongtong LiAbstract:This paper considers Malicious Link detection in multi-hop wireless sensor networks (WSNs). Existing work on Malicious Link detection generally requires that the detection process being performed at the intermediate nodes, leading to considerable overhead in system design, as well as unstable detection accuracy due to limited resources and the uncertainty in the loyalty of the intermediate nodes themselves. In this paper, we propose an efficient and robust Malicious Link detection scheme by exploiting the statistics of packet delivery rates only at the base station. More specifically, first, we present a secure packet transmission protocol to ensure that except the base station, any intermediate nodes on the route cannot access the contents and routing paths of the packets. Second, we design a Malicious Link detection algorithm that can effectively detect the irregular dropout at every hop (or Link) along the routing path. We prove that the proposed algorithm has guaranteed false alarm rate and low miss detection rate. Simulation results are provided to validate the proposed approaches.
-
Malicious Link Detection in Multi-Hop Wireless Sensor Networks
2019 IEEE Global Communications Conference (GLOBECOM), 2019Co-Authors: Yuan Liang, Tongtong LiAbstract:This paper considers Malicious Link detection in multi-hop wireless sensor networks (WSNs). Existing work on Malicious Link detection generally requires that the detection process being performed at the intermediate nodes, leading to considerable overhead in system design, as well as unstable detection accuracy due to limited resources and the uncertainty in the loyalty of the intermediate nodes themselves. In this paper, we propose an efficient and robust Malicious Link detection scheme by exploiting the statistics of packet delivery rates only at the base station. More specifically, first, we present a secure packet transmission protocol to ensure that except the base station, any intermediate nodes on the route cannot access the contents and routing paths of the packets. Second, we design a Malicious Link detection algorithm that can effectively detect the irregular dropout at every hop (or Link) along the routing path. We prove that the proposed algorithm has guaranteed false alarm rate and low miss detection rate. Simulation results are provided to validate the proposed approaches.
Yuan Liang - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Malicious Link Detection in Multi-Hop Wireless Sensor Networks
2019 IEEE Global Communications Conference (GLOBECOM), 2019Co-Authors: Yuan Liang, Tongtong LiAbstract:This paper considers Malicious Link detection in multi-hop wireless sensor networks (WSNs). Existing work on Malicious Link detection generally requires that the detection process being performed at the intermediate nodes, leading to considerable overhead in system design, as well as unstable detection accuracy due to limited resources and the uncertainty in the loyalty of the intermediate nodes themselves. In this paper, we propose an efficient and robust Malicious Link detection scheme by exploiting the statistics of packet delivery rates only at the base station. More specifically, first, we present a secure packet transmission protocol to ensure that except the base station, any intermediate nodes on the route cannot access the contents and routing paths of the packets. Second, we design a Malicious Link detection algorithm that can effectively detect the irregular dropout at every hop (or Link) along the routing path. We prove that the proposed algorithm has guaranteed false alarm rate and low miss detection rate. Simulation results are provided to validate the proposed approaches.
-
Malicious Link Detection in Multi-Hop Wireless Sensor Networks
2019 IEEE Global Communications Conference (GLOBECOM), 2019Co-Authors: Yuan Liang, Tongtong LiAbstract:This paper considers Malicious Link detection in multi-hop wireless sensor networks (WSNs). Existing work on Malicious Link detection generally requires that the detection process being performed at the intermediate nodes, leading to considerable overhead in system design, as well as unstable detection accuracy due to limited resources and the uncertainty in the loyalty of the intermediate nodes themselves. In this paper, we propose an efficient and robust Malicious Link detection scheme by exploiting the statistics of packet delivery rates only at the base station. More specifically, first, we present a secure packet transmission protocol to ensure that except the base station, any intermediate nodes on the route cannot access the contents and routing paths of the packets. Second, we design a Malicious Link detection algorithm that can effectively detect the irregular dropout at every hop (or Link) along the routing path. We prove that the proposed algorithm has guaranteed false alarm rate and low miss detection rate. Simulation results are provided to validate the proposed approaches.
Bo Yuan - One of the best experts on this subject based on the ideXlab platform.
-
A social approach to security: Using social networks to help detect Malicious web content
2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering, 2010Co-Authors: Michael Robertson, Bo YuanAbstract:In the midst of a social networking revolution, social media has become the new vehicle for effective business marketing and transactions. As social aspects to the Internet continue to expand in both quantity and scope, so has the security threat towards enterprise networks and systems. Many social networking users also become main targets of spams, phishing, stalking, and other malware attacks that exploit the trust among social network “friends”. This paper presents a comprehensive method combining traditional security heuristics with social networking data to aid in the detection of Malicious web content as it propagates through the user's network. A Facebook application is implemented to automatically evaluate and detect Malicious Link content. The results of testing this application against known phishing and malware sites with real-world user profiles have shown encouraging results.
Michael Robertson - One of the best experts on this subject based on the ideXlab platform.
-
A social approach to security: Using social networks to help detect Malicious web content
2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering, 2010Co-Authors: Michael Robertson, Bo YuanAbstract:In the midst of a social networking revolution, social media has become the new vehicle for effective business marketing and transactions. As social aspects to the Internet continue to expand in both quantity and scope, so has the security threat towards enterprise networks and systems. Many social networking users also become main targets of spams, phishing, stalking, and other malware attacks that exploit the trust among social network “friends”. This paper presents a comprehensive method combining traditional security heuristics with social networking data to aid in the detection of Malicious web content as it propagates through the user's network. A Facebook application is implemented to automatically evaluate and detect Malicious Link content. The results of testing this application against known phishing and malware sites with real-world user profiles have shown encouraging results.
Baruch Awerbuch - One of the best experts on this subject based on the ideXlab platform.
-
ODSBR: An On-Demand Secure Byzantine Routing Protocol
2020Co-Authors: Baruch Awerbuch, David Holmer, Cristina Nita-rotaru, Reza Curtmola, Herbert RubensAbstract:A common technique used by routing protocols for ad hoc wireless networks is to establish the routing paths on-demand, as opposed to continually maintaining a complete routing table. Since in an ad hoc network nodes not in direct range communicate via intermediate nodes, a significant concern is the ability to route in the presence of Byzantine failures which include nodes that drop, fabricate, modify, or mis-route packets in an attempt to disrupt the routing service. We propose the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine failures caused by individual or colluding nodes. The protocol relies on an adaptive probing technique that detects a Malicious Link after log n faults have occurred, where n is the length of the path. Problematic Links are avoided by using a weight-based mechanism that multiplicatively increases their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination. Our protocol bounds the amount of damage that an attacker or a group of colluding attackers can cause to the network. C.2.0 General: Security and protection. C.2.1 Network Architecture and Design: Wireless communication C.2.2 Network Protocols:Routing protocols Terms: Algorithms, Design, Reliability, Security, Theory ∗Department of Computer Science, Johns Hopkins University, 3400 North Charles St. Baltimore, MD 21218 USA. E-mail: {baruch, crix, dholmer, herb}@cs.jhu.edu . †Department of Computer Science, Purdue University, 250 N. University Street, West Lafayette, IN 47907. E-mail: crisn@cs.purdue.edu .
-
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks
ACM Transactions on Information and System Security, 2020Co-Authors: Baruch Awerbuch, David Holmer, Cristina Nita-rotaru, Reza Curtmola, Herbert RubensAbstract:Ah hoc networks offer increased coverage by using multihop communication. This architecture makes services more vulnerable to internal attacks coming from compromised nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. In this work, we examine the impact of several Byzantine attacks performed by individual or colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine attacks caused by individual or colluding nodes. The protocol uses an adaptive probing technique that detects a Malicious Link after log n faults have occurred, where n is the length of the path. Problematic Links are avoided by using a route discovery mechanism that relies on a new metric that captures adversarial behavior. Our protocol never partitions the network and bounds the amount of damage caused by attackers. We demonstrate through simulations ODSBR's effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary's effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.
-
Byzantine survivable routing for mobile ad hoc networks
2020Co-Authors: Baruch Awerbuch, David HolmerAbstract:A mobile ad hoc network (MANET) is an autonomous self-organizing system of mobile nodes connected by wireless Links. A MANET routing protocol enables reliable communication from a source node to an intended destination node by utilizing intermediate forwarding nodes. Security is critical in these networks due to the accessibility of the openly shared wireless medium, the inherent cooperative nature of ad hoc network protocols, and physical vulnerability of mobile devices. The strongest possible attacks are referred to as Byzantine, or insider attacks, where adversaries have full control of a number of authenticated nodes and behave arbitrarily in an attempt to disrupt the network. This dissertation presents two survivable protocols that are capable of providing routing service even in the midst of Byzantine attacks. The On-Demand Secure Byzantine Routing (ODSBR) protocol provides protection against a finite number of Byzantine adversaries. It is patterned off of a classic on-demand wireless routing protocol but provides additional security guarantees. It utilizes an adaptive probing technique that detects a Malicious Link in at most log n faults, where n is the length of the path. Problematic Links are avoided by using a weight-based mechanism that multiplicatively increases their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination. ODSBR bounds the amount of damage that an attacker or a group of colluding attackers can cause to the network. In addition to the finite number of Byzantine adversaries handled by ODSBR, this work also presents techniques for throughput-competitive route selection against the ultimate adaptive Byzantine adversary. More specifically, in this model, the adversary benefits from complete collusion of any number of network nodes, has full knowledge of our protocol and deterministic state, and may engage in arbitrary Byzantine behavior which dynamically changes with each new packet. Under this extreme adversarial model, it is not possible to guarantee routing survivability because it allows the adversary to compromise every node at all times. However, the protocol presented has been shown to be competitive with the off-line optimal route selection and makes the best of a hostile environment.
-
Workshop on Wireless Security - An on-demand secure routing protocol resilient to byzantine failures
Proceedings of the ACM workshop on Wireless security - WiSE '02, 2002Co-Authors: Baruch Awerbuch, David Holmer, Cristina Nita-rotaru, Herbert RubensAbstract:An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless Links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continually maintaining acomplete routing table. A significant concern in routing is theability to function in the presence of byzantine failures whichinclude nodes that drop, modify, or mis-route packets in an attempt todisrupt the routing service.We propose an on-demand routing protocol for ad hoc wireless networks that provides resilience to byzantine failures caused by individual or colluding nodes. Our adaptive probing technique detects a Malicious Link after log n faults have occurred, where n is the length of the path. These Links are then avoided by multiplicatively increasing their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination.
