14790738
Threshold and identity-based key management and authentication for wireless ad hoc networks
As various applications of wireless ad hoc network have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we propose a distributed key management and authentication approach by deploying the recently developed concepts of identity-based cryptography and threshold secret sharing. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management service, which effectively solves the problem of single point of failure in the traditional public key infrastructure (PKI)-supported system. The identity-based cryptography mechanism is applied here not only to provide end-to-end authenticity and confidentiality, but also to save network bandwidth and computational power of wireless nodes.
43408451
Network Intrusion Detection System Using Random Projection Technique
26743853
Design and Analysis of a Class of Highly Scalable Hierarchical Networks: PdBCube
Abstract A class of hierarchical networks called the dBCube, that provides cost-effective and high-performance communication in large multicomputer systems, has recently been introduced. Such a compound graph of a hypercube and a de Bruijn (dB) graph utilizes every node of the hypercube as a gateway for intercluster communication. This paper presents a partially connected dBCube subclass (PdBCube), wherein the use of fewer nodes as gateways makes the PdBCube highly scalable in terms of both the hypercube and the dB size. This enhancement in scalability can be achieved by two different approaches to assigning gateways. Performance degradation of the proposed PdBCube is illustrated in terms of diameter and average distance. Improvement in track efficiency and reduction in cost are observed to be directly related to a decrease in the number of remote links.
15237323
Testing and Fault Tolerance of Multistage Interconnection Networks
Test length is independent of network size in this simple, straightforward methodology for testing MINs (multistage interconnection networks). It requires only four test sequences for single-fault diagnosis. 26 references.
22890668
Arithmetic Algorithms in a Negative Base
Algorithms are described for the basic arithmetic operations in a negative base. These algorithms are simpler, faster, and more general than those proposed by Sankar et al.
40094538
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-dimensional hypercube, the n-dimensional mesh, and the k-ary n-cube torus by identifying subdigraph characteristics that ensure acyclic routing. Further generalization which allows partial cyclic dependencies without deadlock is achieved by our extended generic methodology. We also illustrate how to identify shortest fixed path and nonminimal adaptive routing schemes using minimum required channels.
2759775
Distributed channel management in uncoordinated wireless environments
Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implementing coordination protocols, has often led to conflicting configurations (e.g., in choice of transmission power and channel of operation) among the corresponding Access Points (APs). Overall, such conflicts cause both unpredictable network performance and unfairness among clients of neighboring hotspots. In this paper, we focus on the fairness problem for uncoordinated deployments. We study this problem from the channel assignment perspective. Our solution is based on the notion of channel-hopping, and meets all the important design considerations for control methods in uncoordinated deployments - distributed in nature, minimal to zero coordination among APs belonging to different hotspots, simple to implement, and interoperable with existing standards. In particular, we propose a specific algorithm called MAXchop, which works efficiently when using only non-overlapping wireless channels, but is particularly effective in exploiting partially-overlapped channels that have been proposed in recent literature. We also evaluate how our channel assignment approach complements previously proposed carrier sensing techniques in providing further performance improvements. Through extensive simulations on real hotspot topologies and evaluation of a full implementation of this technique, we demonstrate the efficacy of these techniques for not only fairness, but also the aggregate throughput, metrics.We believe that this is the first work that brings into focus the fairness properties of channel hopping techniques and we hope that the insights from this research will be applied to other domains where a fair division of a system's resources is an important consideration.
11059176
Policy-based validation of SAN configuration
Historically, storage has been directly connected to servers for fast local access and easy configuration. In recent years, storage area networks (SANs) have defined an alternative storage paradigm that allows storage to be shared among servers using fast interconnects. One of the key challenges of SAN management is the large number of configuration problems that are encountered in a typical SAN deployment. These configuration problems can be addressed by SAN management software. However, hard-coding the SAN configuration rules into the management software is not a viable option since it is not possible to easily modify or replace old configuration rules and specify new policies and guidelines. In this paper, we propose a novel policy-based SAN configuration validation system that can be used to specify, store, and evaluate configuration policies for SANs. We also introduce five new operators for collection policies that are useful for evaluating a wide variety of practical SAN configuration policies found in practice. The policy-based SAN configuration checking approach proposed in this paper is discussed within the context of device interoperability constraints. However, this approach is extensible as it can also be used to enforce performance, reliability, and security-related configuration constraints.
9570200
Templates as Master Keys
We introduce two new attacks: the single-bit template attack and the template-enhanced DPA attack. The single-bit template attack can be used very effectively to classify even single bits in a single side channel sample with a high probability of correctness. The template-enhanced DPA attack, combines traditional DPA with single-bit template attacks to show that if an adversary has access to a test card with even a slightly biased RNG, then he/she can break protected cryptographic implementations on a target card even if they have perfect RNGs. In support of our claim, we report results from experiments on breaking two implementations of DES and AES protected by the masking countermeasure running on smartcards of different manufacturers. 
 
In light of these results, the threat of template attacks, generally viewed as intrinsically difficult to mount, needs to be reconsidered.
1271310
Policy ratification
It is not sufficient to merely check the syntax of new policies before they are deployed in a system; policies need to be analyzed for their interactions with each other and with their local environment. That is, policies need to go through a ratification process. We believe policy ratification becomes an essential part of system management as the number of policies in the system increases and as the system administration becomes more decentralized. In this paper, we focus on the basic tasks involved in policy ratification. To a large degree, these basic tasks can be performed independent of policy model and language and require little domain-specific knowledge. We present algorithms from constraint, linear, and logic programming disciplines to help perform ratification tasks. We provide an algorithm to efficiently assign priorities to the policies based on relative policy preferences indicated by policy administrators. Finally, with an example, we show how these algorithms have been integrated with our policy system to provide feedback to a policy administrator regarding potential interactions of policies with each other and with their deployment environment.
40935363
Beacon Signals: What, Why, How, and Where?
Beacons are primarily radio, ultrasonic, optical, laser or other types of signals that indicate the proximity or location of a device or its readiness to perform a task. Beacon signals also carry several critical, constantly changing parameters, such as power-supply information, relative address, location, timestamp, signal strength, available bandwidth resources, temperature and pressure. Although transparent to the user community, beacon signals have made wireless systems more intelligent and human-like. They are an integral part of numerous scientific and commercial applications, ranging from mobile networks to search-and-rescue operations and location-tracking systems. Beacon signals help synchronize, coordinate and manage electronic resources using miniscule bandwidth. Researchers continue to improve their functionality by increasing signal coverage while optimizing energy consumption. Beacon signals' imperceptibility and usefulness in minimizing communication delays and interference are spurring exploratory efforts in many domains, ranging from the home to outer space.