You are on page 1of 3

www.brainbitz.

in

PH: 8606090523

SECURITY PROJECT ABSTRACTS

IEEE -2012/2013

www.brainbitz.in 1) Design of hierarchical visual cryptography

PH: 8606090523

This paper describes the concept of hierarchical visual cryptography. The key idea behind hierarchical visual cryptography is to encrypt the secret information in number of levels. As the number of levels in hierarchical visual cryptography increases, the secrecy of data tends to increase. An intelligent authentication system is also proposed using hierarchical visual cryptography. The shares generated out of Hierarchical visual cryptography are found to be random giving no information. The expansion ratio is also reduced to 1:2 from 1:4. 2) Java Cryptographic Library for Smartphones A JME-compliant cryptographic library for mobile application development is introduced in this paper. The library allows cryptographic protocols implementation over elliptic curves with different security levels and offers symmetric and asymmetric bilinear pairings operations, as Tate, Weil, and Ate pairings. 3) Secure multimedia objects management in medical information system Secure and efficient management of multimedia objects in medical information system have become a necessity in today's global environment. To strengthen the security level already present in the database management system and to avoid illegal access to comprehensive content of database including patient's information, we propose in this article a mechanism using the content-based watermarking technique. Information of patient and a digest are encrypted, before being embedded into LSB's bitplane of image associated to the patient. This image is directly integrated into the database. The edge map and invariant moments are used to check the integrity of the image.

4) Generating cryptography keys using self-organizing maps

This paper presents a method to generate cryptography keys instead of exchange them over a public communication channel. Session keys exchange is considered as a major problem to be resolved in a communication network. When two terminals exchange data through an unsecured public channel, they use cryptography techniques to prohibit a third terminal from intercepting exchanged data. Symmetriccryptography is largely used regarding to the short time needed to execute encryption and decryption compared to asymmetric cryptography. Since the channel is unsecure to data exchange, so it is unsecure to key exchange which should be secure and the key should be changed periodically to assure a high security. Instead of exchanging session keys, we suggest a simple and secure method of key generation in the transmitter and the receiver using self organizing maps. We suggest three methods to use self-organizing maps for secret key generation. The paper shows the ability of the SOM to generate

www.brainbitz.in

PH: 8606090523

secret keys by two ways: the fake-key and the key index. Also it shows the possibility to add a mask to improve the security of keys transmission. 5) Design of secure location and message sharing system for android platform

Present android-based location and message sharing system asks to input the personal information which fails to protect the privacy of information, has no centralized database which is causing the problem of data management and portability, and one main drawback is unable to have a secured two way communication between webserver and android based application. And this Android-based Location and Message Sharing System (ALMSS) is proposed for solving above mention problem. The proposed system uses Java programming language for android mobile user application, PHP programming language as webserver, MySQL as external database to store the data, JSON as intermediary between android platform and webserver and uses symmetric cryptography while communicating between android device and webserver which finally assures the protection of information. 6) A Framework for the Cryptographic Verification of Java-Like Programs We consider the problem of establishing cryptographic guarantees -- in particular, computational indistinguishability -- for Java or Java-like programs that use cryptography. For this purpose, we propose a general framework that enables existing program analysis tools that can check (standard) noninterference properties of Java programs to establish cryptographic security guarantees, even if the tools a priori cannot deal with cryptography. The approach that we take is new and combines techniques from program analysis and simulation-based security. Our framework is stated and proved for a Java-like language that comprises a rich fragment of Java. The general idea of our approach should, however, be applicable also to other practical programming languages. As a proof of concept, we use an automatic program analysis tool for checking non-interference properties of Java programs, namely the tool Joana, in order to establish computational indistinguishability for a Java program that involves clients sending encrypted messages over a network, controlled by an active adversary, to a server.

You might also like