Semi-Trusted Mixer Based Privacy Preserving Distributed Data Mining for Resource Constrained Devices

In this paper a homomorphic privacy preserving association rule mining algorithm is proposed which can be deployed in resource constrained devices (RCD). Privacy preserved exchange of counts of itemsets among distributed mining sites is a vital part in association rule mining process. Existing cryptography based privacy preserving solutions consume lot of computation due to complex mathematical equations involved. Therefore less computation involved privacy solutions are extremely necessary to deploy mining applications in RCD. In this algorithm, a semi-trusted mixer is used to unify the counts of itemsets encrypted by all mining sites without revealing individual values. The proposed algorithm is built on with a well known communication efficient association rule mining algorithm named count distribution (CD). Security proofs along with performance analysis and comparison show the well acceptability and effectiveness of the proposed algorithm. Efficient and straightforward privacy model and satisfactory performance of the protocol promote itself among one of the initiatives in deploying data mining application in RCD.Comment: IEEE Publication format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947 5500, http://sites.google.com/site/ijcsis

Routing Protocol Based Shared and Session Key Exchange Protocol for Wireless Mobile Ad-hoc Network

Mobile Ad-hoc Network (MANET) is a transitory and infrastructureless network supported by no fixed trusted infrastructure. To achieve security goals like: authentication, integrity, non-repudiation, privacy, a secret key (or session key) is necessary to be shared between the sender and receiver. Because of the nature of MANET, it is unrealistic in many circumstances to implement Certification Authority (CA) concept. Some popular key exchange protocols also have some demerits in case of MANET which are due to mainly the requirement of high computational capability. In this key exchange protocol we propose an algorithm to exchange shared and session key between the sender and destination even during the route creation in various routing protocols

Delay and Power Efficient Voice Transmission over MANET

Increasing speed of hardware device and versatile functionalities of small equipments e.g. laptop, PDA etc. are introducing various voice oriented applications with mobility. Like other computer networks, in Mobile Ad-hoc Network (MANET) voice transmission is very much demanding and necessary. In this research paper we have a feasibility analysis of voice transmission over MANET. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. We have a comparative study among several audio codecs (G.711, G.729 and G.723.1) and by simulation we show that the G.729 codec is suitable to use for voice transmission over MANET in terms of latency. We show that it is possible to launch voice transmission with acceptable quality over MANET using G.729 and WEAC protocol

Delay and Power Efficient Voice Transmission over MANET

Increasing speed of hardware device and versatile functionalities of small equipments e.g. laptop, PDA etc. are introducing various voice oriented applications with mobility. Like other computer networks, in Mobile Ad-hoc Network (MANET) voice transmission is very much demanding and necessary. In this research paper we have a feasibility analysis of voice transmission over MANET. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. We have a comparative study among several audio codecs (G.711, G.729 and G.723.1) and by simulation we show that the G.729 codec is suitable to use for voice transmission over MANET in terms of latency. We show that it is possible to launch voice transmission with acceptable quality over MANET using G.729 and WEAC protocol

Delay and Power Efficient Voice Transmission over MANET

Increasing speed of hardware device and versatile functionalities of small equipments e.g. laptop, PDA etc. are introducing various voice oriented applications with mobility. Like other computer networks, in Mobile Ad-hoc Network (MANET) voice transmission is very much demanding and necessary. In this research paper we have a feasibility analysis of voice transmission over MANET. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. We have a comparative study among several audio codecs (G.711, G.729 and G.723.1) and by simulation we show that the G.729 codec is suitable to use for voice transmission over MANET in terms of latency. We show that it is possible to launch voice transmission with acceptable quality over MANET using G.729 and WEAC protocol

Voice transmission over ad hoc network adapting optimum approaches to maximize the performance

Although a lot of research and implementations have been performed for voice transmission over regular network and internet, a little is done for mobile ad hoc network (MANET). Like other computer networks, in MANET voice transmission is also very much demanding and necessary. Since the wireless links in an ad hoc network are highly error prone and may go down frequently because of node mobility, interference, channel fading, and the lack of infrastructure, it is very difficult and challenging to implement voice transmission over MANET. In this research, to maximize the performance of MANET during voice transmission we choose some parameters and methodological approaches e.g. Method of media access, selection of audio codec, selection of routing protocol etc in efficient and optimum way. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. During the selection process of routing protocol we have a performance comparison study between Improved DSR and WEAC, where WEAC performs better consuming less energy in case of larger network. We also have a comparative study among several audio codecs (G.711, G.729 and G.723.1) where by simulation we show that the G.729 codec is more suitable to use for voice transmission over MANET in terms of latency. Finally, we show that it is possible to launch voice transmission with acceptable quality and throughput over MANET using G.729 and WEAC protocol

Privacy Preserving Association Rule Mining in Ubiquitous Computing Environment

Resource Constrained Devices (RCD) in general construct the pervasive computing environment which are equipped with too limited resources to deploy privacy preserving data mining applications. This paper proposes a communication efficient and perturbation based privacy preserving association rule mining (ARM) algorithm for this ubiquitous computing environment. Existing cryptography based privacy preserving solutions are too heavy for RCDs. Communicational and computational optimization is another crucial issue for these kind of solutions too. The proposed algorithm is an integration of two major contributions (1) communication efficient ARM algorithm with enhanced large itemset computation technique and (2) perturbation and semi-trusted server based privacy preserving communication algorithm

Privacy Preserving Data Gathering in Wireless Sensor Network

Sensor devices provide sophisticated services in collecting data in various applications, some of which are privacy sensitive; others are ordinary. This chapter emphasizes the necessity and some mechanisms of privacy preserving data gathering techniques in wireless sensor network communication. It also introduces a new solution for privacy preserving data gathering in wireless sensor networks. By using perturbation technique in a semi-trusted server model, this new solution is capable of reducing a significant amount of computation in data collection process. In this technique, data of a sensor is perturbed into two components which are unified into two semi-trusted servers. Servers are assumed not to collude each other. Neither of them have possession of any individual data. Therefore, they cannot discover individual data. There are many real life applications in which the proposed model can be applied. Moreover, this chapter also shows a technique to collect grouped data from distributed sources keeping the privacy preserved. Security proofs show that any of the servers or any individual sensor neither can discover any individual data nor can associate any data to an individual sensor. Thus, the privacy of individual data is preserved