The problem of secure mining of association rules in horizontally partitioned databases. One of the main ingredients in our proposed protocol is a novel secure multi-party protocol for computing the union (or intersection) of private subsets that each of the interacting players hold. Another ingredient is a protocol that tests the inclusion of an element […]
EOLSR for defense against DOS attack in the network
In this paper we analyze the vulnerabilities of a pro-active routing protocol called optimized link state routing (OLSR) against a specific type of denial-of-service (DOS) attack called node isolation attack. Analyzing the attack, we propose a mechanism called enhanced OLSR (EOLSR) protocol which is a trust based technique to secure the OLSR nodes against the […]
DISTRIBUTED AND SELF-MANAGED ADDRESSING PROTOCOL FOR DYNAMIC AD HOC NETWORKS
We proposed a distributed and self-managed addressing protocol, called Filter-based Addressing protocol, which fits well for dynamic ad hoc networks with fading channels, frequent partitions, and joining/leaving nodes. Address assignment is a key challenge in ad hoc networks due to the lack of infrastructure. Autonomous addressing protocols require a distributed and self-managed mechanism to avoid […]
Optimal Client-Server Assignment for Internet Distributed Systems
We investigate an underlying mathematical model and algorithms for optimizing the performance of a class of distributed systems over the Internet. Such a system consists of a large number of clients who communicate with each other indirectly via a number of intermediate servers. Optimizing the overall performance of such a system then can be formulated […]