Debapriyay Mukhopadhyay

Symmetric key based authenticated querying in wireless sensor networks

Wireless Sensor Networks (WSNs) enabled with authenticated querying [1] allows only the authorized users to inject queries into the network and get responses thereof. Queries from unauthorized users are silently dropped. Providing authenticated querying for WSN is especially very challenging since the nodes are very much resource constrained and vulnerable to physical captures by the adversary. We present a fully symmetric key based solution for the above problem and analyze the same.

Location verification based defense against sybil attack in sensor networks

Security is a major concern for a large fraction of sensor network applications. Douceur first introduced the notion of sybil attack [4], where a single entity(node) illegitimately presents multiple identities. As the nodes in sensor networks can be physically captured by an adversary, sybil attack can manifest in a severe form leading to the malfunction of basic operational protocols including routing, resource allocation and misbehavior detection. In this study, we propose a location verification based defense against sybil attack for sensor network where we assume that the network is consisted of static sensor nodes. We report quantitatively about the probability of not being able to detect sybil attack. This probability is indicative of the usefulness of our proposed protocol.

Designing Reliable Architecture for Stateful Fault Tolerance

Performance and fault tolerance are two major issues that need to be addressed while designing highly available and reliable systems. The network topology or the notion of connectedness among the network nodes defines the system communication architecture and is an important design consideration for fault tolerant systems. A number of fault tolerant designs for specific multi-processor architecture exists in the literature, but none of them discriminates between stateless and stateful failover. In this paper, we propose a reliable network topology and a high availability framework which is tolerant up to a maximum of k node faults in a network and is designed specifically to meet the needs of stateful failover. Assuming the nodes in the network are capable of handling multiple processes, through our design we have been able to prove that in the event of k node failures the load can be uniformly distributed across the network - ensuring load balance. We also provide an useful characterization for the network, which under the proposed framework ensures one hop communication between the required nodes

A game based model of security for key predistribution schemes in wireless sensor network

Many random key predistribution schemes have been proposed for pairwise key establishment in sensor networks recently. A general model of security under which these key predistribution techniques can be formally analyzed for correctness is required. In this paper, we have made such an attempt. We use the well known computational model of probabilistic turn based 2

Security against Sybil Attack in Wireless Sensor Network through Location Verification

\frac{1}{2}

A distributed algorithm of fault recovery for stateful failover

-player games to model the key predistribution schemes and have shown how this model can be translated in formally specifying a property that these schemes should have. To the best of our knowledge this is the first work where we show the significance of probabilistic turn based 2

Model checking in practice: analysis of generic bootloader using SPIN

\frac{1}{2}

A New Threshold Certification Scheme Based Defense Against Sybil Attack for Sensor Networks

-player games in modelling security requirement of key predistribution schemes.

Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking

A new functional for planar triangulation called Inner Core has been proposed in [4] for a location verification based defense against Sybil attack for sensor network, and also has been shown that the legitimacy of a new node inside the Inner Core of a triangle obtained by the triangulation of the set of sensor nodes can be established. In [4] it has been conjectured that Inner Core of a triangulation of a set of planar points achieves its maximum for Delaunay triangulation. In this paper, we present a formal proof of the conjecture. In order for the protocol proposed in [4] to work, what is required is an empty triangle formed out of three existing sensor nodes in whose Inner Core new node claims its presence. We present here an algorithm to find out such an empty triangle, so that it can be used for checking the legitimacy of the new node.

Instance based learning framework for effective behavior profiling and anomaly intrusion detection

In [8], a high availability framework based on Harary graph as network topology has been proposed for stateful failover. Framework proposed therein exhibits an interesting property that an uniform load can be given to each non-faulty node while maintaining fault tolerance. A challenging problem in this context, which has not been addressed in [8] is to be able to come up with a distributed algorithm of automated fault recovery which can exploit the properties exhibited by the framework. In this work, we propose a distributed algorithm with low message and round complexity for automated fault recovery in case of stateful failover. We then prove the correctness of the algorithm using techniques from formal verification. The safety, liveness and the timeliness properties of the algorithm have been verified by the model checker SPIN.