Aihab Khan

SMS Based Wireless Home Appliance Control System (HACS) for Automating Appliances and Security

This paper mainly focuses on the controlling of home appliances remotely and providing security when the user is away from the place. The system is SMS based and uses wireless technology to revolutionize the standards of living. This system provides ideal solution to the problems faced by home owners in daily life. The system is wireless t herefore more adaptable and cost-effective. The HACS system provides security against intrusion as well as automates various home appliances using SMS. The system uses GSM technology thus providing ubiquitous access to the system for security and automated appliance control.

Modified Watershed Algorithm for Segmentation of 2D Images

With the repaid advancement of computer technology, the use of computer-based technologies is increasing in different fields of life. Image segme ntation is an important problem in different fields of image processing and computer vision. Ima ge segmentation is the process of dividing images according to its characteristic e.g., color and objects present in the images. Different methods are presented for image segmentation. The focus of this study is the watershed segmentation. The tool used in this study is MATLAB. Good result of watershed segmentation entirely relay on the image contrast. Image contrast may be degraded during image acquisition. Watershed algorithm can generate over segmentation or under segmentation on badly contrast images. In order to reduce these deficiencies of watershed algorithm a preprocessing step using Random Walk method is performed on input images. Random Walk method is a probabilistic approach, which improves the image contrast in the way image is degraded.

Analysis of password login phishing based protocols for security improvements

Password is a key to secret authentication data and is most widely used for security purposes therefore it is open to attacks such as phishing attack. Phishing is a form of internet fraud, which phisher applies to steal online consumers personal identity data and financial account credentials. In this paper, we analyze a technique of password hashing, to compute secure passwords. Using this mechanism, we can obtain hash value by applying a cryptographic hash function to a string consisting of the submitted password and, usually, another value known as a salt. The salt value consists of current parameters of the system and prevents attackers from building a list of hash values for common passwords. MD5 and SHA1 are frequently used cryptographic hash functions. We implemented these algorithms and found that SHA-1 is more secure but slow in execution as SHA-1 includes more rounds than MD5 in calculating hashes.

Entropy Based Data Hiding in Binary Document Images

research paper has presented a data hiding technique for binary document images. Entropy measure method is used to minimize the perceptual distortion due to embedding. The watermark extraction is a blind system because neither the original image nor the watermark is required for extraction. The document image is similar to any other image. The proposed method discovers the specific regions where minimum distortion delay exists due to embedding. For embedding, the blocks that exist in the area of small font sizes are selected. Experimental results show that marked documents have excellent visual quality and less computational complexity.

Dynamic Blind Group Digital Signature Schemein E-Banking

which an individual can sign a document or messages on behalf of entire group. Here, a dynamic group blind signature scheme has been proposed, which is an extension of [L n R] and [B] Group Blind signature scheme. Proposed blind signature scheme has two separate authorities; an issuer, for issuing the membership certificate to group members and an opener, who can open the identity of a signatures originator in the case of a dispute. This scheme is based on the concept of PKI (public key infrastructure) environment and three key requirements i.e., Traceability, Anonymity and Non-Frameability. The problem of revocation of identity in group signatures has also solved in this paper. Before that many constructions have been proposed, however, a recurrent problem concerning with the revocation of group members, remained the same. Therefore, an efficient revocation algorithm is used to revoke the members and prevent frauds at the time of signing a document in future. Also the security of group keys is the major concern of this research.

Analysis and Design of Non Linear Snow 2.0 for Improved Security

In this paper, we propose a stream cipher; non-linear snow 2.0 by embedding non-linear function in dynamic feedback based modified snow 2.0 along with analysis of Guess and Determine (GD) Attack. The proposed non linear snow 2.0 uses two linear feedback shift registers (LFSR) in addition to the non-linear function to make the static nature of modified snow 2.0 dynamic. In non linear snow 2.0, the feed back change accepts values at dynamic tap positions rather than static so its structure is considered as dynamic and non linear. Experimental results show that proposed non-linear snow 2.0 has more resistance against guess and determine attack as compare to dynamic feedback based modified snow 2.0 without non-linear function and static feedback based modified snow 2.0. We conclude that for the encryption of plaintext non-linear snow 2.0 is more secure against guess and determine attack.

Quantitative Analysis of Non Repudiable Protocol for Remote Voting

With the phenomenal growth of internet and electronic transactions, security services, such as non repudiation, become crucial to many applications, e.g. electronic voting, electronic commerce, digital contract signing, and so on. The basic purpose of this research paper in to provide the quantitative analysis of a proposed non repudiable scheme in the published research paper named “Non Repudiation for Remote Voting”. Non-repudiation provides the proof of the casted vote and ensures the authenticity of voter using digital signatures. In remote voting system the use of digital signature scheme is relatively low due to the complexity and insecurity of existing digital signatures algorithms, therefore, for authentication, usually keys, tokens or IDs are used. The proposed scheme has introduced the simplified way of digital signature generation using simple built in functions. Also, the complexity of RSA key generation for the signatures has also been reduced. The quantitative analysis has been done by calculating the time and complexity level of different signature generation functions, which concluded that the approach of digital signatures functions is quite simple as compare to other lengthy techniques of digital signatures, as their execution time and complexity is less as compare to existing signature generation techniques.

Performance Evaluation of Encryption Techniques for Confidentiality of Very Large Databases

Many companies rely heavily on the functions of databases, hence database management and maintenance has become a vital component of their business models. There are many architectures, techniques, and tools available to ensure security. But to select the right solution for the right application is the most important issue of the time. This research is conducted with the objective to provide with the best encryption algorithms for confidentiality of very large databases. When different techniques were analyzed in terms of response time, memory usage and efficiency, 3DES (triple data encryption standard) performed better than advanced encryption standard (AES) and Blowfish. AES provides the highest security but to use it the organization would have to compromise on response time and resource usage. If the organization is short of resources and cannot spend much time in encrypting data though the confidentiality is not much required then 3DES provides the best solution. Blowfish holds the in between place. If neither the security is a maximum risk, nor the resources are a problem, then Blowfish should be preferred.

Mobile System Using Natural Language Annotations for Question Answering

The research in the domain of question answering systems is vast. Many web based question answering systems provide users with long size paragraphs in response to questions. In this research work we present a question answering system intended for mobile users using natural language annotations fulfilling their requirement of concise piece of information in response to queries. We describe a model of a system that accepts user queries in natural language after interpreting those queries match them with information stored in t-expression format and resulting entry is displayed to users thus helping them in getting the desired information without searching through the huge amount of information available on the web. The system returns only the exact piece of information in natural language for presentation to the users thus saving them from further web hits and searching through documents for their required information.