View All Items

Title: A comparative study of classification algorithms for network intrusion detection.
Creator: Wang, Yunling., Florida Atlantic University, Khoshgoftaar, Taghi M., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: As network-based computer systems play increasingly vital roles in modern society, they have become the targets of criminals. Network security has never been more important a subject than in today's extensively interconnected computer world. Intrusion Detection Systems (IDS) have been used along with the data mining techniques to detect intrusions. In this thesis, we present a comparative study of intrusion detection using a decision-tree learner (C4.5), two rule-based learners (ripper and...
Show moreAs network-based computer systems play increasingly vital roles in modern society, they have become the targets of criminals. Network security has never been more important a subject than in today's extensively interconnected computer world. Intrusion Detection Systems (IDS) have been used along with the data mining techniques to detect intrusions. In this thesis, we present a comparative study of intrusion detection using a decision-tree learner (C4.5), two rule-based learners (ripper and ridor), a learner to combine decision trees and rules (PART), and two instance-based learners (IBK and Nnge). We investigate and compare the performance of IDSs based on the six techniques, with respect to a case study of the DAPAR KDD-1999 network intrusion detection project. Investigation results demonstrated that data mining techniques are very useful in the area of intrusion detection.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13102
Subject Headings: Computer networks--Security measures, Data mining, Decision trees
Format: Document (PDF)

Title: Data mining heuristic-¬based malware detection for android applications.
Creator: Peiravian, Naser, Zhu, Xingquan, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Google Android mobile phone platform is one of the dominant smartphone operating systems on the market. The open source Android platform allows developers to take full advantage of the mobile operation system, but also raises significant issues related to malicious applications (Apps). The popularity of Android platform draws attention of many developers which also attracts the attention of cybercriminals to develop different kinds of malware to be inserted into the Google Android Market...
Show moreThe Google Android mobile phone platform is one of the dominant smartphone operating systems on the market. The open source Android platform allows developers to take full advantage of the mobile operation system, but also raises significant issues related to malicious applications (Apps). The popularity of Android platform draws attention of many developers which also attracts the attention of cybercriminals to develop different kinds of malware to be inserted into the Google Android Market or other third party markets as safe applications. In this thesis, we propose to combine permission, API (Application Program Interface) calls and function calls to build a Heuristic-Based framework for the detection of malicious Android Apps. In our design, the permission is extracted from each App’s profile information and the APIs are extracted from the packed App file by using packages and classes to represent API calls. By using permissions, API calls and function calls as features to characterize each of Apps, we can develop a classifier by data mining techniques to identify whether an App is potentially malicious or not. An inherent advantage of our method is that it does not need to involve any dynamic tracking of the system calls but only uses simple static analysis to find system functions from each App. In addition, Our Method can be generalized to all mobile applications due to the fact that APIs and function calls are always present for mobile Apps. Experiments on real-world Apps with more than 1200 malwares and 1200 benign samples validate the algorithm performance. Research paper published based on the work reported in this thesis: Naser Peiravian, Xingquan Zhu, Machine Learning for Android Malware Detection Using Permission and API Calls, in Proc. of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI) – Washington D.C, November 4-6, 2013.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fau/fd/FA0004045
Subject Headings: Computer networks -- Security measures, Data encryption (Computer science), Data structures (Computer science), Internet -- Security measures
Format: Document (PDF)

Title: Properties of Static and Mobile Unreliable Networks and their effects on Combating Malicious Objects.
Creator: Ruocco, John, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks...
Show moreWireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks are either moving to different positions or going offi ine which constantly changes the overall layout of the network. With this increasing connectivity of today's devices this opens the door for possibility for these types of networks to become targets by malicious objects designed to bring harm to the network. Many unre liable networks already face many problems such as having to optimize battety life and being deployed in areas where they can be damaged. A malicious object in this type of network has the power to destroy data and deplete the networks limited resources such as bandwidth and power. Removal of these malicious objects can also have a negative effect on these limited resources. We must find a way to remove these malicious objects in a way that minimizes loss to the network. In this paper we will look at the information survival threshold of these types of networks. Certain controllable parameters exist that directly impact the survival rate of all data in the network. We will combine this with the addition our own self-replicating objects to the network designed to neutralize their malicious counterparts. We will examine these information survival threshold parameters along with specific parameters available to the network. We shall see how these parameters affect overall survival of data in the network and their impact on our own good data.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/fau/fd/FA00012545
Subject Headings: Wireless communication systems--Security measures, Computer network protocols, Computer security, Computer networks--Security measures
Format: Document (PDF)

Title: Misuse Patterns for the SSL/TLS Protocol.
Creator: Alkazimi, Ali, Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The SSL/TLS is the main protocol used to provide secure data connection between a client and a server. The main concern of using this protocol is to avoid the secure connection from being breached. Computer systems and their applications are becoming more complex and keeping these secure connections between all the connected components is a challenge. To avoid any new security flaws and protocol connections weaknesses, the SSL/TLS protocol is always releasing newer versions after discovering...
Show moreThe SSL/TLS is the main protocol used to provide secure data connection between a client and a server. The main concern of using this protocol is to avoid the secure connection from being breached. Computer systems and their applications are becoming more complex and keeping these secure connections between all the connected components is a challenge. To avoid any new security flaws and protocol connections weaknesses, the SSL/TLS protocol is always releasing newer versions after discovering security bugs and vulnerabilities in any of its previous version. We have described some of the common security flaws in the SSL/TLS protocol by identifying them in the literature and then by analyzing the activities from each of their use cases to find any possible threats. These threats are realized in the form of misuse cases to understand how an attack happens from the point of the attacker. This approach implies the development of some security patterns which will be added as a reference for designing secure systems using the SSL/TLS protocol. We finally evaluate its security level by using misuse patterns and considering the threat coverage of the models.
Show less
Date Issued: 2017
PURL: http://purl.flvc.org/fau/fd/FA00004873, http://purl.flvc.org/fau/fd/FA00004873
Subject Headings: Computer networks--Security measures., Computer network protocols., Computer software--Development., Computer architecture.
Format: Document (PDF)

Title: An Empirical Study of Ordinal and Non-ordinal Classification Algorithms for Intrusion Detection in WLANs.
Creator: Gopalakrishnan, Leelakrishnan, Khoshgoftaar, Taghi M., Florida Atlantic University
Abstract/Description: Ordinal classification refers to an important category of real world problems, in which the attributes of the instances to be classified and the classes are linearly ordered. Many applications of machine learning frequently involve situations exhibiting an order among the different categories represented by the class attribute. In ordinal classification the class value is converted into a numeric quantity and regression algorithms are applied to the transformed data. The data is later...
Show moreOrdinal classification refers to an important category of real world problems, in which the attributes of the instances to be classified and the classes are linearly ordered. Many applications of machine learning frequently involve situations exhibiting an order among the different categories represented by the class attribute. In ordinal classification the class value is converted into a numeric quantity and regression algorithms are applied to the transformed data. The data is later translated back into a discrete class value in a postprocessing step. This thesis is devoted to an empirical study of ordinal and non-ordinal classification algorithms for intrusion detection in WLANs. We used ordinal classification in conjunction with nine classifiers for the experiments in this thesis. All classifiers are parts of the WEKA machinelearning workbench. The results indicate that most of the classifiers give similar or better results with ordinal classification compared to non-ordinal classification.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fau/fd/FA00012521
Subject Headings: Wireless LANs--Security measures, Computer networks--Security measures, Data structures (Computer science), Multivariate analysis
Format: Document (PDF)

Title: Evaluating indirect and direct classification techniques for network intrusion detection.
Creator: Ibrahim, Nawal H., Florida Atlantic University, Khoshgoftaar, Taghi M.
Abstract/Description: Increasing aggressions through cyber terrorism pose a constant threat to information security in our day to day life. Implementing effective intrusion detection systems (IDSs) is an essential task due to the great dependence on networked computers for the operational control of various infrastructures. Building effective IDSs, unfortunately, has remained an elusive goal owing to the great technical challenges involved, and applied data mining techniques are increasingly being utilized in...
Show moreIncreasing aggressions through cyber terrorism pose a constant threat to information security in our day to day life. Implementing effective intrusion detection systems (IDSs) is an essential task due to the great dependence on networked computers for the operational control of various infrastructures. Building effective IDSs, unfortunately, has remained an elusive goal owing to the great technical challenges involved, and applied data mining techniques are increasingly being utilized in attempts to overcome the difficulties. This thesis presents a comparative study of the traditional "direct" approaches with the recently explored "indirect" approaches of classification which use class binarization and combiner techniques for intrusion detection. We evaluate and compare the performance of IDSs based on various data mining algorithms, in the context of a well known network intrusion evaluation data set. It is empirically shown that data mining algorithms when applied using the indirect classification approach yield better intrusion detection models.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13128
Subject Headings: Computer networks--Security measures, Computer security, Software measurement, Data mining
Format: Document (PDF)

Title: Password-authenticated two-party key exchange with long-term security.
Creator: Gao, WeiZheng., Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: In the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the...
Show moreIn the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the intractability of solving a specied number of instances v of the underlying computational problem. Such a design strategy seems particularly interesting when aiming at long-term security guarantees for a protocol, where expensive special purpose equipment might become available to an adversary. In this thesis, we give one protocol for the special case when v = 1 in the random oracle model, then we provide the generalized protocol in the random oracle model and a variant of the generalized protocol in the standard model for v being a polynomial of the security parameter `.
Show less
Date Issued: 2012
PURL: http://purl.flvc.org/FAU/3342105
Subject Headings: Data encryption (Computer science), Computer networks (Security measures), Software protection, Computers, Access control, Passwords
Format: Document (PDF)

Title: Reputation-based system for encouraging cooperation of nodes in mobile ad hoc networks.
Creator: Anantvalee, Tiranuch., Florida Atlantic University, Wu, Jie
Abstract/Description: In a mobile ad hoc network, node cooperation in packet forwarding is required for the network to function properly. However, since nodes in this network usually have limited resources, some selfish nodes might intend not to forward packets to save resources for their own use. To discourage such behavior, we propose RMS, a reputation-based system, to detect selfish nodes and respond to them by showing that being cooperative will benefit there more than being selfish. We also detect, to some...
Show moreIn a mobile ad hoc network, node cooperation in packet forwarding is required for the network to function properly. However, since nodes in this network usually have limited resources, some selfish nodes might intend not to forward packets to save resources for their own use. To discourage such behavior, we propose RMS, a reputation-based system, to detect selfish nodes and respond to them by showing that being cooperative will benefit there more than being selfish. We also detect, to some degree, nodes who forward only the necessary amount of packets to avoid being detected as selfish. We introduce the use of a state model to decide what we should do or respond to nodes in each state. In addition, we introduce the use of a timing period to control when the reputation should be updated and to use as a timeout for each state. The simulation results show that RMS can identify selfish nodes and punish them accordingly, which provide selfish nodes with an incentive to behave more cooperatively.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13406
Subject Headings: Computer networks--Security measures, Wireless communication systems, Routers (Computer networks), Computer network architectures
Format: Document (PDF)

Title: Resource-sensitive intrusion detection models for network traffic.
Creator: Abushadi, Mohamed E., Florida Atlantic University, Khoshgoftaar, Taghi M.
Abstract/Description: Network security is an important subject in today's extensively interconnected computer world. The industry, academic institutions, small and large businesses and even residences are now greatly at risk from the increasing onslaught of computer attacks. Such malicious efforts cause damage ranging from mere violation of confidentiality and issues of privacy up to actual financial loss if business operations are compromised, or even further, loss of human lives in the case of mission-critical...
Show moreNetwork security is an important subject in today's extensively interconnected computer world. The industry, academic institutions, small and large businesses and even residences are now greatly at risk from the increasing onslaught of computer attacks. Such malicious efforts cause damage ranging from mere violation of confidentiality and issues of privacy up to actual financial loss if business operations are compromised, or even further, loss of human lives in the case of mission-critical networked computer applications. Intrusion Detection Systems (IDS) have been used along with the help of data mining modeling efforts to detect intruders, yet with the limitation of organizational resources it is unreasonable to inspect every network alarm raised by the IDS. Modified Expected Cost of Misclassification ( MECM) is a model selection measure that is resource-aware and cost-sensitive at the same time, and has proven to be effective for the identification of the best resource-based intrusion detection model.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13054
Subject Headings: Computer networks--Security measures--Automation, Computers--Access control, Data mining, Computer security
Format: Document (PDF)

Title: Techniques for combining binary classifiers: A comparative study in network intrusion detection systems.
Creator: Lin, Hua., Florida Atlantic University, Khoshgoftaar, Taghi M., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We discuss a set of indirect combining techniques for addressing multi-category classification problems that have been used in many domains, but not for intrusion detection systems. In contrast to the indirect combining techniques, direct techniques generally extend associated binary classifiers to handle multi-category classification problems. An indirect combining technique decomposes the original multi-category problem into, based on some criteria, multiple binary-category problems. We...
Show moreWe discuss a set of indirect combining techniques for addressing multi-category classification problems that have been used in many domains, but not for intrusion detection systems. In contrast to the indirect combining techniques, direct techniques generally extend associated binary classifiers to handle multi-category classification problems. An indirect combining technique decomposes the original multi-category problem into, based on some criteria, multiple binary-category problems. We investigated two different approaches for building the binary classifiers. The results of the binary classifiers are then merged using a combining technique---three different combining techniques were studied. We implement some of the indirect combining techniques proposed in recent literature, and apply them to a case study of the DARPA KDD-1999 network intrusion detection project. The results demonstrate the usefulness of using indirect combining techniques for the multi-category classification problem of intrusion detection systems.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13111
Subject Headings: Computer networks--Security measures, Computer security, Computers--Access control, Electronic countermeasures, Fuzzy systems
Format: Document (PDF)

Title: Fuzzy vault fingerprint cryptography: Experimental and simulation studies.
Creator: Kotlarchyk, Alex J., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The fuzzy vault scheme introduced by Juels and Sudan [Jue02] was implemented in a fingerprint cryptography system using COTS software. This system proved to be unsuccessful. Failure analysis led to a series of simulations to investigate the parameters and system thresholds necessary for such a system to perform adequately and as guidance for constructing similar systems in the future. First, a discussion of the role of biometrics in data security and cryptography is presented, followed by a...
Show moreThe fuzzy vault scheme introduced by Juels and Sudan [Jue02] was implemented in a fingerprint cryptography system using COTS software. This system proved to be unsuccessful. Failure analysis led to a series of simulations to investigate the parameters and system thresholds necessary for such a system to perform adequately and as guidance for constructing similar systems in the future. First, a discussion of the role of biometrics in data security and cryptography is presented, followed by a review of the key developments leading to the development of the fuzzy vault scheme. The relevant mathematics and algorithms are briefly explained. This is followed by a detailed description of the implementation and simulation of the fuzzy vault scheme. Finally, conclusions drawn from analysis of the results of this research are presented.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13360
Subject Headings: Computer networks--Security measures, Computer security, Data encryption (Computer science)
Format: Document (PDF)

Title: Machine learning algorithms for the analysis and detection of network attacks.
Creator: Najafabadi, Maryam Mousaarab, Khoshgoftaar, Taghi M., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Internet and computer networks have become an important part of our organizations and everyday life. With the increase in our dependence on computers and communication networks, malicious activities have become increasingly prevalent. Network attacks are an important problem in today’s communication environments. The network traffic must be monitored and analyzed to detect malicious activities and attacks to ensure reliable functionality of the networks and security of users’ information....
Show moreThe Internet and computer networks have become an important part of our organizations and everyday life. With the increase in our dependence on computers and communication networks, malicious activities have become increasingly prevalent. Network attacks are an important problem in today’s communication environments. The network traffic must be monitored and analyzed to detect malicious activities and attacks to ensure reliable functionality of the networks and security of users’ information. Recently, machine learning techniques have been applied toward the detection of network attacks. Machine learning models are able to extract similarities and patterns in the network traffic. Unlike signature based methods, there is no need for manual analyses to extract attack patterns. Applying machine learning algorithms can automatically build predictive models for the detection of network attacks. This dissertation reports an empirical analysis of the usage of machine learning methods for the detection of network attacks. For this purpose, we study the detection of three common attacks in computer networks: SSH brute force, Man In The Middle (MITM) and application layer Distributed Denial of Service (DDoS) attacks. Using outdated and non-representative benchmark data, such as the DARPA dataset, in the intrusion detection domain, has caused a practical gap between building detection models and their actual deployment in a real computer network. To alleviate this limitation, we collect representative network data from a real production network for each attack type. Our analysis of each attack includes a detailed study of the usage of machine learning methods for its detection. This includes the motivation behind the proposed machine learning based detection approach, the data collection process, feature engineering, building predictive models and evaluating their performance. We also investigate the application of feature selection in building detection models for network attacks. Overall, this dissertation presents a thorough analysis on how machine learning techniques can be used to detect network attacks. We not only study a broad range of network attacks, but also study the application of different machine learning methods including classification, anomaly detection and feature selection for their detection at the host level and the network level.
Show less
Date Issued: 2017
PURL: http://purl.flvc.org/fau/fd/FA00004882, http://purl.flvc.org/fau/fd/FA00004882
Subject Headings: Machine learning., Computer security., Data protection., Computer networks--Security measures.
Format: Document (PDF)

Title: Software decomposition for multicore architectures.
Creator: Jain, Ankit., Florida Atlantic University, Shankar, Ravi
Abstract/Description: Current multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and...
Show moreCurrent multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and communication metrics. The outcome is a set of proposals for software decomposition. We then build abstract concurrent models that map these decomposed (abstract) software modules onto candidate multicore architectures; this resolves concurrency issues. We then perform a system level simulation to estimate concurrency gain and/or cost, and QOS (Qualify-of-Service) metrics. Different architectural combinations yield different QOS metrics; the requisite system architecture may then be chosen. We applied this 'middle-out' methodology to optimally map a digital camera application onto a processor with four cores.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13349
Subject Headings: Optimal designs (Statistics), Software architecture, Software engineering, Computer architecture, System design, Computer networks--Security measures
Format: Document (PDF)

Title: Unifying the conceptual levels of network security through the use of patterns.
Creator: Kumar, Ajoy, Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Network architectures are described by the International Standard for Organization (ISO), which contains seven layers. The internet uses four of these layers, of which three are of interest to us. These layers are Internet Protocol (IP) or Network Layer, Transport Layer and Application Layer. We need to protect against attacks that may come through any of these layers. In the world of network security, systems are plagued by various attacks, internal and external, and could result in Denial...
Show moreNetwork architectures are described by the International Standard for Organization (ISO), which contains seven layers. The internet uses four of these layers, of which three are of interest to us. These layers are Internet Protocol (IP) or Network Layer, Transport Layer and Application Layer. We need to protect against attacks that may come through any of these layers. In the world of network security, systems are plagued by various attacks, internal and external, and could result in Denial of Service (DoS) and/or other damaging effects. Such attacks and loss of service can be devastating for the users of the system. The implementation of security devices such as Firewalls and Intrusion Detection Systems (IDS), the protection of network traffic with Virtual Private Networks (VPNs), and the use of secure protocols for the layers are important to enhance the security at each of these layers.We have done a survey of the existing network security patterns and we have written the missing patterns. We have developed security patterns for abstract IDS, Behavior–based IDS and Rule-based IDS and as well as for Internet Protocol Security (IPSec) and Transport Layer Security (TLS) protocols. We have also identified the need for a VPN pattern and have developed security patterns for abstract VPN, an IPSec VPN and a TLS VPN. We also evaluated these patterns with respect to some aspects to simplify their application by system designers. We have tried to unify the security of the network layers using security patterns by tying in security patterns for network transmission, network protocols and network boundary devices.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004132, http://purl.flvc.org/fau/fd/FA00004132
Subject Headings: Computer architecture, Computer network architectures, Computer network protocols, Computer network protocols, Computer networks -- Security measures, Expert systems (Computer science)
Format: Document (PDF)

Title: Firewall formulation driven by risk analysis.
Creator: Srinivasan, Sriram, Jr., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: At the turn of the new millennium, the focus of Information Technology Management turned to Information and Systems Security, as opposed to competitive advantage investment. In catering to the security needs of various firms and institutions, it is seen that different entities require varying Information Security configurations. This thesis attempts to utilize Risk Analysis, a commonly used procedure in business realms, to formulate customized Firewalls based on the specific needs of a...
Show moreAt the turn of the new millennium, the focus of Information Technology Management turned to Information and Systems Security, as opposed to competitive advantage investment. In catering to the security needs of various firms and institutions, it is seen that different entities require varying Information Security configurations. This thesis attempts to utilize Risk Analysis, a commonly used procedure in business realms, to formulate customized Firewalls based on the specific needs of a network, subsequently building an effective system following the "Defense in Depth" strategy. This is done by first choosing an efficient Risk Analysis model which suits the process of creating Firewall policies, and then applying it to a particular case study. A network within Florida Atlantic University is used as an experimental test case, and by analyzing the traffic to which it is subject while behind a single Firewall layer, a specific Security Policy is arrived at and implemented.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13348
Subject Headings: Computer networks--Security measures, Electronic data processing departments--Security measures, Firewalls (Computer security), Risk assessment
Format: Document (PDF)

Title: A method for adding multimedia knowledge for improving intrusion detection systems.
Creator: Baillargeon, Pierre Elliott., Florida Atlantic University, Marques, Oge
Abstract/Description: Intrusion Detection Systems (IDS) are security tools which monitor systems and networks for malicious activity. In saturated network links the amount of data present for analysis can overwhelm them, resulting in potentially undetected attacks. Many of these network links contain significant amounts of multimedia traffic which may seem to contribute to the problem, however our work suggests otherwise. This thesis proposes a novel method to classify and analyze multimedia traffic in an effort...
Show moreIntrusion Detection Systems (IDS) are security tools which monitor systems and networks for malicious activity. In saturated network links the amount of data present for analysis can overwhelm them, resulting in potentially undetected attacks. Many of these network links contain significant amounts of multimedia traffic which may seem to contribute to the problem, however our work suggests otherwise. This thesis proposes a novel method to classify and analyze multimedia traffic in an effort to maximize the efficiency of IDS. By embedding multimedia-specific knowledge into IDS, trusted multimedia contents can be identified and allowed to bypass the detection engine, thereby allowing IDS to focus its limited resources on other traffic. The proposed framework also enables IDS to detect multimedia-specific exploits which would otherwise pass under the radar. Results of our experiments confirm our claims and show substantial CPU savings in both streaming and non-streaming scenarios.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13242
Subject Headings: Computer networks--Security measures, Computers--Access control, Electronic countermeasures, Digital watermarking, Multimedia systems--Security measures
Format: Document (PDF)

Title: Intrusion detection in wireless networks: A data mining approach.
Creator: Nath, Shyam Varan., Florida Atlantic University, Khoshgoftaar, Taghi M., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The security of wireless networks has gained considerable importance due to the rapid proliferation of wireless communications. While computer network heuristics and rules are being used to control and monitor the security of Wireless Local Area Networks (WLANs), mining and learning behaviors of network users can provide a deeper level of security analysis. The objective and contribution of this thesis is three fold: exploring the security vulnerabilities of the IEEE 802.11 standard for...
Show moreThe security of wireless networks has gained considerable importance due to the rapid proliferation of wireless communications. While computer network heuristics and rules are being used to control and monitor the security of Wireless Local Area Networks (WLANs), mining and learning behaviors of network users can provide a deeper level of security analysis. The objective and contribution of this thesis is three fold: exploring the security vulnerabilities of the IEEE 802.11 standard for wireless networks; extracting features or metrics, from a security point of view, for modeling network traffic in a WLAN; and proposing a data mining-based approach to intrusion detection in WLANs. A clustering- and expert-based approach to intrusion detection in a wireless network is presented in this thesis. The case study data is obtained from a real-word WLAN and contains over one million records. Given the clusters of network traffic records, a distance-based heuristic measure is proposed for labeling clusters as either normal or intrusive. The empirical results demonstrate the promise of the proposed approach, laying the groundwork for a clustering-based framework for intrusion detection in computer networks.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13246
Subject Headings: Wireless communication systems, Data warehousing, Data mining, Telecommunication--Security measures, Computer networks--Security measures, Computer security
Format: Document (PDF)

Title: Elliptic curves: identity-based signing and quantum arithmetic.
Creator: Budhathoki, Parshuram, Steinwandt, Rainer, Eisenbarth, Thomas, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: Pairing-friendly curves and elliptic curves with a trapdoor for the discrete logarithm problem are versatile tools in the design of cryptographic protocols. We show that curves having both properties enable a deterministic identity-based signing with “short” signatures in the random oracle model. At PKC 2003, Choon and Cheon proposed an identity-based signature scheme along with a provable security reduction. We propose a modification of their scheme with several performance benefits. In...
Show morePairing-friendly curves and elliptic curves with a trapdoor for the discrete logarithm problem are versatile tools in the design of cryptographic protocols. We show that curves having both properties enable a deterministic identity-based signing with “short” signatures in the random oracle model. At PKC 2003, Choon and Cheon proposed an identity-based signature scheme along with a provable security reduction. We propose a modification of their scheme with several performance benefits. In addition to faster signing, for batch signing the signature size can be reduced, and if multiple signatures for the same identity need to be verified, the verification can be accelerated. Neither the signing nor the verification algorithm rely on the availability of a (pseudo)random generator, and we give a provable security reduction in the random oracle model to the (`-)Strong Diffie-Hellman problem. Implementing the group arithmetic is a cost-critical task when designing quantum circuits for Shor’s algorithm to solve the discrete logarithm problem. We introduce a tool for the automatic generation of addition circuits for ordinary binary elliptic curves, a prominent platform group for digital signatures. Our Python software generates circuit descriptions that, without increasing the number of qubits or T-depth, involve less than 39% of the number of T-gates in the best previous construction. The software also optimizes the (CNOT) depth for F2-linear operations by means of suitable graph colorings.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004182, http://purl.flvc.org/fau/fd/FA00004182
Subject Headings: Coding theory, Computer network protocols, Computer networks -- Security measures, Data encryption (Computer science), Mathematical physics, Number theory -- Data processing
Format: Document (PDF)

Title: Adaptive hierarchical weighted fair queuing scheduling in WiMAX networks.
Creator: AL-Ghanem, Waleed Khalid, Ilyas, Mohammad, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The growing demand for faster connection to the Internet service and wireless multimedia applications has motivated the development of broadband wireless access technologies in recent years. WiMAX has enabled convergence of mobile and fixed broadband networks through a common wide-area radio-access technology and flexible network architecture. Scheduling is a fundamental component in resource management in WiMAX networks and plays the main role in meeting QoS requirements such as delay,...
Show moreThe growing demand for faster connection to the Internet service and wireless multimedia applications has motivated the development of broadband wireless access technologies in recent years. WiMAX has enabled convergence of mobile and fixed broadband networks through a common wide-area radio-access technology and flexible network architecture. Scheduling is a fundamental component in resource management in WiMAX networks and plays the main role in meeting QoS requirements such as delay, throughput and packet loss for different classes of service. In this dissertation work, the performance of uplink schedulers at the fixed WiMAX MAC layer has been considered, we proposed an Adaptive Hierarchical Weighted Fair Queuing Scheduling algorithm, the new scheduling algorithm adapts to changes in traffic, at the same time; it is able to heuristically enhance the performance of WiMAX network under most circumstances. The heuristic nature of this scheduling algorithm enables the MAC layer to meet the QoS requirements of the users. The performance of this adaptive WiMAX Uplink algorithm has been evaluated by simulation using MATLAB. Results indicate that the algorithm is efficient in scheduling the Base Stations’ traffic loads, and improves QoS. The utilization of relay stations is studied and simulation results are compared with the case without using relay stations. The results show that the proposed scheduling algorithm improves Quality of Service of WiMAX system.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004178, http://purl.flvc.org/fau/fd/FA00004178
Subject Headings: Computer networks -- Technological innovations, Optical fiber communication, Wireless communication systems -- Technological innovations, Wireless metropolitan area networks -- Security measures
Format: Document (PDF)

Title: A Study on Partially Homomorphic Encryption Schemes.
Creator: Mithila, Shifat P., Karabina, Koray, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: High processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to...
Show moreHigh processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to allow one single multiplication as well as arbitrary number of additions on encrypted plaintexts. We provide MAGMA source codes for the implementation of the CGS scheme along with the boosted CGS scheme.
Show less
Date Issued: 2017
PURL: http://purl.flvc.org/fau/fd/FA00004840, http://purl.flvc.org/fau/fd/FA00004840
Subject Headings: Computer networks--Security measures., Computer security., Computers--Access control--Code words., Cyberinfrastructure., Computer network architectures., Cryptography., Number theory--Data processing.
Format: Document (PDF)

Computer networks--Security measures (11)	+ -
Computer security (6)	+ -
Data encryption (Computer science) (4)	+ -
Data mining (4)	+ -
Computer network protocols (3)	+ -

Computer networks -- Security measures (3)	+ -
Computer networks--Security measures. (3)	+ -
Computers--Access control (3)	+ -
Computer architecture (2)	+ -
Computer network architectures (2)	+ -
Computer security. (2)	+ -
Data structures (Computer science) (2)	+ -
Electronic countermeasures (2)	+ -
Expert systems (Computer science) (2)	+ -
Wireless communication systems (2)	+ -
Access control (1)	+ -
Adaptive signal processing (1)	+ -
Coding theory (1)	+ -
Computer architecture. (1)	+ -
Computer network architectures. (1)	+ -
Computer network protocols. (1)	+ -
Computer networks (Security measures) (1)	+ -
Computer networks -- Technological innovations (1)	+ -
Computer networks--Security measures--Automation (1)	+ -
Computer software--Development. (1)	+ -
Computers (1)	+ -
Computers--Access control--Code words. (1)	+ -
Cryptography. (1)	+ -
Cyberinfrastructure. (1)	+ -
Data protection. (1)	+ -

Florida Atlantic University (19)	+ -
College of Engineering and Computer Science (11)	+ -
Department of Computer and Electrical Engineering and Computer Science (11)	+ -
Khoshgoftaar, Taghi M. (7)	+ -
Charles E. Schmidt College of Science (3)	+ -

Department of Mathematical Sciences (3)	+ -
AL-Ghanem, Waleed Khalid (2)	+ -
Fernandez, Eduardo B. (2)	+ -
Mahgoub, Imad (2)	+ -
Pandya, Abhijit S. (2)	+ -
Wu, Jie (2)	+ -
Abushadi, Mohamed E. (1)	+ -
Alkazimi, Ali (1)	+ -
Anantvalee, Tiranuch. (1)	+ -
Baillargeon, Pierre Elliott. (1)	+ -
Budhathoki, Parshuram (1)	+ -
Eisenbarth, Thomas (1)	+ -
Gao, WeiZheng. (1)	+ -
Gopalakrishnan, Leelakrishnan (1)	+ -
Ibrahim, Nawal H. (1)	+ -
Ilyas, Mohammad (1)	+ -
Jain, Ankit. (1)	+ -
Karabina, Koray (1)	+ -
Kotlarchyk, Alex J. (1)	+ -
Kumar, Ajoy (1)	+ -
Lin, Hua. (1)	+ -
Marques, Oge (1)	+ -
Mithila, Shifat P. (1)	+ -
Najafabadi, Maryam Mousaarab (1)	+ -
Nath, Shyam Varan. (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Genre

Type of Resource

Language

Creator

Format

Owner