Earticle

This paper is devoted to accelerometer based image stabilization for general video based security surveillance systems. At the beginning an introduction to the image stabilization is presented. Short description of the actual state of common algorithms for image stabilization follows, including our solution with some partial optimizations. At the end, we present a suitable hardware platform having a built-in accelerometer, which is responsible for advanced stabilization of a video-stream.

Global connectivity provided praxis for data transactions. Data or information is available in different forms like text, image, audio, video etc. Security mechanisms are aimed at security algorithms with an assumption that the information is in bit stream. Human understanding in practice deals with information other than bit stream. In the transaction process of information, users allow human understandable format of data. A simple case of text data may deal with various types of scripts represented in multiple combinations of bit streams. Transformation of the basic characteristics that are embodied in the script is an interesting area to be explored in security models. Decipherment problems related to message equivocation is mainly dependent on the statistical complexity of script. The present work is aimed at analyzing the basic characteristics of a script in the form of frequency distribution of character code points. The proposed model is evaluated on Telugu script as a case study with a comparison on Latin text. The evaluation is limited to 8-bit and 16-bit key sizes.

The malware threat for mobile phones is expected to increase with the functionality enhancement of mobile phones. This threat is exacerbated with the surge in population of smart phones instilled with stable Internet access which provides attractive targets for malware developers. Prior research on malware protection has focused on avoiding the negative impact of the functionality limitations of mobile phones to keep the performance cost within the limitations of mobile phones. Being different, this paper investigates the positive impact of these limitations on suppressing the development of mobile malware. We study the state-of-the-art mobile malware, as well as the progress of academic research and industrial effort against mobile malware. Our study shows that the functionality limitations of mobile phones should be considered as advantages as they have significant impact on shrinking the living space of mobile malware. From this perspective, we propose and analyze three potential limitation-oriented techniques for effective malware detection and prevention on mobile phones.

This work aims at speaker recognition based upon a new set of features. Feature extraction is a crucial phase of the recognition process and a proper feature set dramatically influences the speaker recognition. Many well-known features are not suitable for the speaker recognition as those merge the specifics of the individual voices. Therefore, we need features accentuating the individual differences of our voices to be able to recognise speakers reliably. This work introduces new, speaker dependent features called Speaker Dependent Frequency Cepstrum Coefficients (SDFCC), created for the speaker recognition purposes only. Experimental results show their performance in comparison to the well-known features. According to the test results, the SDFCC are, for the speaker recognition, very useful and promising.

Generally, the goal of identification schemes is to provide security assurance against impersonation attacks. Identification schemes based on zero knowledge protocols have more advantages, for example, deniability, which enables the prover to deny an identification proof so that the verifier couldn’'t persuade others that it is indeed the prover who identified itself to him. This kind of identifications is called ‘'deniable identification’'. However, in some applications we require the existence of a (trusted) party being able to find out an evidence that a party did identify itself to a verifier is required, in order to prevent parties from misbehavior. So in this case ‘'undeniability’' is needed. To the best of our knowledge, an identification scheme that provides both deniability and undeniability does not exist in the literature. In this work we propose the notion of escrowed deniable identification schemes, which integrates both ‘'escrowed deniability’' (undeniability) and ‘'deniability’' properties. Intuitively, in the online communication, a verifier may sometimes need to provide an evidence of a conversation between himself and the prover, for instance, an evidence for the case of misuse of the prover’'s privilege. We then provide an escrowed deniable identification scheme, and prove its security, i.e. impersonation, deniability and escrowed deniability, in the standard model based on some standard number theoretic assumptions