Earticle

Privacy is a pinnacle concern of the cloud database model known as “Database as a service (DaaS)”. DaaS is highly appreciated in business community because it saves hardware cost, cost of the technical people required to manage the database and it also saves the license cost of the database. Moreover, it offers reliable services and people can access their data 24 x 7 from anywhere provided the internet connection is available. Despite of all these advantages enterprises are reluctant to adopt DaaS, because of two types of threats that are associated with it. Firstly, it can be attacked by the hacker and secondly the privacy of data can be compromised by the administrators, managing the cloud database environment. In this paper we have focused on the second issue and proposed a model to protect privacy of data stored in cloud databases. As per proposed model we encrypt and obfuscate data on client side before sending to the cloud database. In addition we offer mechanism to query over encrypted and obfuscated data on server side. Once the required data is filtered on server side, it is transferred on client side where the de-obfuscation and decryption is performed. Experiment results are also highlighted showing the enhancement in performance due to obfuscation factor.

Given a list of n strings of length at most k, where l is length of the largest string. The object is to cover the strings by a minimal number of regular expressions r1, r2, r3………………..,rm for m≥1,such that a) Every string in the database satisfies at least one ri and b) Any string ‘X’ of length at most K satisfying r1+r2+r3+……………….+rm is at a distance at most p from a string ‘y’ in the database ,where ‘p’ is a prescribed constant parameter.We assume that the database is in the form of B+ tree. We start with leaf nodes and collection all the strings of maximum length in the database For identifying regular expressions in database the thesis aims at developing a procedure similar to that for Boolean formulas (in DNF or CNF), where the function values and don’t care term’s are specified.

FCM is one of a conventional clustering method and has been generally applied for medical image segmentation. On the other hand, conventional FCM at all times suffers from noise in the images. Even though the unique FCM algorithm yields good results for segmenting noise free images, it fails to segment images corrupted by noise, outliers and other imaging artifact. The most important shortcoming of standard FCM and FPCM algorithms are that the objective function does not think about the spatial dependence therefore it deal with image as the same as separate points. In order to decrease the noise effect during image segmentation, the proposed method incorporates spatial information into the FPCM cluster algorithm. The proposed algorithm is applied to both artificial synthesized image and real image. Segmentation results demonstrate that the presented algorithm performs more robust to noise than the standard FCM and FPCM algorithm.

In the present paper, we have been modeled parametrically and numerically the high speed of materials based electrooptic (EO) modulators in advanced optical communication systems. The modulated bandwidth is deeply and parametrically studied over wide ranges of the affecting sets of parameters via specially designed software which processes the interaction of causes and effects. The design parameters of the lumped circuit have been processed over large operating requirements. Lithium niobate (LiNbO3) external modulators can also offer pure phase modulation in coherent systems and can realize various optical signal processors. As the bit rate of optical network systems becomes higher, it becomes more difficult to drive a modulator with a high voltage. Therefore, reduction of the driving voltage of an LiNbO3 modulator with a broadband characteristic is an extremely important issue for realizing future high speed optical transmission systems. Moreover polymer electrooptic devices have been extensively studied and explored due to its intrinsic advantages over conventional materials such as high speed operation, compatibility with other materials and substrates.

This paper presents a group management system using Wireless Sensor Network (WSN) and smart phone devices. The proposed system was comprised of personal device based on sensor node of WSN, smart phone device which is used by group manager and web server. The sensor node called as personal device which is held by group members sends adata packet every 2 seconds to the manager device. The manager can check their group member’s distance from him within a 30-meter radius and battery residual quantity on the manager device. Manager device sends its latitude and longitude data from Global Positioning System(GPS) and information of personal devices to web server. Therefore, other person such as group member’s parents can assure their children’s safety and security through the web page. The (Received Signal Strength Indicator) RSSI value from sensor node was converted into distance data by computed log-normal path loss model.

Abstract. In 2003, Augot et al. introduced the Fast Syndrome-Based hash family (in short FSB), which follows the generic construction of Merkle-Damg°ard and is based on the syndrome decoding problem. In 2007, Finiasz et al. proposed an improved version of FSB. In this work, we propose a new efficient hash function, which incorporates the ideas of FSB and the sponge construction introduced by Bertoni et al. Our proposal is up to 30 % faster in practice than FSB. Its security is related on the Regular Syndrome (RSD) Decoding problem, which is proven NP-complete.

In this paper, we present an improved version of an identity-based identification scheme based on error-correcting codes. Our scheme combines the Courtois-Finiasz-Sendrier signature scheme using quasi-dyadic codes (QD-CFS) proposed in [2] and the identification scheme by Stern [18]. Following the construction proposed in [5], we obtain an identity-based identification scheme which has the advantage to reduce a public data size, the communication complexity and the signature length.

Powerful image editing tools are very common these days. By use of such tools, image tampering is also becoming common. It is becoming very common to remove or add some information on the images mostly for the purpose of some forgery. The focus of this paper is to detect “copy move” type of forgery. In this type of forgery, one portion of image is copied and pasted somewhere else in the same image. The motive of this type of image forgery is to hide some important features from the original image. As may be the case, in an criminal evidencing system or to show large crowd in a scene having sparse population etc. In this paper, we propose a method which is more efficient and reliable in comparison to previous methods. This method is good enough even for some manipulations/attacks like for scaling, rotation, Gaussian noise, smoothing and JPEG compression etc.

At the end of the useful life of a component, it becomes liable to being disposed by its owner or the servicing engineer of the system to which the component belongs. Although recycling agencies exist, not all components are currently recyclable. More so, some of those rated as eco-friendly may have been self-rated and user-verification of such claim may be difficult. One way to extending the useful life of a component is through the act of maintenance. In accordance with the age reduction model, component age is rejuvenated, implying age gained at each maintenance stage. Thus, the estimation of component extended life becomes possible; suggesting that component time to dispose can be delayed. Consequently, this reduces e-waste where the rate of concentration of greenhouse gases into the food chain and atmosphere is reduced.

The paper presents an alternative way of transmitting colored images in Short Message Service without Dependencies of EMS/MMS/EDGE/HSDPA and other high data rate 3 or 4G IP Technologies. Usually Short Message Service (SMS) contents are text based and limited to 140 bytes. In contrast, Extended Messaging Service (EMS) is an application level extension; have richer contents then SMS For Example. Predefined sounds, animation and images etc but having one major drawback that it is not widely supported than SMS. Enabling colored images (raster/vector) and animation features in SMS we develop an application using J2ME platform.

The internet has grown rapidly in recent years. This growth has increased the demand for techniques that can ensure information security. In this paper, we propose a text steganography technique that uses html documents as the cover medium to hide secret messages. The use of html documents has a benefit that the existence of a secret message will not be suspicious as html documents are fundamental elements of the web and are used very commonly on the internet. We have implemented our technique using C#.net technology. The technique proposed by us also integrates cryptography with steganography by first encrypting the secret message and then hiding the encrypted secret message in html cover medium. The integration of cryptography with steganography provides an extra layer of security that ensures the safe and secure delivery of message to the intended recipient.

In this paper we present the comprehensive survey on the clock synchronization algo-rithms, which should be considered for the measurements of the network delay. We catego-rize the clock synchronization algorithms into two basic types according to how they acquire synchronization between clocks, which are external source based schemes and end-to-end measurement based schemes. While external source based schemes are the synchronization methods using centralized time source such as NTP, GPS and IEEE 1588 to have global synchronization for all end hosts, end-to-end schemes obtain synchronization information through network measurements between end hosts. We briey introduces some algorithms in both categories. However, we have focused more on the end-to-end schemes which can be classied again into online and oine shemes according to whether they can be applied for real time operation. We survey the recent progresses on these end-to-end algorithms and special concerns are on the estimation of true the one-way delay without the eect of clock skew. The problems in depolying each end-to-end scheme are also described. The potential further research issues in online one-way delay estimation are discussed.