This report is based upon work from COST Action (ENJECT TD1405), supported by COST (European Coop... more This report is based upon work from COST Action (ENJECT TD1405), supported by COST (European Cooperation in Science and Technology).
– With the eruption of communication technology and its supportive protocols, the field of testin... more – With the eruption of communication technology and its supportive protocols, the field of testing of timed-IUT (Implementation Under Test with time constraints) was quick to follow. New and extended test generation methods using timed automata were in the need. Many papers were written on a broad range of timed automata testing. Few papers, however, dealt with generation of state identification sequences problems. Those who did, keyed their algorithms towards transformation of a timed-IUT into a regular, untimed IUT; thus, avoiding the need of redefining well known generation algorithms. This method, however, only functions if we search for optimal sequences w.r.t. their lengths. Optimality w.r.t. execution time was not considered in this context. In this paper we present a search algorithm for the direct generation of timed homing sequences optimal w.r.t. to execution time. This is accomplished by expanding and modifying the search tree used in previous algorithms such that it con...
REMOTE AGENT FOR CONFORMANCE TESTING OF TIMED-AUTOMATA Ariel Stulman1 , Simon Bloch1,2 , HG Mende... more REMOTE AGENT FOR CONFORMANCE TESTING OF TIMED-AUTOMATA Ariel Stulman1 , Simon Bloch1,2 , HG Mendelbaum2,3 1Univ. Reims, CReSTIC (LICA), Reims, France 2 Jerusalem College of Technology - POB 16031 Jerusalem, Israel 91160 3 Univ. ...
Testing of a new communication protocol was always a basic requirement for its acceptance and imp... more Testing of a new communication protocol was always a basic requirement for its acceptance and implementation. The use of automata for the modeling of protocols allows for usage of pre-developed testing algorithms for this basic data structure. With timing being a major factor in many communication protocols, automata theory was quick to evolve to accommodate for this edition. New and extended test generation methods using timed automata were developed. Within the context of state identification, most methods, however, keyed their algorithms towards transformation of a timed automaton into a regular, un-timed one; thus, avoiding the need of redefining well known test generation algorithms. In this paper we wish to demonstrate that as far as the well known distinguishing sequence problem (state verification), it is preferable to adapt the standard algorithm to meet the special needs of a timed automaton, sidestepping a costly transformation. We propose a new method of generating a timed-distinguishing sequence, which allows direct testing of a timed IUT (Implementation Under Test) modeled by a timed automaton. An example is used to show the semantics of the algorithm.
2020 8th International Conference on Wireless Networks and Mobile Communications (WINCOM), 2020
Simulation based network protocol testing requires that one model reality correctly. Mis-modellin... more Simulation based network protocol testing requires that one model reality correctly. Mis-modelling can render results invalid. Hence, one must determine the context in which a solution is to be implemented for the results to be meaningful. In this work, we investigate whether the security augmentation technique DCFM (denial contradictions with fictitious nodes) for OLSR based mobile ad-hoc networks (MANET) is valid for multiple contexts. We accomplish this by running the node isolation attack and DCFM defense on a variety of mobility models, comparing the results. We show that for most models the technique performs well, while for a specific scenario (e.g. street based) it fails. Additionally we describe the infrastructure that was built to support the street based simulations.
Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017
One of the many aspects of website security is the question of authorization breach. It is an att... more One of the many aspects of website security is the question of authorization breach. It is an attack in which un-authorized entities are allowed access to restricted space. As the complexity of website code increases, the human capability of handling authorization rules and semantics decreases accordingly. In this project, we demonstrate an automated authorization enforcement detection (AED) tool which allows website administrators to check if they have authorization vulnerabilities on their sites.
Proceedings of the 20th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems, 2017
As mobile and multi-homed devices are becoming ubiquitous, the need for a dynamic, yet secure com... more As mobile and multi-homed devices are becoming ubiquitous, the need for a dynamic, yet secure communication protocol is unavoidable. The Host Identity Protocol (HIP) was constructed to meet this requirement; to provide significantly more secure mobility and multi-homing capabilities. HIP opportunistic mode, which is to be used when other, more trusted mechanisms are lacking, is based on a leap of faith (LoF) paradigm. In this paper, we analyze different Man in the middle (MiTM) attacks which might occur under this LoF, and propose a set of tweaks for hardening opportunistic HIP (HOH) that strengthen opportunistic mode's security.
2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE), 2016
Spraying Diffie-Hellman is a novel key exchange technique for mobile ad-hoc networks (MANETs). Th... more Spraying Diffie-Hellman is a novel key exchange technique for mobile ad-hoc networks (MANETs). The technique is based on spraying keying material over multiple, sub-optimal paths, exploiting the inherent ever-changing paths of MANETs. The results of which turns an active attacker into a passive one. In this paper we describe a number of deficiencies that allow for de-spraying of sprayed data. We also point to vulnerabilities introduced by the spraying technique, not necessarily present beforehand. Our ultimate goal is in surfacing these issues, pointing to open problems requiring further research.
With the proliferation of smart devices such as PDAs, smartphones and tablets having WIFI capabil... more With the proliferation of smart devices such as PDAs, smartphones and tablets having WIFI capabilities, applications orchestrating massive mobile ad-hoc networks (MANETs) are under active development. These networks would have the ability of running communications without the use of pre-existing infrastructure, allowing for a reduction of cost to carriers, setting up communication networks where no infrastructure is available, etc. For such utilities to be widespread, they must take into account the security of data transferred within. In this paper we propose an algorithm that will provide for a secure key exchange during conversation hand-shake, on which a secure channel can built upon. The algorithm assumes no prior knowledge and no user intervention, by using the inherent fluctuation of network topology in MANETs to allow for the discovery of an eavesdropper (if one exists).
Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks
Massive ad-hoc mobile networks with fluctuating topologies, as is expected for the Internet of Th... more Massive ad-hoc mobile networks with fluctuating topologies, as is expected for the Internet of Things (IoT), vehicular networks (VANETs), and others, allow for new solutions for the initial key exchange problem. Spraying data on multiple paths is a novel algorithm for confidential key exchange over public, insecure mobile ad-hoc network. It assumes neither prior knowledge nor a trusted third party. It is based on the inherent fluctuating topology of such networks. By spraying the key exchange packets over multiple fluctuating paths, an adversary's ability of attacking a communication link is greatly diminished; thus, active attackers are turned passive. In this paper, two spraying techniques are compared using multiple simulations on random network topologies. The results show that for small networks one technique surpasses the other, but as the network grows - as is expected in IoT, smart cities, VANETs, etc. - this advantage is diminished.
Key sharing has always been a complex issue. It became even more challenging for the Internet of ... more Key sharing has always been a complex issue. It became even more challenging for the Internet of Things (IoT), where a trusted third party for global management rarely exists. With authentication and confidentiality lacking, things resort to a leap of faith (LoF) paradigm where it is assumed that no attacker is present during the initial configuration. In this paper we focus on the Host Identity Protocol (HIP), specifically designed to provide mobility and multihoming capabilities. Although HIP is normally based on many strict security mechanisms (e.g., DNSSEC), it also provides a better than nothing opportunistic mode, based on the LoF paradigm, which is to be used when other more trusted mechanisms are not available. In this paper, we analyze different MiTM attacks which might occur under this opportunistic mode. Taking advantage of HIP's multihoming capabilities, we propose two key spraying techniques which strengthen the opportunistic mode's security. The first technique spreads the four key-exchange messages among different networks, while the second spreads fractions of one of those messages. Evaluation of these techniques is provided, demonstrating the major benefit of our proposal.
vanets, iot, and many other acronyms represent exciting new technologies that build upon pervasiv... more vanets, iot, and many other acronyms represent exciting new technologies that build upon pervasive computation and communications to achieve their goal. As an underlying communication model, the (mobile) ad hoc network (manet) paradigm is used, which implements a peer-to-peer communication model rather than the more traditional infrastructure model. Of course, privacy, confidentiality, integrity, and security related issues are of utter importance in such contexts as well. In this paper, we wish to present a key exchange technique, which builds upon the inherent characteristic of manets: their fluctuating topology. By splitting key exchange information into multiple parts and spraying them over space or time, the ever-changing topology of the network almost completely removes an active attacker’s success ratio. Algorithms are then simulated, and the results presented and discussed. We further point to future directions and uses for this research.
Aim/Purpose: In this paper we wish to present a new direction for the instruction of a Principles... more Aim/Purpose: In this paper we wish to present a new direction for the instruction of a Principles of Programming Languages (PPL) course. Background: Teaching PPL using the standard curriculum found that the students do not understand the overall concepts, getting lost in the abundance of minute details. We needed a way to emphasize the higher level constructs important to this body of knowledge. Methodology: This is a course description paper, describing how we instruct a PPL course at our college. Contribution: To share with the CS education community the approach we developed to effectively teach the very important PPL course. Findings: Using the integrative approach presented, we believe that • relative to the previous, and commonplace, PPL teaching approach, this is a very effective and successful way for conveying this important subject matter, and • our new teaching approach gave the students a professional maturity that they lacked before they took the course. Recommendations...
Abstract All nefarious players must be able to maximize profit on an attack. In the context of co... more Abstract All nefarious players must be able to maximize profit on an attack. In the context of communication networks, part of that need translates to finding the best topological location for the attack. While in static networks this is an easily solvable problem, in mobile ad-hoc networks (manet ) having constant topology fluctuations, this becomes a formidable task. Highly important asset nodes are those having numerous paths traversing through them, with bottlenecks being nodes that all data must pass through. Once such nodes are compromised, the damage can be catastrophic. Hence, network defenders must also find these nodes so they can be better protected. In this paper we propose a method that ensures finding such bottleneck nodes (assuming one exists) in olsr based manet , with linear cost. This is accomplished without adding overhead on the network. We experiment and compare, using network simulation tools, multiple types of attackers over a diverse set of topologies.
The European Network for the Joint Evaluation of Connected Health Technologies (ENJECT) is a COST... more The European Network for the Joint Evaluation of Connected Health Technologies (ENJECT) is a COST action that brings together an international consortium, including business and revenue modellers, clinicians, technologists, engineers, economists, ethnographers, and health researchers to help society to answer one question – how to connect therapies, patients, and care-givers to deliver optimum health results in an era of stretched resources and increasing demands. This report, which has grown out of an ENJECT survey of 19 European countries, examines the situation of Connected Health in Europe today. It focuses on creating a clear understanding of the current and developing presence of Connected Health throughout European healthcare systems under five headings: The Policy Environment, Education, Business and Health Models, Interoperability, and The Person. Quality, privacy, and safety, major elements of Connected Health, were evident policy concerns in the Connected Health context. ...
Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWiM '16, 2016
Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. ... more Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. These attacks (among others) are based on the premise that packets will travel through compromised nodes, and methods exist to coax routing into these traps. Detection of these attacks are mainly centered around finding the subversion in action. In networks, bottleneck nodes -- those that sit on many potential routes between sender and receiver -- are an optimal location for compromise. Finding naturally occurring path bottlenecks, however, does not entitle network subversion, and as such are more difficult to detect. The dynamic nature of mobile ad-hoc networks (manets) causes ubiquitous routing algorithms to be even more susceptible to this class of attacks. Finding perceived bottlenecks in an olsr based manet, is able to capture between 50%-75% of data. In this paper we propose a method of subtly expanding perceived bottlenecks into complete bottlenecks, raising capture rate up to 99%; albeit, at high cost. We further tune the method to reduce cost, and measure the corresponding capture rate.
Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc.), detect... more Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc.), detection & mitigation techniques only function after the attack has commenced. Prevention, however, attempts at thwarting an attack before it is executed. Both techniques can be realized either by the collective collaboration of network nodes (i.e. adding security messages to protocols) or by internal deduction of attack state. In this paper we propose a method for minimizing the gray-hole DoS attack. Our solution assumes no explicit node collaboration, with each node using only internal knowledge gained by routine routing information. The technique was evaluated using 5 different threat models (different attacker capabilities), allowing for a better understanding of the attack surface and its prevention. Our simulation results show a decrease of up to 51% in previously dropped packet, greatly minimizing gray-hole attack effectiveness.
International Conference on Information Society (i-Society 2014), 2014
This presentation describes a JFLAP augmentation to allow for conformance testing algorithms of c... more This presentation describes a JFLAP augmentation to allow for conformance testing algorithms of communication protocols modeled as Mealy machine. This allows students to better understand conformance testing through demonstration, avoiding laborious, error prone calculations of the various algorithms.
2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, 2013
Ubiquitous use of MANETs (Mobile Ad-hoc Networks) is greatly hindered by the technological cap on... more Ubiquitous use of MANETs (Mobile Ad-hoc Networks) is greatly hindered by the technological cap on broadcast distances. In this work we propose a method of extending the cover area of a MANETs by taking advantage of pre-existing mesh networks among routers. This is done in a transparent manner, so participating ad-hoc nodes are oblivious to this mechanism. They see both ad-hoc networks as one, effectively creating a large virtual network. We implemented a proof-ofconcept that uses a MANET client application over the Android operating system for providing voice calls between smartphones.
This report is based upon work from COST Action (ENJECT TD1405), supported by COST (European Coop... more This report is based upon work from COST Action (ENJECT TD1405), supported by COST (European Cooperation in Science and Technology).
– With the eruption of communication technology and its supportive protocols, the field of testin... more – With the eruption of communication technology and its supportive protocols, the field of testing of timed-IUT (Implementation Under Test with time constraints) was quick to follow. New and extended test generation methods using timed automata were in the need. Many papers were written on a broad range of timed automata testing. Few papers, however, dealt with generation of state identification sequences problems. Those who did, keyed their algorithms towards transformation of a timed-IUT into a regular, untimed IUT; thus, avoiding the need of redefining well known generation algorithms. This method, however, only functions if we search for optimal sequences w.r.t. their lengths. Optimality w.r.t. execution time was not considered in this context. In this paper we present a search algorithm for the direct generation of timed homing sequences optimal w.r.t. to execution time. This is accomplished by expanding and modifying the search tree used in previous algorithms such that it con...
REMOTE AGENT FOR CONFORMANCE TESTING OF TIMED-AUTOMATA Ariel Stulman1 , Simon Bloch1,2 , HG Mende... more REMOTE AGENT FOR CONFORMANCE TESTING OF TIMED-AUTOMATA Ariel Stulman1 , Simon Bloch1,2 , HG Mendelbaum2,3 1Univ. Reims, CReSTIC (LICA), Reims, France 2 Jerusalem College of Technology - POB 16031 Jerusalem, Israel 91160 3 Univ. ...
Testing of a new communication protocol was always a basic requirement for its acceptance and imp... more Testing of a new communication protocol was always a basic requirement for its acceptance and implementation. The use of automata for the modeling of protocols allows for usage of pre-developed testing algorithms for this basic data structure. With timing being a major factor in many communication protocols, automata theory was quick to evolve to accommodate for this edition. New and extended test generation methods using timed automata were developed. Within the context of state identification, most methods, however, keyed their algorithms towards transformation of a timed automaton into a regular, un-timed one; thus, avoiding the need of redefining well known test generation algorithms. In this paper we wish to demonstrate that as far as the well known distinguishing sequence problem (state verification), it is preferable to adapt the standard algorithm to meet the special needs of a timed automaton, sidestepping a costly transformation. We propose a new method of generating a timed-distinguishing sequence, which allows direct testing of a timed IUT (Implementation Under Test) modeled by a timed automaton. An example is used to show the semantics of the algorithm.
2020 8th International Conference on Wireless Networks and Mobile Communications (WINCOM), 2020
Simulation based network protocol testing requires that one model reality correctly. Mis-modellin... more Simulation based network protocol testing requires that one model reality correctly. Mis-modelling can render results invalid. Hence, one must determine the context in which a solution is to be implemented for the results to be meaningful. In this work, we investigate whether the security augmentation technique DCFM (denial contradictions with fictitious nodes) for OLSR based mobile ad-hoc networks (MANET) is valid for multiple contexts. We accomplish this by running the node isolation attack and DCFM defense on a variety of mobility models, comparing the results. We show that for most models the technique performs well, while for a specific scenario (e.g. street based) it fails. Additionally we describe the infrastructure that was built to support the street based simulations.
Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017
One of the many aspects of website security is the question of authorization breach. It is an att... more One of the many aspects of website security is the question of authorization breach. It is an attack in which un-authorized entities are allowed access to restricted space. As the complexity of website code increases, the human capability of handling authorization rules and semantics decreases accordingly. In this project, we demonstrate an automated authorization enforcement detection (AED) tool which allows website administrators to check if they have authorization vulnerabilities on their sites.
Proceedings of the 20th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems, 2017
As mobile and multi-homed devices are becoming ubiquitous, the need for a dynamic, yet secure com... more As mobile and multi-homed devices are becoming ubiquitous, the need for a dynamic, yet secure communication protocol is unavoidable. The Host Identity Protocol (HIP) was constructed to meet this requirement; to provide significantly more secure mobility and multi-homing capabilities. HIP opportunistic mode, which is to be used when other, more trusted mechanisms are lacking, is based on a leap of faith (LoF) paradigm. In this paper, we analyze different Man in the middle (MiTM) attacks which might occur under this LoF, and propose a set of tweaks for hardening opportunistic HIP (HOH) that strengthen opportunistic mode's security.
2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE), 2016
Spraying Diffie-Hellman is a novel key exchange technique for mobile ad-hoc networks (MANETs). Th... more Spraying Diffie-Hellman is a novel key exchange technique for mobile ad-hoc networks (MANETs). The technique is based on spraying keying material over multiple, sub-optimal paths, exploiting the inherent ever-changing paths of MANETs. The results of which turns an active attacker into a passive one. In this paper we describe a number of deficiencies that allow for de-spraying of sprayed data. We also point to vulnerabilities introduced by the spraying technique, not necessarily present beforehand. Our ultimate goal is in surfacing these issues, pointing to open problems requiring further research.
With the proliferation of smart devices such as PDAs, smartphones and tablets having WIFI capabil... more With the proliferation of smart devices such as PDAs, smartphones and tablets having WIFI capabilities, applications orchestrating massive mobile ad-hoc networks (MANETs) are under active development. These networks would have the ability of running communications without the use of pre-existing infrastructure, allowing for a reduction of cost to carriers, setting up communication networks where no infrastructure is available, etc. For such utilities to be widespread, they must take into account the security of data transferred within. In this paper we propose an algorithm that will provide for a secure key exchange during conversation hand-shake, on which a secure channel can built upon. The algorithm assumes no prior knowledge and no user intervention, by using the inherent fluctuation of network topology in MANETs to allow for the discovery of an eavesdropper (if one exists).
Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks
Massive ad-hoc mobile networks with fluctuating topologies, as is expected for the Internet of Th... more Massive ad-hoc mobile networks with fluctuating topologies, as is expected for the Internet of Things (IoT), vehicular networks (VANETs), and others, allow for new solutions for the initial key exchange problem. Spraying data on multiple paths is a novel algorithm for confidential key exchange over public, insecure mobile ad-hoc network. It assumes neither prior knowledge nor a trusted third party. It is based on the inherent fluctuating topology of such networks. By spraying the key exchange packets over multiple fluctuating paths, an adversary's ability of attacking a communication link is greatly diminished; thus, active attackers are turned passive. In this paper, two spraying techniques are compared using multiple simulations on random network topologies. The results show that for small networks one technique surpasses the other, but as the network grows - as is expected in IoT, smart cities, VANETs, etc. - this advantage is diminished.
Key sharing has always been a complex issue. It became even more challenging for the Internet of ... more Key sharing has always been a complex issue. It became even more challenging for the Internet of Things (IoT), where a trusted third party for global management rarely exists. With authentication and confidentiality lacking, things resort to a leap of faith (LoF) paradigm where it is assumed that no attacker is present during the initial configuration. In this paper we focus on the Host Identity Protocol (HIP), specifically designed to provide mobility and multihoming capabilities. Although HIP is normally based on many strict security mechanisms (e.g., DNSSEC), it also provides a better than nothing opportunistic mode, based on the LoF paradigm, which is to be used when other more trusted mechanisms are not available. In this paper, we analyze different MiTM attacks which might occur under this opportunistic mode. Taking advantage of HIP's multihoming capabilities, we propose two key spraying techniques which strengthen the opportunistic mode's security. The first technique spreads the four key-exchange messages among different networks, while the second spreads fractions of one of those messages. Evaluation of these techniques is provided, demonstrating the major benefit of our proposal.
vanets, iot, and many other acronyms represent exciting new technologies that build upon pervasiv... more vanets, iot, and many other acronyms represent exciting new technologies that build upon pervasive computation and communications to achieve their goal. As an underlying communication model, the (mobile) ad hoc network (manet) paradigm is used, which implements a peer-to-peer communication model rather than the more traditional infrastructure model. Of course, privacy, confidentiality, integrity, and security related issues are of utter importance in such contexts as well. In this paper, we wish to present a key exchange technique, which builds upon the inherent characteristic of manets: their fluctuating topology. By splitting key exchange information into multiple parts and spraying them over space or time, the ever-changing topology of the network almost completely removes an active attacker’s success ratio. Algorithms are then simulated, and the results presented and discussed. We further point to future directions and uses for this research.
Aim/Purpose: In this paper we wish to present a new direction for the instruction of a Principles... more Aim/Purpose: In this paper we wish to present a new direction for the instruction of a Principles of Programming Languages (PPL) course. Background: Teaching PPL using the standard curriculum found that the students do not understand the overall concepts, getting lost in the abundance of minute details. We needed a way to emphasize the higher level constructs important to this body of knowledge. Methodology: This is a course description paper, describing how we instruct a PPL course at our college. Contribution: To share with the CS education community the approach we developed to effectively teach the very important PPL course. Findings: Using the integrative approach presented, we believe that • relative to the previous, and commonplace, PPL teaching approach, this is a very effective and successful way for conveying this important subject matter, and • our new teaching approach gave the students a professional maturity that they lacked before they took the course. Recommendations...
Abstract All nefarious players must be able to maximize profit on an attack. In the context of co... more Abstract All nefarious players must be able to maximize profit on an attack. In the context of communication networks, part of that need translates to finding the best topological location for the attack. While in static networks this is an easily solvable problem, in mobile ad-hoc networks (manet ) having constant topology fluctuations, this becomes a formidable task. Highly important asset nodes are those having numerous paths traversing through them, with bottlenecks being nodes that all data must pass through. Once such nodes are compromised, the damage can be catastrophic. Hence, network defenders must also find these nodes so they can be better protected. In this paper we propose a method that ensures finding such bottleneck nodes (assuming one exists) in olsr based manet , with linear cost. This is accomplished without adding overhead on the network. We experiment and compare, using network simulation tools, multiple types of attackers over a diverse set of topologies.
The European Network for the Joint Evaluation of Connected Health Technologies (ENJECT) is a COST... more The European Network for the Joint Evaluation of Connected Health Technologies (ENJECT) is a COST action that brings together an international consortium, including business and revenue modellers, clinicians, technologists, engineers, economists, ethnographers, and health researchers to help society to answer one question – how to connect therapies, patients, and care-givers to deliver optimum health results in an era of stretched resources and increasing demands. This report, which has grown out of an ENJECT survey of 19 European countries, examines the situation of Connected Health in Europe today. It focuses on creating a clear understanding of the current and developing presence of Connected Health throughout European healthcare systems under five headings: The Policy Environment, Education, Business and Health Models, Interoperability, and The Person. Quality, privacy, and safety, major elements of Connected Health, were evident policy concerns in the Connected Health context. ...
Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWiM '16, 2016
Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. ... more Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. These attacks (among others) are based on the premise that packets will travel through compromised nodes, and methods exist to coax routing into these traps. Detection of these attacks are mainly centered around finding the subversion in action. In networks, bottleneck nodes -- those that sit on many potential routes between sender and receiver -- are an optimal location for compromise. Finding naturally occurring path bottlenecks, however, does not entitle network subversion, and as such are more difficult to detect. The dynamic nature of mobile ad-hoc networks (manets) causes ubiquitous routing algorithms to be even more susceptible to this class of attacks. Finding perceived bottlenecks in an olsr based manet, is able to capture between 50%-75% of data. In this paper we propose a method of subtly expanding perceived bottlenecks into complete bottlenecks, raising capture rate up to 99%; albeit, at high cost. We further tune the method to reduce cost, and measure the corresponding capture rate.
Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc.), detect... more Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc.), detection & mitigation techniques only function after the attack has commenced. Prevention, however, attempts at thwarting an attack before it is executed. Both techniques can be realized either by the collective collaboration of network nodes (i.e. adding security messages to protocols) or by internal deduction of attack state. In this paper we propose a method for minimizing the gray-hole DoS attack. Our solution assumes no explicit node collaboration, with each node using only internal knowledge gained by routine routing information. The technique was evaluated using 5 different threat models (different attacker capabilities), allowing for a better understanding of the attack surface and its prevention. Our simulation results show a decrease of up to 51% in previously dropped packet, greatly minimizing gray-hole attack effectiveness.
International Conference on Information Society (i-Society 2014), 2014
This presentation describes a JFLAP augmentation to allow for conformance testing algorithms of c... more This presentation describes a JFLAP augmentation to allow for conformance testing algorithms of communication protocols modeled as Mealy machine. This allows students to better understand conformance testing through demonstration, avoiding laborious, error prone calculations of the various algorithms.
2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, 2013
Ubiquitous use of MANETs (Mobile Ad-hoc Networks) is greatly hindered by the technological cap on... more Ubiquitous use of MANETs (Mobile Ad-hoc Networks) is greatly hindered by the technological cap on broadcast distances. In this work we propose a method of extending the cover area of a MANETs by taking advantage of pre-existing mesh networks among routers. This is done in a transparent manner, so participating ad-hoc nodes are oblivious to this mechanism. They see both ad-hoc networks as one, effectively creating a large virtual network. We implemented a proof-ofconcept that uses a MANET client application over the Android operating system for providing voice calls between smartphones.
Uploads
Papers by Ariel Stulman