Secret sharing schemes are the methods for sharing
secret data over a class of users. Shares are rando
mly
distributed to all users of the secret data. The se
cret data can be obtained only when all the shares
are
joined together. Visual cryptography (VC) or Visual
Secret sharing Scheme (VSSS) is one such method
which implements secret sharing for images. Biometr
ic characteristics provide a unique natural signatu
re
of a person and it is widely accepted. Each biometr
ic technique has its advantages and disadvantages V
SSS
and biometrics have been identified as the two most
important aspects of digital security. Based on th
is
study, a new method to analyze VSSS for biometric a
uthentication is given in this paper.
A NOVEL METHOD FOR THE CONSTRUCTION OF THRESHOLD MULTIPLE-SECRET VISUAL CRYPT...Editor IJCATR
The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n
meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images
except for all of images. The shared secret image can be revealed by printing the share images on transparencies and
stacking the transparencies directly, so that the human visual system can recognize the shared secret image without using any
devices. The visual secrets sharing scheme for multiple secrets is called multiple-secret visual cryptographic schemes
(MVCSs). This paper proposed general constructions for threshold multiple-secret visual cryptographic schemes (MVCSs)
that are capable of encoding s secret images. This presented MVCS schemes utilize a predefined pattern book with pixel
expansion to encrypt secret images into share images. In our research, we propose a novel MVCS scheme that can share two
binary secret images on two rectangular share images with no pixel expansion, but also has an excellent recovery quality for
the secret images.
"Randomized Visual Cryptography scheme for color images”iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Double layer security using visual cryptography and transform based steganogr...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Visual cryptography is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decrypted information ...
A CHAOTIC CONFUSION-DIFFUSION IMAGE ENCRYPTION BASED ON HENON MAPIJNSA Journal
This paper suggests chaotic confusion-diffusion image encryption based on the Henon map. The proposed chaotic confusion-diffusion image encryption utilizes image confusion and pixel diffusion in two levels. In the first level, the plainimage is scrambled by a modified Henon map for n rounds. In the second level, the scrambled image is diffused using Henon chaotic map. Comparison between the logistic map and modified Henon map is established to investigate the effectiveness of the suggested chaotic confusion-diffusion image encryption scheme. Experimental results showed that the suggested chaotic confusion-diffusion image encryption scheme can successfully encrypt/decrypt images using the same secret keys. Simulation results confirmed that the ciphered images have good entropy information and low correlation between coefficients. Besides the distribution of the gray values in the ciphered image has random-like behavior.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A NOVEL METHOD FOR THE CONSTRUCTION OF THRESHOLD MULTIPLE-SECRET VISUAL CRYPT...Editor IJCATR
The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n
meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images
except for all of images. The shared secret image can be revealed by printing the share images on transparencies and
stacking the transparencies directly, so that the human visual system can recognize the shared secret image without using any
devices. The visual secrets sharing scheme for multiple secrets is called multiple-secret visual cryptographic schemes
(MVCSs). This paper proposed general constructions for threshold multiple-secret visual cryptographic schemes (MVCSs)
that are capable of encoding s secret images. This presented MVCS schemes utilize a predefined pattern book with pixel
expansion to encrypt secret images into share images. In our research, we propose a novel MVCS scheme that can share two
binary secret images on two rectangular share images with no pixel expansion, but also has an excellent recovery quality for
the secret images.
"Randomized Visual Cryptography scheme for color images”iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Double layer security using visual cryptography and transform based steganogr...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Visual cryptography is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decrypted information ...
A CHAOTIC CONFUSION-DIFFUSION IMAGE ENCRYPTION BASED ON HENON MAPIJNSA Journal
This paper suggests chaotic confusion-diffusion image encryption based on the Henon map. The proposed chaotic confusion-diffusion image encryption utilizes image confusion and pixel diffusion in two levels. In the first level, the plainimage is scrambled by a modified Henon map for n rounds. In the second level, the scrambled image is diffused using Henon chaotic map. Comparison between the logistic map and modified Henon map is established to investigate the effectiveness of the suggested chaotic confusion-diffusion image encryption scheme. Experimental results showed that the suggested chaotic confusion-diffusion image encryption scheme can successfully encrypt/decrypt images using the same secret keys. Simulation results confirmed that the ciphered images have good entropy information and low correlation between coefficients. Besides the distribution of the gray values in the ciphered image has random-like behavior.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Secured data hiding by using extended visual cryptographyeSAT Journals
Abstract
Due to the rapid advancement of the internet large amount of data is transmitted over the internet. Some of the transmitted
information is very important like password, confidential file, security codes etc. so it is very important to provide security to
these data. In computer technology there are two ways to provide security to the data they are cryptography & steganography.
Although, in the past, there has been various research related to cryptography & steganography but neither of them provide
enough & strong security. So this paper proposes a novel approach for data hiding by combining steganography & extended
visual cryptography. Visual cryptography was invented by Moni Naor & Adi Shamir in 1994. Visual cryptography hide secret
image within one or more images & then generate shares. For share generation this paper uses Visual Information Pixel (VIP) &
error diffusion technique.
Keywords: Steganography, Visual Cryptography, Share Generation, VIP, Extended Visual cryptography,
Cryptography
Chaos Image Encryption using Pixel shuffling cscpconf
The advent of wireless communications, both inside and outside the home-office environment
has led to an increased demand for effective encryption systems. The beauty of encryption
technology comes out in more pronounced way when there is no absolute relation between
cipher and original data and it is possible to rebuild the original image in much easier way. As
chaotic systems are known to be more random and non-predictable, they can be made utilized in
achieving the encryption. The transposition technology of encryption systems requires scrambleness
behaviour in order to achieve the encryption of the data. This scrambleness behaviour can
be derived from the randomness property of chaos which can be better utilized in the techniques
like transposition system. In wireless communication systems, bandwidth utilization is an important
criterion. In order to use encryption system in wireless communication; key space plays an
important role for the efficient utilization of the bandwidth. In this paper we present a chaosbased
encryption algorithm for images. This algorithm is based on pixel scrambling where in the
randomness of the chaos is made utilized to scramble the position of the data. The position of the
data is scrambled in the order of randomness of the elements obtained from the chaotic map and
again rearranged back to their original position in decryption process. The same algoritm is
tested with two different maps and performance analysis is done to select best suited map for encription.
IMPACT OF ERROR FILTERS ON SHARES IN HALFTONE VISUAL CRYPTOGRAPHYcscpconf
Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns.
If the shares are xeroxed onto transparencies, the secret image can be visually decoded by
superimposing a qualified subset of transparencies, but no secret information can be obtained
from the superposition of a forbidden subset. The binary patterns of the shares, however, have
no visual meaning and hinder the objectives of visual cryptography. Halftone visual
cryptography encodes a secret binary image into n halftone shares (images) carrying significant
visual information. When secrecy is important factor rather than the quality of recovered image
the shares must be of better visual quality. Different filters such as Floyd-Steinberg, Jarvis,
Stuki, Burkes, Sierra, and Stevenson’s-Arce are used and their impact on visual quality of
shares is seen. The simulation shows that error filters used in error diffusion lays a great impact on the visual quality of the shares.
A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONSIJNSA Journal
In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.
A NEW VISUAL CRYPTOGRAPHY TECHNIQUE FOR COLOR IMAGESIJTET Journal
Abstract - Visual Cryptography (VC) is an emerging cryptography technology that uses the characteristics of human vision to
decrypt encrypted images. This cryptographic system encrypts it by dividing a secret image into n number of share and decryption
is done by superimposing a certain number of share (k) or more. The secret information can be retrieved by anyone only if the
person gets at least k number of share. No clue about a secret image is revealed if less than k-1 share are superimposed. The
Visual cryptography technique is not only applied for binary messages, grayscale images, but also for color images such as scenic
photos or pictures. Color visual cryptography (VC) is used to generate a color halftone image share by encrypting a color secret
image. In order to preserve the visual quality and size of the color share without expansion, the concept of size invariant Visual
Secret Sharing (VSS) scheme and error diffusion is introduced. Experimental result shows that the proposed method can improve
the reconstructed image quality compared with previous techniques. Also, it produces clearer and higher contrast for all kinds of
color images.
Symmetric Image Encryption Algorithm Using 3D Rossler System........................................................1
Vishnu G. Kamat and Madhu Sharma
Node Monitoring with Fellowship Model against Black Hole Attacks in MANET.................................... 14
Rutuja Shah, M.Tech (I.T.-Networking), Lakshmi Rani, M.Tech (I.T.-Networking) and S. Sumathy, AP [SG]
Load Balancing using Peers in an E-Learning Environment ...................................................................... 22
Maria Dominic and Sagayaraj Francis
E-Transparency and Information Sharing in the Public Sector ................................................................ 30
Edison Lubua (PhD)
A Survey of Frequent Subgraphs and Subtree Mining Methods ............................................................. 39
Hamed Dinari and Hassan Naderi
A Model for Implementation of IT Service Management in Zimbabwean State Universities ................ 58
Munyaradzi Zhou, Caroline Ruvinga, Samuel Musungwini and Tinashe Gwendolyn Zhou
Present a Way to Find Frequent Tree Patterns using Inverted Index ..................................................... 66
Saeid Tajedi and Hasan Naderi
An Approach for Customer Satisfaction: Evaluation and Validation ....................................................... 79
Amina El Kebbaj and A. Namir
Spam Detection in Twitter – A Review...................................................................................................... 92
C. Divya Gowri and Professor V. Mohanraj
A novel (k,n) secret sharing scheme fromIJNSA Journal
A new grayscale image encryption algorithm based on threshold secret sharing is proposed. The
scheme allows a secret image to be transformed into n shares, where any shares can be used to
reconstruct the secret image, while the knowledge of or fewer shares leaves no sufficient information
about the secret image and it becomes hard to decrypt the transmitted image. In the proposed scheme, the
pixels of the secret image are first permuted and then encrypted by using quadratic residues. In the final
stage, the encrypted image is shared into n shadow images using polynomials of Shamir scheme. The
proposed scheme is provably secure and the experimental results shows that the scheme performs well
while maintaining high levels of quality in the reconstructed image.
IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPSIJNSA Journal
In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps.
Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag ) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal –to noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
HYBRIDIZATION OF DCT BASED STEGANOGRAPHY AND RANDOM GRIDSIJNSA Journal
With the increasing popularity of information technology in communication network, security has become an inseparable but vital issue for providing for confidentiality, data security, entity authentication and data origin authentication. Steganography is the scheme of hiding data into a cover media to provide confidentiality and secrecy without risking suspicion of an intruder. Visual cryptography is a new technique which provides information security using simple algorithm unlike the complex, computationally intensive algorithms used in other techniques like traditional cryptography. This technique allows visual information to be encrypted in such a way that their decryption can be performed by the Human Visual System (HVS), without any complex cryptographic algorithms. To provide a better secured system that ensures high data capacity and information security, a multilevel security system can be thought for which can be built by incorporating the principles of steganography and visual cryptography.
Secured data hiding by using extended visual cryptographyeSAT Journals
Abstract
Due to the rapid advancement of the internet large amount of data is transmitted over the internet. Some of the transmitted
information is very important like password, confidential file, security codes etc. so it is very important to provide security to
these data. In computer technology there are two ways to provide security to the data they are cryptography & steganography.
Although, in the past, there has been various research related to cryptography & steganography but neither of them provide
enough & strong security. So this paper proposes a novel approach for data hiding by combining steganography & extended
visual cryptography. Visual cryptography was invented by Moni Naor & Adi Shamir in 1994. Visual cryptography hide secret
image within one or more images & then generate shares. For share generation this paper uses Visual Information Pixel (VIP) &
error diffusion technique.
Keywords: Steganography, Visual Cryptography, Share Generation, VIP, Extended Visual cryptography,
Cryptography
Chaos Image Encryption using Pixel shuffling cscpconf
The advent of wireless communications, both inside and outside the home-office environment
has led to an increased demand for effective encryption systems. The beauty of encryption
technology comes out in more pronounced way when there is no absolute relation between
cipher and original data and it is possible to rebuild the original image in much easier way. As
chaotic systems are known to be more random and non-predictable, they can be made utilized in
achieving the encryption. The transposition technology of encryption systems requires scrambleness
behaviour in order to achieve the encryption of the data. This scrambleness behaviour can
be derived from the randomness property of chaos which can be better utilized in the techniques
like transposition system. In wireless communication systems, bandwidth utilization is an important
criterion. In order to use encryption system in wireless communication; key space plays an
important role for the efficient utilization of the bandwidth. In this paper we present a chaosbased
encryption algorithm for images. This algorithm is based on pixel scrambling where in the
randomness of the chaos is made utilized to scramble the position of the data. The position of the
data is scrambled in the order of randomness of the elements obtained from the chaotic map and
again rearranged back to their original position in decryption process. The same algoritm is
tested with two different maps and performance analysis is done to select best suited map for encription.
IMPACT OF ERROR FILTERS ON SHARES IN HALFTONE VISUAL CRYPTOGRAPHYcscpconf
Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns.
If the shares are xeroxed onto transparencies, the secret image can be visually decoded by
superimposing a qualified subset of transparencies, but no secret information can be obtained
from the superposition of a forbidden subset. The binary patterns of the shares, however, have
no visual meaning and hinder the objectives of visual cryptography. Halftone visual
cryptography encodes a secret binary image into n halftone shares (images) carrying significant
visual information. When secrecy is important factor rather than the quality of recovered image
the shares must be of better visual quality. Different filters such as Floyd-Steinberg, Jarvis,
Stuki, Burkes, Sierra, and Stevenson’s-Arce are used and their impact on visual quality of
shares is seen. The simulation shows that error filters used in error diffusion lays a great impact on the visual quality of the shares.
A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONSIJNSA Journal
In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.
A NEW VISUAL CRYPTOGRAPHY TECHNIQUE FOR COLOR IMAGESIJTET Journal
Abstract - Visual Cryptography (VC) is an emerging cryptography technology that uses the characteristics of human vision to
decrypt encrypted images. This cryptographic system encrypts it by dividing a secret image into n number of share and decryption
is done by superimposing a certain number of share (k) or more. The secret information can be retrieved by anyone only if the
person gets at least k number of share. No clue about a secret image is revealed if less than k-1 share are superimposed. The
Visual cryptography technique is not only applied for binary messages, grayscale images, but also for color images such as scenic
photos or pictures. Color visual cryptography (VC) is used to generate a color halftone image share by encrypting a color secret
image. In order to preserve the visual quality and size of the color share without expansion, the concept of size invariant Visual
Secret Sharing (VSS) scheme and error diffusion is introduced. Experimental result shows that the proposed method can improve
the reconstructed image quality compared with previous techniques. Also, it produces clearer and higher contrast for all kinds of
color images.
Symmetric Image Encryption Algorithm Using 3D Rossler System........................................................1
Vishnu G. Kamat and Madhu Sharma
Node Monitoring with Fellowship Model against Black Hole Attacks in MANET.................................... 14
Rutuja Shah, M.Tech (I.T.-Networking), Lakshmi Rani, M.Tech (I.T.-Networking) and S. Sumathy, AP [SG]
Load Balancing using Peers in an E-Learning Environment ...................................................................... 22
Maria Dominic and Sagayaraj Francis
E-Transparency and Information Sharing in the Public Sector ................................................................ 30
Edison Lubua (PhD)
A Survey of Frequent Subgraphs and Subtree Mining Methods ............................................................. 39
Hamed Dinari and Hassan Naderi
A Model for Implementation of IT Service Management in Zimbabwean State Universities ................ 58
Munyaradzi Zhou, Caroline Ruvinga, Samuel Musungwini and Tinashe Gwendolyn Zhou
Present a Way to Find Frequent Tree Patterns using Inverted Index ..................................................... 66
Saeid Tajedi and Hasan Naderi
An Approach for Customer Satisfaction: Evaluation and Validation ....................................................... 79
Amina El Kebbaj and A. Namir
Spam Detection in Twitter – A Review...................................................................................................... 92
C. Divya Gowri and Professor V. Mohanraj
A novel (k,n) secret sharing scheme fromIJNSA Journal
A new grayscale image encryption algorithm based on threshold secret sharing is proposed. The
scheme allows a secret image to be transformed into n shares, where any shares can be used to
reconstruct the secret image, while the knowledge of or fewer shares leaves no sufficient information
about the secret image and it becomes hard to decrypt the transmitted image. In the proposed scheme, the
pixels of the secret image are first permuted and then encrypted by using quadratic residues. In the final
stage, the encrypted image is shared into n shadow images using polynomials of Shamir scheme. The
proposed scheme is provably secure and the experimental results shows that the scheme performs well
while maintaining high levels of quality in the reconstructed image.
IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPSIJNSA Journal
In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps.
Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag ) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal –to noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
HYBRIDIZATION OF DCT BASED STEGANOGRAPHY AND RANDOM GRIDSIJNSA Journal
With the increasing popularity of information technology in communication network, security has become an inseparable but vital issue for providing for confidentiality, data security, entity authentication and data origin authentication. Steganography is the scheme of hiding data into a cover media to provide confidentiality and secrecy without risking suspicion of an intruder. Visual cryptography is a new technique which provides information security using simple algorithm unlike the complex, computationally intensive algorithms used in other techniques like traditional cryptography. This technique allows visual information to be encrypted in such a way that their decryption can be performed by the Human Visual System (HVS), without any complex cryptographic algorithms. To provide a better secured system that ensures high data capacity and information security, a multilevel security system can be thought for which can be built by incorporating the principles of steganography and visual cryptography.
Steganography is the technique of hiding the fact that communication is taking place,by hiding data in other data. Many different carrier file formats such as image, audio, video, DNA etc can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in images, there exist a large variety of steganographic techniques. In this paper different steganographic techniques are described.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
A comparatively study on visual cryptographyeSAT Journals
Abstract The effective and secure protections of sensitive information are primary concerns in commercial, medical and military systems. To address the reliability problems for secret images, a visual cryptography scheme is a good alternative to remedy the vulnerabilities. Visual cryptography is a very secure and unique way to protect secrets. Visual cryptography is an encryption technique which is used to hide information which is present in an image. Unliketraditional cryptographic schemes, it uses human eyes to recover the secret without any complex decryption algorithms and the facilitate of computers. It is a secret sharing scheme which uses images distributed as shares such that, when the shares are superimposed, a hidden secret image is revealed.In this paper we represent various cryptography technique and research work done in this field. Keywords: Secret image sharing, cryptography, visual quality of image, pixel expansion
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Protecting the data in a safe and secure way which does not impede the access of an authorized authority is an immensely difficult and very interesting research problem. image cryptography is a special type of encryption technique to obscure image-based secret information which can be decrypted by Human Visual System. Communication is the process of transmitting information from source to destination. The exchanging information should not be stolen by unauthorized parties like hackers while sending or receiving via channel. To avoid this stealing of the information visual cryptography techniques are used. This paper proposes a novel method for key generation by using nearest prime pixels. Further 2’s complement and logical operations are performed to generate decrypted image. The final decrypted image is generated by representing pixels in matrix form and data is retrieved in column wise.
SLIC Superpixel Based Self Organizing Maps Algorithm for Segmentation of Micr...IJAAS Team
We can find the simultaneous monitoring of thousands of genes in parallel Microarray technology. As per these measurements, microarray technology have proven powerful in gene expression profiling for discovering new types of diseases and for predicting the type of a disease. Gridding, Intensity extraction, Enhancement and Segmentation are important steps in microarray image analysis. This paper gives simple linear iterative clustering (SLIC) based self organizing maps (SOM) algorithm for segmentation of microarray image. The clusters of pixels which share similar features are called Superpixels, thus they can be used as mid-level units to decrease the computational cost in many vision applications. The proposed algorithm utilizes superpixels as clustering objects instead of pixels. The qualitative and quantitative analysis shows that the proposed method produces better segmentation quality than k-means, fuzzy cmeans and self organizing maps clustering methods.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Copyright protection scheme based on visual Cryptography: A Reviewiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
Software architecture is the structural solution that achieves the overall technical and operational
requirements for software developments. Software engineers applied software architectures for their
software system developments; however, they worry the basic benchmarks in order to select software
architecture styles, possible components, integration methods (connectors) and the exact application of
each style.
The objective of this research work was a comparative analysis of software architecture styles by its
weakness and benefits in order to select by the programmer during their design time. Finally, in this study,
the researcher has been identified architectural styles, weakness, and Strength and application areas with
its component, connector and Interface for the selected architectural styles.
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
A design of a sales system for professional services requires a comprehensive understanding of the
dynamics of sale cycles and how key knowledge for completing sales is managed. This research describes
a design model of a business development (sales) system for professional service firms based on the Saudi
Arabian commercial market, which takes into account the new advances in technology while preserving
unique or cultural practices that are an important part of the Saudi Arabian commercial market. The
design model has combined a number of key technologies, such as cloud computing and mobility, as an
integral part of the proposed system. An adaptive development process has also been used in implementing
the proposed design model.
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict
functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the
role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy
relational inequality constraints is investigated. The feasible region is formed as the intersection of two
inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the
resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with
max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a
necessary and sufficient condition and three other necessary conditions are presented to conceptualize the
feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal
objective value. Also, it is proved that the optimal solution of the problem is always resulted from the
unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented
to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is
proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can
easily generate a feasible test problem and employ our algorithm to it.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that
open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility
of each sensor nodes are measured through the water atmosphere from the water flow for sensor based
protocol formations. Researchers have developed many routing protocols. However, those lost their charm
with the time. This can be the demand of the age to supply associate degree upon energy-efficient and
ascendable strong routing protocol for under water actuator networks. During this work, the authors tend
to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to
offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use
of total energy consumption and ensures packet transmission which redirects as an additional reliability in
compare to different routing protocols. In this work, the authors have used the level of forwarding node,
residual energy and distance from the forwarding node to the causing node as a proof in multicasting
technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a
wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned
protocol.
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
This research paper examined and re-evaluates the technological innovation, theory, structural dynamics
and evolution of Pill Camera(Capsule Endoscopy) technology in redirecting the response manner of small
bowel (intestine) examination in human. The Pill Camera (Endoscopy Capsule) is made up of sealed
biocompatible material to withstand acid, enzymes and other antibody chemicals in the stomach is a
technology that helps the medical practitioners especially the general physicians and the
gastroenterologists to examine and re-examine the intestine for possible bleeding or infection. Before the
advent of the Pill camera (Endoscopy Capsule) the colonoscopy was the local method used but research
showed that some parts (bowel) of the intestine can’t be reach by mere traditional method hence the need
for Pill Camera. Countless number of deaths from stomach disease such as polyps, inflammatory bowel
(Crohn”s diseases), Cancers, Ulcer, anaemia and tumours of small intestines which ordinary would have
been detected by sophisticated technology like Pill Camera has become norm in the developing nations.
Nevertheless, not only will this paper examine and re-evaluate the Pill Camera Innovation, theory,
Structural dynamics and evolution it unravelled and aimed to create awareness for both medical
practitioners and the public.
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding
obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike
most path finding algorithms which require destination co-ordinates to compute path, the proposed
algorithm comprises of a new method which finds path using backtracking without requiring destination
co-ordinates. Moreover, in existing path finding algorithm, the number of iterations required to find path is
large. Hence, to overcome this, an algorithm is proposed which reduces number of iterations required to
traverse the path. The proposed algorithm is hybrid of backtracking and a new technique(modified 8-
neighbor approach). The proposed algorithm can become essential part in location based, network, gaming
applications. grid traversal, navigation, gaming applications, mobile robot and Artificial Intelligence.
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor
class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers
work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve
all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better
way for the farmers to sell their products within the country with some mediocre knowledge about using
the website. This would provide information to the farmers about current market rate of agro-products,
their sale history and profits earned in a sale. This site will also help the farmers to know about the market
information and to view agricultural schemes of the Government provided to farmers.
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs.
Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity.
Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle
graphs and also for complete graphs.
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA)
Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to
explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA)
Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be
employed in finding the best solution of N Queens Problem and also, makes a comparison between these
four algorithms. It is entirely a review based work. The four algorithms were written as well as
implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better
than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and
the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the
Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute
Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more
time to provide result than the Proposed SA using GA.
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
In recent years, the complex event processing technology has been used to process the VANET’s temporal
and spatial event streams. However, we usually cannot get the accurate data because the device sensing
accuracy limitations of the system. We only can get the uncertain data from the complex and limited
environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they
are also uncertain. How effective to express and process these uncertain event streams has become the core
issue for the VANET system. To solve this problem, we propose a novel complex event query language
PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition
of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query
language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we
illustrate the validity of the PSTeCEQL by an example.
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies
are advancing and people uses these technologies in day to day activities, this data is termed as Big Data
having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose
frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by
traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets
but it has large communication cost which reduces execution efficiency. This proposed new pre-processed
k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets
from generated clusters using MapReduce programming model. Results shown that execution efficiency of
ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as
one of the pre-processing technique.
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
Software testing is a testing which conducted a test to provide information to client about the quality of the
product under test. Software testing can also provide an objective, independent view of the software to
allow the business to appreciate and understand the risks of software implementation. In this paper we
focused on two main software testing –mutation testing and mutation testing. Mutation testing is a
procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a
little change in a program. Such changes are applied to model low level defects that obtain in the process
of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process
of testing in which code is modified then mutated code is tested against test suites. The mutations used in
source code are planned to include in common programming errors. A good unit test typically detects the
program mutations and fails automatically. Mutation testing is used on many different platforms, including
Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover
new software bugs, or regressions, in existing functional and non-functional areas of a system after
changes such as enhancements, patches or configuration changes, have been made to them. When defects
are found during testing, the defect got fixed and that part of the software started working as needed. But
there may be a case that the defects that fixed have introduced or uncovered a different defect in the
software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus
of regression testing is to verify that changes in the software or program have not made any adverse side
effects and that the software still meets its need. Regression tests are done when there are any changes
made on software, because of modified functions.
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
Advances in micro fabrication and communication techniques have led to unimaginable proliferation of
WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational
energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a
potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and
‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax
through introduction of Static Variables. These approaches are general approaches which can be used in
any WSN irrespective of application.
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
Accurate and realistic estimation is always considered to be a great challenge in software industry.
Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining
the amount of estimation in the initial stages of the project depends on planning other activities of the
project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the
previous projects is essential to solve this problem. Several models have been developed for the analysis of
software projects. But the classical reference method is the COCOMO model, there are other methods
which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions
matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with
high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms
which can analyze data from multiple dimensions and identify the optimum solution between them are
analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for
SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been
assessed.The experimental results show that HS algorithm is a good way for determining the weight
similarity measures factors of software effort, and reducing the error of MRE.
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
Mining biological data is an emergent area at the intersection between bioinformatics and data mining
(DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining
(DDM) systems to address scalable mining over large scale distributed data. The nature of associations
between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to
develop new models and exploit and analyze the available distributed biological data sources. In this study,
we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative
Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such
globally strong association rules enhance understanding of protein composition and are desirable for
synthesis of artificial proteins. A real protein data bank is used to validate the system.
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:
Because the technology is used largely in the last decades; cybercrimes have become a significant
international issue as a result of the huge damage that it causes to the business and even to the ordinary
users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about
what a person who is related to computer science has to know about this new type of crimes. The paper has
three sections: Introduction to Digital Crime which gives fundamental information about digital crimes,
Digital Crime Investigation which presents different investigation models and the third section is about
Cybercrime Law.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
A new approach to analyze visual secret sharing schemes for biometric authentication a survey
1. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
A NEW APPROACH TO ANALYZE VISUAL SECRET
SHARING SCHEMES FOR BIOMETRIC
AUTHENTICATION-A SURVEY
Rajendra A B1 and Sheshadri H S2
1
Research student, PET Research Centre, E & C Department, Mandya, Karnataka, India,
Professor and Dean (PET Research) PES College of Engineering, Mandya, Karnataka,
India
2
ABSTRACT
Secret sharing schemes are the methods for sharing secret data over a class of users. Shares are randomly
distributed to all users of the secret data. The secret data can be obtained only when all the shares are
joined together. Visual cryptography (VC) or Visual Secret sharing Scheme (VSSS) is one such method
which implements secret sharing for images. Biometric characteristics provide a unique natural signature
of a person and it is widely accepted. Each biometric technique has its advantages and disadvantages VSSS
and biometrics have been identified as the two most important aspects of digital security. Based on this
study, a new method to analyze VSSS for biometric authentication is given in this paper.
KEYWORDS
Secret sharing scheme, Visual Cryptography (VC), Visual Secret Sharing Scheme (VSSS), Biometrics.
1. INTRODUCTION
Sensitive, individual, private information is being deposited and communicated using networks
every day and new threats and computer crimes are also increasing. Duplicating important
information will leads intruders to access it. On the other hand, having only one copy of this
information means that if this copy is destroyed there is no way to retrieve it. Thus, there is a
great need to handle information in a secure and reliable way. The idea of sharing a secret was
invented by Adi Shamir in 1979[1].
Secret information needs to be kept by a set of participants in such a way that only a qualified set
is able to reconstruct the secret. An example of such a scheme is a k-out-of-n threshold secret
sharing in which there are n participants holding their shares of the secret and every k (k ≤ n)
participants can collectively recreate the secret while any k-1 participants cannot get any
information about the secret. The needs for secret sharing arise if the storage system is not
reliable and secure [2]. Secret sharing is also useful if the owner of the secret does not trust any
single person. This concept was first applied to numbers, but in the 1994 researchers extended
this concept to images. Visual cryptography (VC) or Visual Secret sharing Scheme (VSSS) is one
such method which implements secret sharing for images [3].
The biometrics technology brings a new dimension to individual identity verification. .For
Biometrics, if it makes use of VSSS it will provide more security. This paper is organized as
follows. Section II introduces fundamentals of VSSS. Section III introduces the biometrics.
DOI:10.5121/ijfcst.2013.3605
53
2. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
Section IV shows the architecture of the proposed VSSS for biometric authentication .Finally,
conclusions are drawn in section V.
2. VISUAL SECRET SHARING SCHEMES
VSSS proposed by Naor and Shamir in 1994, is one of the cryptographic methods to share secret
images. The VSSS describes the way in which an image is encrypted and decrypted. There are
different types of VSSS.For example, there is the k-out-of-n scheme that says n shares will have
to be produced to encrypt an image, and k shares must be stacked to decrypt the image [4]. If the
number of shares stacked is less than k, the original image is not revealed. The other schemes are
2-out-of-n and n-out-of-n VSSS. In the 2-out of-n scheme n shares will be produced to encrypt an
image, and any two shares must be stacked to decrypt the image. In the n-out-of-n scheme, n
shares will be produced to encrypt an image, and n shares must be stacked to decrypt the image.
If the number of shares stacked is less than n, the original image is not revealed. Increasing the
number of shares or participants will automatically increase the level of security of the encrypted
message. In this section; 2-out of-2 scheme for black and white Image is analyzed with its model,
generation of shares and staking of shares.
3.1. The model
In visual Cryptography (VC), we have various schemes like k-out of-n, 2-out of-n & n-out of-n
VSSS. Let Y = {1, 2 . . . n} be a set of participants and let 2Y denote the collection of all subsets
of Y.
•
•
•
Let Qualified set Q ⊆ 2Y and Forbidden set F ⊆ 2Y, where Q ∩ F = θ (null set).
The access structure of the scheme is pair(Q,F).
Define M which consist of all minimal qualified sets:
M = {A ∈ Q: A`∉ Q for all A` ⊂ A}
The existing model for black-and-white visual cryptography schemes has been developed by
Naor and Shamir. In this model, both the original secret image and the share images contain only
black and white pixels. Each pixel in the original image is subdivided into a set of m black and
white subpixels in each of the n share images.
The set of subpixels can be represented by an n x m Boolean matrix S = [Sij], where
Sij = 1 ⇔ the jth subpixel in the ith share is black (S b)
Sij = 0 ⇔ the jthsub pixel in the ith share is white (S w)
To distinguish between black and white pixels in the recovered image, we define a fixed
threshold parameter d, where 1 ≤ d ≤ m. If H (V) ≥ d, then the subpixels are interpreted as black,
and if H(V) ≤ d – α .m,then the subpixels are interpreted as white, where H(V) is the Hamming
weight (the number of one’s) of the ‘or’ ed m-vector V. Where d is the threshold parameter for
the point at which black areas are distinct from white. The ‘m’ denotes the pixel expansion. This
represents the loss of resolution from the original image to the share image, which is to be as
small as possible. The parameter α > 0 is called the relative contrast difference of the scheme. It is
desirable to have a relative contrast difference as large as possible to minimize the loss of contrast
in the recovered image. The value α.m is the contrast, which is greater than or equal to 1 and
54
3. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
hence ensures that the black and white areas will be distinguishable [5]. The formal definition for
black-and-white visual cryptography schemes by Naor and Shamir is:
Definition 1.2: A solution to the k-out of-n visual cryptography scheme consists of two
collections of n x m Boolean matrices C w and C b.To share a white pixel, the dealer randomly
chooses one of the matrices in C w and to share a black pixel, the dealer randomly chooses one of
the matrices in C b. The chosen matrix defines the color of the m subpixels in each one of the n
transparencies.
The solution is considered valid if the following three conditions are fulfilled:
1. For any S∈ Cw, the OR m-vector V of any k of the n rows in S satisfies H (V) ≤ d – α .m.
2. For any S∈ Cb, the OR m-vector V of any k of the n rows in S satisfies H (V) ≥ d.
3. For any subset {r1, r2. . . rt}⊂ {1,2,. . .,n} with t < k, the two collections of t x m matrices
obtained by restricting each n x m matrices in Cw and Cb to rows r1, r2… r t, are
Indistinguishable in the sense that they contain the same matrices with the same frequencies.
For a visual cryptography scheme to be valid, these three conditions must be satisfied. The first
two conditions ensure that some contrast in the scheme is maintained, and the third condition
ensures that security in the scheme is maintained. The third condition states that no information
can be obtained if less than k shares are stacked together.
To encrypt a white pixel of the original image, a matrix is randomly chosen from Cw and is used
to create the shares. A black pixel is encrypted by randomly choosing a matrix from Cb. At least
two matrices in each collection are needed so that the dealer can randomly choose one of them. If
the matrix is chosen randomly, a cryptanalyst, examining less than k shares, will not be able to
predict the color of the pixel in the original secret image based on the pixel positions, since each
matrix in the collection is equally likely to have been chosen [6].
The important parameters of the existing system are:
• m, the number of subpixel in a share. The m should be as small as possible. The m is computed
using the equation:
m = 2 n-1
(1)
• α, the relative difference. This represents the loss in contrast. The α should be as large as
possible. The relative difference α is given by
α = | n b– n w | / m
(2)
Where, n b and n w are the number of the black subpixels which are generated from black and
white pixels from the original image, respectively.
• β, the contrast. The value β is to be as large as possible. The minimum contrast that is required
to ensure that the black and white areas will be distinguishable is β ≥ 1. The contrast β is given by
β = α.m
(3)
55
4. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
3.2 Generation of shares
In order to generate the shares in the 2-out-of-2 scheme we have the following mechanism:
Table 1. Pixel Pattern For 2-out-of-2 VC Scheme
Pixel
colour
Black
Black
White
White
Original
pixel
Share1
Share2
Decrypted pixels=
Share1+ Share2
An original black pixel is converted into two sub-pixels for two shares, shown in 1st row. After
stacking the two shares we will get a perfect black. Similarly we have other combination for two
sub-pixels generated shown in 2nd row. For original white pixel also we have two sub-pixels for
each of the two shares, but after stacking the shares we will not get exact white. We have a
combination of black and white sub-pixels. This results in the loss of the contrast. Considering the
following Fig. 1 we can generate the basis matrix:
Fig. 1. Basis Matrices Construction.
The basis matrices are given as:
S w=
Sb=
In general if we have Y= {1, 2} as set of number of participants, then for a creating the basis
matrices S w and S b we have to apply the odd and even cardinality concept of set theory.
For S w we will consider the even cardinality and we will get ES w= {Ө, {1, 2}} and for S b we
have the odd cardinality OS b= {{1}, {2}}. In order to encode the black and white pixels, we have
collection matrices which are given as:
C w = {Matrices obtained by performing permutation on the columns of
C b = {Matrices obtained by performing permutation on the columns of
}
}
So finally we have,
56
5. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
C w= {
Cb={
and
}
and
}
Now to share a white pixel, randomly select one of the matrices in C w, and to share a black pixel,
randomly select one of the matrices in C b. The first row of the chosen matrix is used for share 1
and the second for share 2.
3.3 Stacking of shares
(a) Original Secret Image
(b) Share1
(c) Share 2
Overlapping Share 1 & 2
(d) Retrieved Image (share1 +share2)
Fig.2. 2-out of -2 VC with 2 sub pixel layout
The Fig.2 shows 2-out of -2 VSSS with 2 sub pixel layout. Where original secret image(Fig.2a),
which is encoded in to two shares: share 1(Fig.2b) and share 2 (Fig.2c).The Fig. 2d is the result of
laying share 1 over share 2 in the ‘2 out of 2’ VSSS scheme.
Table 2.Comparison for major VSSS
Scheme
Moni Noar
&
Adi
Shamir[3]
2 out of 2
scheme
2 out of n
scheme
k out of n
scheme
Contrast
Clarity of the
decrypted image is
poor
Security
No information
can be revealed
from any of the
share alone
Applications
Encryption of writing
material(picture, text
etc)
57
6. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
A Avishek
& Bimol
Roy[4]
2 out of n
scheme
Smaller pixel
expansion for
contrast improving
No information
can be revealed
from any of the
share alone
Less memory space
required to implement
this scheme in a
computer
Thomas M
&
B Anto P [5]
2 out of 2
Scheme
2 out of n
Scheme
K out of n
scheme
Additional Basis
Matrix(ABM) is
used
for contrast
improvement
Recursive and
hybrid Approach
for information
security
Secure transmission of
fingerprint Images and
Tamperproof
preparation and
transmission of online
question papers
FengLiu &
Chuankun
[6]
2 out of 2
scheme
Reduces the noise
in the cover images
A secret image is
hidden into two
meaningful cover
images.
This scheme achieves
lossless recovery
without adding any
computational
complexity
4. BIOMETRIC TECHNIQUES
Biometric characteristics provide a unique natural signature of a person and it is widely accepted.
Each biometric technique has its advantages and disadvantages [7]. No single biometric can meet
the entire requirement (e.g. accuracy, cost, practicality, etc.)[8].A brief comparison of biometric
techniques based on different factors is provided in Table 3. [10].
Biometrics can operate in one of two modes: the identification mode, in which the identity of an
unknown user is determined, and the verification mode, in which a claimed identity is either
accepted or rejected. Using biometric characteristics in cryptography has significant advantages
over traditional cryptographic methods in the case of authentication. As an example, biometric
characteristics of an individual are difficult to lose, steal or forge. However, biometric systems are
vulnerable to attacks and break-ins by hackers. To address this issue, some methods are suggested
by researchers to provide the security, accuracy and integrity of biometric templates in a
biometric authentication system.
Table 3. Comparison of various biometric technologies
Biometrics
Face
Fingerprint
Hand
Geometry
Hand Vein
Iris
Retinal Scan
Signature
Voice Print
F. Thermograms
Universali
ty
High
Medium
Medium
Uniquene
ss
Low
High
Medium
Permanenc
e
Medium
High
Medium
Collectabilit
y
High
Medium
High
Performan
ce
Low
High
Medium
Acceptabilit
y
High
Medium
Medium
Circumventi
on
Low
High
Medium
Medium
High
High
Low
Medium
High
Medium
High
High
Low
Low
High
Medium
High
Medium
Low
Low
Low
Medium
Medium
Low
High
Medium
High
Medium
High
High
Low
Low
Medium
Medium
Low
Low
High
High
High
High
High
High
Low
Low
High
Although our approach is presented for biometric authentication security using for black and
white visual cryptography. Using gray scale and natural images such as the face and iris, and also
using more biometric samples with meaningful shares in an authentication security system can be
considered as a future work in this area[14].
58
7. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
5. ARCHITECTURE OF THE PROPOSED SYSTEM
The systems of our application have following objectives.
•
•
•
•
Encryption: Splitting the secret image into shares (cipher texts) using selected VSSS or
EVC (Enhanced visual Cryptography).
Transmission: Transmission of shares through different Channels.
Decryption: Stacking the shares to get the secret image (Plaintext).
Authentication: Checking the authenticity of authorized participant.
Fig.3 .Architecture of the proposed system
6. CONCLUSION
Even though considerable advancement has been made in security enhancement of Visual
Cryptography & biometrics over the past decade, the methods have their own drawbacks. By
using the Visual Cryptography for biometric authentication technique avoids data theft.
This is an overview about the application of secret sharing scheme .The method suggested is
widely applicable for information sharing and is more secured .Also it cover the intelligent
information management which is now being used in telemedicine.
REFERENCES
[1]
[2]
[3]
Adi Shamir (1979) “How to share a Secret”, Communications of the ACM, pp 612-613.
Marek R. Ogiela, Urszula Ogiela (2009), “Linguistic Cryptographic Threshold Schemes”,
International Journal of Future Generation Communication and Networking.Vol.2, No.1, March
2009.pp 33-40.
M. Naor and A. Shamir (1995) “Visual Cryptography”, Advances in Cryptology-Euro crypt ’94
Proceeding, LNCS vol. 950, Springer-Verlag, pp. 1-12.
59
8. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 3, No.6, November 2013
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
Adhikari Avishek and Bimol Roy (2007). “Applications of Partially Balanced Incomplete Block
Designs in Developing (2, n) Visual Cryptographic Schemes”. IEICE Transactions on Fundamentals
of Electronics, Communications and Computer Sciences Vol.E90-A No.5 pp.949-951
Thomas Monoth, Babu Anto P (2009), “Achieving optimal Contrast in Visual Cryptography schemes
without pixel expansion”. International Journal of Recent Trends in Engineering, Vol 1, No 1, May
2009, pp.468-471.
A B Rajendra & H S Sheshadri (2013), “Enhanced visual secret sharing for graphical password
authentication” Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP
2012), 876835, doi:10.1117/12.2010934
Seifedine Kadry,Aziz Barbar, (2009) “Design of Secure Mobile Communication using Fingerprint”,
European Journal of Scientific Research.Vol 30,No.1,pp.138-145
Thomas Monoth, Babu Anto P (2010), “Tamperproof Transmission of Fingerprints Using Visual
Cryptography Schemes”, Elsevier science direct, Procedia Computer Science 2, pp 143–148.
Rajendra Basavegowda & Sheshadri Seenappa (2013),” Electronic Medical Report Security Using
Visual Secret Sharing Scheme”, Proc. of the IEEE International Conference on Computer Modelling
and Simulation, Cambridge, UK, pp.78-83.
N.Radha and S.Karthikeyan (2010), “A study on biometric template security”, ICTACT journal of
soft computing, Issue 01, pp. 37-41.
Sudheesh K.V. Chandrasekhar M Patil(2012), “An Approach of Cryptographic Algorithm for
Estimating the Impact of Fingerprint for Biometric”, IEEE, pp 167-171, 2012
Thomas Monoth & Babu Anto P (2007), “Recursive Visual Cryptography Using Random Basis
Column Pixel Expansion”, Proc. of the IEEE International Conference on Information Technology
(ICIT ’07), pp. 41-43.
Nazanin Askari, Cecilia Moloney, Howard M. Heys, “Application of Visual Cryptography to
Biometric Authentication”.
Sonali Patil, Kapil Tajane, Janhavi Sirdeshpande (2013), “Secret Sharing Schemes for Secure
biometric authentication”, International Journal of a scientific & Engineering, Volume 4, Issue 6, pp.
2890- 2895.
Rajendra Ajjipura Basavegowda & Sheshadri Holalu Seenappa (2013),”Secret Code Authentication
Using Enhanced Visual Cryptography”,ICERECT -12,volume 248,pp 69-76.
Authors
Rajendra A B Studied BE in E&C (Kuvempu University), M.Tech in Computer
Network Engineering (VTU, Belgaum). He has 13 years of teaching experience at
VVCE since 2000 and actively perusing PhD course in the area of Visual Cryptography
under the guidance of Dr.H S Sheshadri.He is a life member of IE (India), IETE, ISTE,
CRSI. Attended in various national and International conferences and has presented
papers in various international conferences in India and abroad. Visited countries UK
and Singapore.
Dr. H.S. Sheshadri Obtained his B.E. from University of Mysore during 1979 in E& C
Engg, M.E (Applied Electronics) from Bharathiar University, Coimbatore during 1989
and Ph.D from Anna University Madras during 2008.He is serving this institution since
1982 and presently he is a professor in the Dept of Electronics &Communication Engg.
His field of interest is Medical Image processing and embedded systems. He has
published 12 papers in national journals and 21 papers in International journals. Also
guiding 6 research candidates for Ph.D programme under university of Mysore, Two
candidates under VTU, Belgaum. Has conducted several short term courses and
conferences and actively participate in the student and staff activities at the college.
He is a life member of IE (India), IETE, ISTE, SSI, and has participated in various national and
international conferences and seminars in India and abroad.
60