Engineering Commons^™

Mitigation Of Control Channel Jamming Under Node Capture Attacks, Patrick Tague, Mingyan Li, Radha Poovendran

Patrick Tague

Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users are not deterred by spread spectrum, as they know the required spreading sequences. For …

Routing In The Dark: Pitch Black, Nathan S. Evans

Electronic Theses and Dissertations

In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Friendto-friend “darknet” networks have been shown to commonly have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg proposed the first decentralized routing algorithm that achieves efficient routing in such small-world networks.

Herein this thesis we discuss the first independent security analysis of Clarke and Sandberg’s routing algorithm. We show that a relatively weak participating adversary can render …

Evaluating The Vulnerability Of Network Traffic Using Joint Security And Routing Analysis, Patrick Tague, David Slater, Jason Rogers, Radha Poovendran

Patrick Tague

Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the secure network. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming …

Generalized Neuron Based Secure Media Access Control Protocol For Wireless Sensor Networks, Raghavendra V. Kulkarni, Ganesh K. Venayagamoorthy, Abhishek V. Thakur, Sanjay Kumar Madria

Electrical and Computer Engineering Faculty Research & Creative Works

Security plays a pivotal role in most applications of wireless sensor networks. It is common to find inadequately secure networks confined only to controlled environments. The issue of security in wireless sensor networks is a hot research topic for over a decade. This paper presents a compact generalized neuron (GN) based medium access protocol that renders a CSMA/CD network secure against denial-of-service attacks launched by adversaries. The GN enhances the security by constantly monitoring multiple parameters that reflect the possibility that an attack is launched by an adversary. Particle swarm optimization, a popular bio-inspired evolutionary-like optimization algorithm is used for …

Security Vulnerability Of Id-Based Key Sharing Schemes, Jung Yeon Hwang, Taek-Young Youn, Willy Susilo

Faculty of Engineering and Information Sciences - Papers: Part A

Recently, several ID-based key sharing schemes have been proposed, where an initiation phase generates users' secret key associated with identities under the hardness of integer factorization. In this letter, we show that, unfortunately any key sharing scheme with this initiation phase is intrinsically insecure in the sense that the collusion of some users enables them to derive master private keys and hence, generating any user's secret key.

Beyond K-Anonymity: A Decision Theoretic Framework For Assessing Privacy Risk, Guy Lebanon, Monica Scannapieco, Mohamed Fouad, Elisa Bertino

Cyber Center Publications

An important issue any organization or individual has to face when managing data containing sensitive information, is the risk that can be incurred when releasing such data. Even though data may be sanitized before being released, it is still possible for an adversary to reconstruct the original data using additional information thus resulting in privacy violations. To date, however, a systematic approach to quantify such risks is not available. In this paper we develop a framework, based on statistical decision theory, that assesses the relationship between the disclosed data and the resulting privacy risk. We model the problem of deciding …

Secure Distributed Detection In Wireless Sensor Networks Via Encryption Of Sensor Decisions, Venkata Sriram Siddhardh Nadendla

LSU Master's Theses

We consider the problem of binary hypothesis testing using a distributed wireless sensor network. Identical binary quantizers are used on the sensor's observations and the outputs are encrypted using a probabilistic cipher. The third party (enemy) fusion centers are unaware of the presence of the probabilistic encipher. We find the optimal (minimum-probability-of-error) fusion rule for the ally (friendly) fusion center subject to a lower bound on the the probability of error for the third-party fusion centers. To obtain the minimum probability of error, we first prove the quasi-convexity of error probability with respect to the sensor's threshold for a given …

Novel Techniques In Iris Recognition, David Walker

UNLV Theses, Dissertations, Professional Papers, and Capstones

Using Daugman's algorithm and comparable alternatives, we find that we are able to identify an iris with as little as less than half of the iris information available, and an equal error rate comparable with that of popular biometrics like the fingerprint and face recognition biometrics. Different experiments were done based on percentage of iris shown, the resolution of the iris, and the position of the iris covered to determine if partial iris recognition is a viable biometric. It was found after over 500,000 different iris comparisons amongst five different experiments that regardless of the model used and the resolution, …