Digital communication has seen exponential growth in the past decade.
Consequently, the security of digital data has become a field of extensive research since
piracy and unauthorized use of such data is prevalent because of the ease with which data
can be replicated or tampered. Visual Cryptography (VC) is a special cryptographic
technique where decryption is done by an authorized user by simply overlaying the shares.
Thus, there is no requirement for complex computations unlike normal cryptography.
Though simple for an authorized user, it is equally difficult for an unauthorized user to
attack since the secret message can be deciphered if and only if all the shares are available
to the attacker. The probability of this is negligibly small since one of the shares usually
needs to be registered with a Certified Authority (CA). The procedure is non- intrusive and
does not alter the contents of the host image or video. For this reason, VC has been applied
to image watermarking widely. In case of video watermarking applications, robustness
against different types of attacks like frame attacks, spatial and temporal desynchronization
attacks, statistical analysis and collusion attacks need to be considered. Also creation of
shares for videos requires feature extraction techniques which are different from that of
images. Moreover, as size of video is more, a large secret payload can be used to construct a
share. In this survey paper, the research being carried out globally on VC techniques for
videos, along with their pros and cons have been highlighted. The paper also discusses
challenges in applying VC for video watermarking. Further, a performance comparison
amongst the mentioned schemes is also provided.
This paper presents a spatial domain digital image watermarking technique. The technique embeds a binary watermark image into the cover image by inserting watermark pixels into homogeneous blocks with low variance. The watermark is first dispersed using a chaotic system before insertion. A secret multilevel image is used to extract the watermark. Experimental results show the watermark is resilient against various attacks like mean filtering, Gaussian filtering, median filtering, image rescaling, and JPEG compression. The watermark can be extracted with high correlation even after these attacks.
Ijri ece-01-01 joint data hiding and compression based on saliency and smvqIjripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
The document summarizes recent advances in digital image watermarking techniques. It discusses how watermarking techniques can be classified based on the domain of embedding (spatial or transform), robustness to attacks (fragile or robust), and need for cover data during extraction (blind or non-blind). Specifically, it describes spatial domain techniques like least significant bit insertion and transform domain techniques using discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. Transform techniques embed watermarks by modifying transform coefficients rather than pixel values.
A Review of BSS Based Digital Image Watermarking and Extraction MethodsIOSR Journals
This document provides a review of blind source separation (BSS) based digital image watermarking and extraction methods. It begins with an introduction to BSS and its application in digital image watermarking. It then surveys various digital image watermarking methods and BSS techniques used for watermark embedding and extraction. The document discusses the general watermarking framework including embedding, attacks, and detection. It also explores challenges in digital image watermarking such as capacity, robustness, and transparency. Finally, it concludes that further research can improve BSS-based watermarking methods to achieve high imperceptibility and robustness.
Comparative Study on Watermarking & Image Encryption for Secure CommunicationIJTET Journal
Over the past decades, research in security has concentrated on the development of algorithms and protocols for authentication, encryption and integrity of data. Despite tremendous advances, several security problems still afflict system’s. In this android app watermarking and encryption is being applied on images and data. Because of the human visual system’s low sensitivity to small changes and the high flexibility of digital media, anyone can easily make small changes in digital data with low perceptibility. Here watermarking and encryption are being performed in wavelet domain. Here in watermarking, the coefficients of watermarks are being embedded with the coefficients of the original image. Encryption is being done in wavelet domain so that the probability of an intruder trying to access the contents is very much minimized. Thus, this model provides a high level of security.
A Hybrid Digital Watermarking Approach Using Wavelets and LSB IJECEIAES
The present paper proposed a novel approach called Wavelet based Least Significant Bit Watermarking (WLSBWM) for high authentication, security and copyright protection. Alphabet Pattern (AP) approach is used to generate shuffled image in the first stage and Pell’s Cat Map (PCM) is used for providing more security and strong protection from attacks. PCM applied on each 5×5 sub images. A wavelet concept is used to reduce the dimensionality of the image until it equals to the size of the watermark image. Discrete Cosign Transform is applied in the first stage; later N level Discrete Wavelet Transform (DWT) is applied for reducing up to the size of the watermark image. The water mark image is inserted in LH Sub band of the wavelet image using LSB concept. Simulation results show that the proposed technique produces better PSNR and similarity measure. The experimental results indicate that the present approach is more reliable and secure efficient. The robustness of the proposed scheme is evaluated against various image-processing attacks.
This document summarizes a research paper that proposes a fragile watermarking technique for image authentication using a hierarchical mechanism. The technique embeds watermark data at both the pixel and block levels of an image. At the receiver end, tampered blocks can first be identified using block-level watermarks. Then pixel-level watermarks in untampered blocks are used to precisely locate any tampered pixels. The technique aims to accurately locate tampered regions even if a large area is modified, and also allows perfect restoration of the original watermarked image.
The document discusses visual cryptography and its applications. It introduces visual cryptography, which splits a secret image into shares/transparencies such that stacking a sufficient number reveals the secret but individual shares do not. It discusses extensions like (k,n) threshold schemes and cheating prevention. It outlines modules for an enhanced visual cryptography system using MATLAB: security/login, encoding images into shares, decoding by stacking shares, and verifying share integrity to prevent cheating. The goal is to extend algorithms to reduce pixel expansion and noise while keeping cover images in shares without degrading the hidden image quality.
This paper presents a spatial domain digital image watermarking technique. The technique embeds a binary watermark image into the cover image by inserting watermark pixels into homogeneous blocks with low variance. The watermark is first dispersed using a chaotic system before insertion. A secret multilevel image is used to extract the watermark. Experimental results show the watermark is resilient against various attacks like mean filtering, Gaussian filtering, median filtering, image rescaling, and JPEG compression. The watermark can be extracted with high correlation even after these attacks.
Ijri ece-01-01 joint data hiding and compression based on saliency and smvqIjripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
The document summarizes recent advances in digital image watermarking techniques. It discusses how watermarking techniques can be classified based on the domain of embedding (spatial or transform), robustness to attacks (fragile or robust), and need for cover data during extraction (blind or non-blind). Specifically, it describes spatial domain techniques like least significant bit insertion and transform domain techniques using discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. Transform techniques embed watermarks by modifying transform coefficients rather than pixel values.
A Review of BSS Based Digital Image Watermarking and Extraction MethodsIOSR Journals
This document provides a review of blind source separation (BSS) based digital image watermarking and extraction methods. It begins with an introduction to BSS and its application in digital image watermarking. It then surveys various digital image watermarking methods and BSS techniques used for watermark embedding and extraction. The document discusses the general watermarking framework including embedding, attacks, and detection. It also explores challenges in digital image watermarking such as capacity, robustness, and transparency. Finally, it concludes that further research can improve BSS-based watermarking methods to achieve high imperceptibility and robustness.
Comparative Study on Watermarking & Image Encryption for Secure CommunicationIJTET Journal
Over the past decades, research in security has concentrated on the development of algorithms and protocols for authentication, encryption and integrity of data. Despite tremendous advances, several security problems still afflict system’s. In this android app watermarking and encryption is being applied on images and data. Because of the human visual system’s low sensitivity to small changes and the high flexibility of digital media, anyone can easily make small changes in digital data with low perceptibility. Here watermarking and encryption are being performed in wavelet domain. Here in watermarking, the coefficients of watermarks are being embedded with the coefficients of the original image. Encryption is being done in wavelet domain so that the probability of an intruder trying to access the contents is very much minimized. Thus, this model provides a high level of security.
A Hybrid Digital Watermarking Approach Using Wavelets and LSB IJECEIAES
The present paper proposed a novel approach called Wavelet based Least Significant Bit Watermarking (WLSBWM) for high authentication, security and copyright protection. Alphabet Pattern (AP) approach is used to generate shuffled image in the first stage and Pell’s Cat Map (PCM) is used for providing more security and strong protection from attacks. PCM applied on each 5×5 sub images. A wavelet concept is used to reduce the dimensionality of the image until it equals to the size of the watermark image. Discrete Cosign Transform is applied in the first stage; later N level Discrete Wavelet Transform (DWT) is applied for reducing up to the size of the watermark image. The water mark image is inserted in LH Sub band of the wavelet image using LSB concept. Simulation results show that the proposed technique produces better PSNR and similarity measure. The experimental results indicate that the present approach is more reliable and secure efficient. The robustness of the proposed scheme is evaluated against various image-processing attacks.
This document summarizes a research paper that proposes a fragile watermarking technique for image authentication using a hierarchical mechanism. The technique embeds watermark data at both the pixel and block levels of an image. At the receiver end, tampered blocks can first be identified using block-level watermarks. Then pixel-level watermarks in untampered blocks are used to precisely locate any tampered pixels. The technique aims to accurately locate tampered regions even if a large area is modified, and also allows perfect restoration of the original watermarked image.
The document discusses visual cryptography and its applications. It introduces visual cryptography, which splits a secret image into shares/transparencies such that stacking a sufficient number reveals the secret but individual shares do not. It discusses extensions like (k,n) threshold schemes and cheating prevention. It outlines modules for an enhanced visual cryptography system using MATLAB: security/login, encoding images into shares, decoding by stacking shares, and verifying share integrity to prevent cheating. The goal is to extend algorithms to reduce pixel expansion and noise while keeping cover images in shares without degrading the hidden image quality.
Lsb hiding using random approach for image watermarkingeSAT Journals
Abstract A digital image watermarking is the process of embedding an image with a secondary parameter called watermark, without deterioration in the quality of image to provide copyright protection means to provide protection for intellectual property from illegal copying. In this paper the method of nested digital image watermarking is used that means a watermark inside another watermark embedded into the cover image that is the main image. Here the Randomized LSB hiding algorithm is used for embedding one image into another as it has lesser complexity and the approach is more robust to the variations in the type of image. The blowfish algorithm is used to encrypt the watermark image before embedding into the cover image. The concept of encryption of watermark image before get embedded into the main image is used here to increase the security of the watermark image. This is because the research work is mainly focus on to get the more secured watermark by improving and enhancing the embedding capacity. Key Words: Digital image Watermarking, Randomized LSB, Blowfish, Copyright Protection
This document discusses a randomized LSB hiding approach for nested digital image watermarking. It proposes encrypting one watermark image using Blowfish before embedding it into another watermark image using randomized LSB hiding. This nested watermark is then encrypted again using Blowfish before being embedded into the cover image for increased security. Randomized LSB hiding is used for embedding as it has lower complexity and is more robust than direct LSB hiding. The approach aims to improve security and embedding capacity for copyright protection of digital images.
This document discusses a new approach to providing secure data transmission that combines digital watermarking and image compression techniques. Digital watermarking involves embedding hidden information in multimedia content like images, audio or video. The proposed approach uses discrete cosine transform (DCT) based watermarking combined with an improved adaptive Huffman encoding image compression algorithm. This combined technique aims to enhance security for data transmission while reducing storage space requirements compared to other compression methods.
public truthfulness assessment for shared active cloud data storage with grou...Ijripublishers Ijri
The arrival of the cloud computing constructs cloud storage outsourcing turns out to be a mounting drift, which encourages the protected isolated data inspection an burning subject that materialize in the investigation writing. Newly a quantity of investigation regard as the trouble of protected and proficient public data truthfulness inspection for shared active data. Though, these methods are still not protected against the consent of cloud storage space server and invalidated group users through user invalidation in realistic cloud storage space method. Thus here in this paper, we Identify the conspiracy assault in the obtainable method and offer an well-organized public truthfulness inspection method with protected group user invalidation based on vector assurance and verifier-local invalidation group signature. We propose a tangible plan based on the our method explanation. Our method chains the public examination and well-organized user revocation and also some nice properties, such as confidently, efficiency, countability and traceability of secure group user invalidation. Finally, the security and experimental analysis show that,compared with its appropriate methods our scheme is also safe and well-organized.
IRJET- A Study on Image Authentication MethodsIRJET Journal
This document discusses and compares different methods for authenticating digital images, including cryptographic authentication, robust image hashing authentication, and watermarking authentication. Cryptographic authentication uses encryption and decryption but has limitations in localization. Robust image hashing is based on rotation-invariant moments but struggles with large area cropping. Watermarking authentication allows for embedding watermarks for identification and tamper detection but cannot precisely locate tampered regions. Overall, the document concludes that watermarking schemes constructed using chaotic maps provide better security compared to other methods due to chaotic maps' sensitivity to initial conditions.
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.
Jiri ece-01-03 adaptive temporal averaging and frame prediction based surveil...Ijripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
Optimized WES-System with Image Bit Embedding for Enhancing the Security of H...IRJET Journal
This document proposes an optimized security method for transmitting images over networks that combines watermarking, steganography, and embedding another image within the host image. The method works by first watermarking the host image in both its image and text form to obscure it. Then another image is embedded within the watermarked host image as a carrier, providing another layer of security. This combined output image is then transmitted to the receiver, who can extract both the original host image and watermark text using extraction techniques. The goal of this optimized approach is to provide stronger security and resistance to unauthorized access during transmission compared to prior individual techniques.
An Intelligent System for Secured Authentication using Hierarchical Visual Cr...IDES Editor
This paper introduces the idea of hierarchical visual
cryptography. Authentication is the important issue over the
internet. This paper describes a secured authentication
mechanism with the help of visual cryptography. Visual
cryptography simply divides secret information in to number
of parts called shares. These shares are further transmitted
over the network and at the receiving end secrets are revealed
by superimposition. Many layers of visual cryptography exist
in proposed system hence called hierarchical visual
cryptography. Remote voting systems now a day’s widely using
visual cryptography for authentication purpose.
This document summarizes a student project on reversible data hiding techniques. The project compares different reversible watermarking methods and proposes a new technique that embeds a secret bitstream into a color image using bisection and square root interpolation. Experimental results showed the embedded and extracted bitstreams had a correlation of 1, indicating no data loss. Future work could improve the algorithm security by using multiple color planes and transformations for watermarking.
ROBUST LOSSLESS WATERMARKING OF RELATIONAL DATABASES USING MULTIMEDIA DATA_An...anjuvipin
The document discusses robust lossless watermarking of relational databases using multimedia data. It provides background on existing database watermarking techniques and their limitations. The proposed methodology embeds watermarks in a relational database by modulating color image planes and histograms in a way that is robust to attacks while inducing minimal distortion. It creates hash functions to make watermarks independent of the database contents. Experimental results show the technique achieves 100% detection even when the database size increases 100% and is robust against subset insertion, deletion and alteration attacks, with low mean squared error and high peak signal to noise ratio. The watermarking can be extended to video frames.
Using SVD and DWT Based Steganography to Enhance the Security of Watermarked ...TELKOMNIKA JOURNAL
Watermarking is the process of embedding information into a carrier file for the protection of ownership/copyright of digital media, whilst steganography is the art of hiding information. This paper presents, a hybrid steganographic watermarking algorithm based on Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) transforms in order to enhance the security of digital fingerprint images. A facial watermark is embedded into fingerprint image using a method of singular value replacement. First, the DWT is used to decompose the fingerprint image from the spatial domain to the frequency domain and then the facial watermark is embedded in singular values (SV’s) obtained by application of SVD. In addition, the original fingerprint image is not required to extract the watermark. Experimental results provided demonstrate the methods robustness to image degradation and common signal processing attacks, such as histogram and filtering, noise addition, JPEG and JPEG2000 compression with various levels of quality.
IRJET-Security Based Data Transfer and Privacy Storage through Watermark Dete...IRJET Journal
Gowtham.T ,Pradeep Kumar.G " Security Based Data Transfer and Privacy Storage through Watermark Detection ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Digital watermarking has been proposed as a technology to ensure copyright protection by embedding an imperceptible, yet detectable signal in visual multimedia content such as images or video. In every field key aspect is the security Privacy is a critical issue when the data owners outsource data storage or processing to a third party computing service. Several attempts has been made for increasing the security related works and avoidance of data loss. Existing system had attain its solution up to its level where it can be further able to attain the parameter refinement. In this paper improvising factor been made on the successive compressive sensing reconstruction part and Peak Signal-to-Noise Ratio (PSNR).Another consideration factor is to increase (CS) rate through de-emphasize the effect of predictive variables that become uncorrelated with the measurement data which eliminates the need of (CS) reconstruction.
In wireless communications sensitive data is frequently changed, requiring remote authentication. Remote authentication involves the submission of encrypted data, along with visual and audio cues (facial images/videos, human voice etc.). Nonetheless, malicious program and different attacks will cause serious issues, particularly in cases of remote examinations or interviewing. This paper proposes a sturdy authentication mechanism supported semantic segmentation, chaotic cryptography and knowledge concealment. Assuming that user X needs to be remotely documented, initially X’s video object (VO) is mechanically segmental, employing a head and-body detector. Next, one amongst X’s biometric signals is encrypted by a chaotic cipher. Subsequently the encrypted signal is inserted to the most vital riffle coefficients of the VO, victimization its Qualified Significant riffle Trees (QSWTs). QSWTs give invisibility and vital resistance against loss transmission and compression, conditions that area unit typical in wireless networks. Finally, the Inverse distinct riffle rework (IDWT) is applied to supply the stegno-object (SO). Experimental results, regarding: (a) security deserves of the planned cryptography theme, (b) strength to stegno-analytic attacks, to numerous transmission losses and JPEG compression ratios and (c) information measure potency measures, indicate the promising performance of the planned biometrics-based authentication theme.
IEEE 2012 Projects,academic projects in .net,academic projects in java,b tech mini projects,btech projects,electrical projects for students,electronic engineering final year project,electronic engineering final year projects,electronic final year project,electronics students projects,embedded in chennai,embedded projects chennai,engineering final project,engineering final projects,engineering projects in chennai,engineering projects in java,final year embedded projects,final year engineering projects,final year engineering projects chennai,final year engineering projects in chennai,final year ieee projects chennai,final year it projects,final year project chennai,final year project in chennai,final year project in electronics,final year project of electronics,final year projects for it,final year projects for mca,final year projects in .net,final year projects in chennai,final year projects in electronics,final year projects in embedded systems,final year projects in it,final year projects on embedded systems,final year student project,final year student projects,ieee embedded projects,ieee projects,ieee projects chennai,ieee projects for mca,ieee projects in .net,ieee projects in chennai,ieee projects in java,ieee projects in vlsi,ieee projects on embedded systems,ieee projects titles,ieee students projects,mca academic projects,mca final project,mca final year project,mca final year project in chennai,mca projects,mca projects chennai,mca projects titles,project in vlsi,project of mca,projects for mca,projects in vlsi,student project chennai,student projects in java,vlsi in chennai,year projects,Real Time IEEE Projects,Live Projects,Embedded Live Projects,Power Electronics Projects,Power System Projects,ME Projects,M.Tech Projects,VLSI Final Year projects,Embedded final Year Projects,Real Time Embedded Projects,Real Time Software Projects,Live Java Projects,Dot net Projects in Chennai,.Net Projects,B.tech projects,BE Projects,Real Time Project MBA, Real Time Project BE,Project Work BE,Real Time Project MCA,Real Time Project BE Electronic,Computer Software Training Embedded Systems, Real Time Project,Computer Project Work,Real Time Project IT,Embedded Training,Real Time Project Me,Project Work Ieee Based,Real Time Project B Tech,Project Work MCA,Project Work Computer Science,Project Work M E,Engineering Project Consultants,Real Time Project MSC,Real Time Project M Tech,Real Time Project Bio Medical,Project Consultants For Electronic,Project Work B Tech,Real Time Project BE Electrical,Real Time Project Dot Net,Real Time Project BCA,Project Work M Phil,Real Time Project M Phil,Project Work Embedded System,Real Time Project Embedded System,Project Work M Tech,Project Engineering,Real Time Project Java,Real Time Project PHD,Project Work IT,Real Time Project Networking,Real Time Project BSc,Real Time Project Matlab,Computer Software Training Embedded Network,Project Work Java,Real Time Project Vlsi,Real Time Project Animation,Project Work HTML,Real
Survey Paper: Cryptography Is The Science Of Information SecurityCSCJournals
Cryptography in the past was used in keeping military information, diplomatic correspondence secure and in protecting the national security. However, the use was limited. Nowadays, the range of cryptography applications have been expanded a lot in the modern area after the development of communication means; cryptography is essentially required to ensure that data are protected against penetrations and to prevent espionage. Also, cryptography is a powerful mean in securing e-commerce. Cryptography is used to ensure that the contents of a message are confidentiality transmitted and would not be altered. Confidentiality means nobody can understand the received message except the one who has the decipher key, and data cannot be changed means the original information would not be changed or modified; this is done when the sender includes a cryptographic operation called a hash function in the original message. A hash function is a mathematical representation of the information, when any information arrives at its receiver; the receiver calculates the value of this hash function. If the receiver’s hash function value is equivalent to the sender’s, the integrity of the message is assured .
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
DNA Encryption Algorithms: Scope and Challenges in Symmetric Key CryptographyAM Publications
Data security is now a crucial issue now in our day to day life. The protection of personal identity, personal finances depend on the protection of important and irreplaceable information. Cryptography is the science of converting some readable information into something unreadable format, which are hard to decipher. In modern times, cryptography has adopted a new medium: human DNA. At a time when conventional cryptography has been losing strength to more advanced cryptanalysis, DNA cryptography has added more elements of confusion and diffusion. The use of DNA sequences to encrypt data has strengthened the existing classical encryption algorithms. Thus, DNA cryptography has added another dimension to conventional cryptography. In the present paper the authors have made a systematics study on DNA encryption algorithms and how it can be used along with standard classical encryption algorithms.
Survey: Elliptic Curve Cryptography using Scalar Multiplication AlgorithmsAM Publications
This document summarizes an article from the International Journal of Innovative Research in Advanced Engineering that discusses elliptic curve cryptography and scalar multiplication algorithms. It begins with an introduction to elliptic curve cryptography and some of its applications. It then provides mathematical background on elliptic curves and discusses elliptic curve digital signature algorithm, elliptic curve Diffie-Hellman, and elliptic curve integrated encryption scheme. The document focuses on various algorithms for elliptic curve scalar multiplication, including non-adjacent form representation, and compares their features to determine the most efficient algorithm.
This document provides an introduction to cryptography concepts including symmetric and asymmetric cryptography, block ciphers, stream ciphers, hash functions, digital signatures, and digital envelopes. It defines common terms and describes popular algorithms for each concept. Symmetric cryptography uses a shared key for encryption and decryption while asymmetric cryptography uses public/private key pairs. Block and stream ciphers are the main types of symmetric algorithms. Hash functions and digital signatures provide integrity and authentication. Digital envelopes allow confidential messages with signatures.
This document discusses cryptography and network security. Cryptography is defined as the science of protecting data by converting it into an unreadable format. The goals of cryptography are confidentiality, authentication, integrity, and non-repudiation. The document outlines common cryptographic techniques like encryption, decryption, hashes, and digital signatures. It also discusses security threats to network communication like interception, modification, and repudiation. The importance of network security is growing as more applications move to distributed models and operate over the internet.
Lsb hiding using random approach for image watermarkingeSAT Journals
Abstract A digital image watermarking is the process of embedding an image with a secondary parameter called watermark, without deterioration in the quality of image to provide copyright protection means to provide protection for intellectual property from illegal copying. In this paper the method of nested digital image watermarking is used that means a watermark inside another watermark embedded into the cover image that is the main image. Here the Randomized LSB hiding algorithm is used for embedding one image into another as it has lesser complexity and the approach is more robust to the variations in the type of image. The blowfish algorithm is used to encrypt the watermark image before embedding into the cover image. The concept of encryption of watermark image before get embedded into the main image is used here to increase the security of the watermark image. This is because the research work is mainly focus on to get the more secured watermark by improving and enhancing the embedding capacity. Key Words: Digital image Watermarking, Randomized LSB, Blowfish, Copyright Protection
This document discusses a randomized LSB hiding approach for nested digital image watermarking. It proposes encrypting one watermark image using Blowfish before embedding it into another watermark image using randomized LSB hiding. This nested watermark is then encrypted again using Blowfish before being embedded into the cover image for increased security. Randomized LSB hiding is used for embedding as it has lower complexity and is more robust than direct LSB hiding. The approach aims to improve security and embedding capacity for copyright protection of digital images.
This document discusses a new approach to providing secure data transmission that combines digital watermarking and image compression techniques. Digital watermarking involves embedding hidden information in multimedia content like images, audio or video. The proposed approach uses discrete cosine transform (DCT) based watermarking combined with an improved adaptive Huffman encoding image compression algorithm. This combined technique aims to enhance security for data transmission while reducing storage space requirements compared to other compression methods.
public truthfulness assessment for shared active cloud data storage with grou...Ijripublishers Ijri
The arrival of the cloud computing constructs cloud storage outsourcing turns out to be a mounting drift, which encourages the protected isolated data inspection an burning subject that materialize in the investigation writing. Newly a quantity of investigation regard as the trouble of protected and proficient public data truthfulness inspection for shared active data. Though, these methods are still not protected against the consent of cloud storage space server and invalidated group users through user invalidation in realistic cloud storage space method. Thus here in this paper, we Identify the conspiracy assault in the obtainable method and offer an well-organized public truthfulness inspection method with protected group user invalidation based on vector assurance and verifier-local invalidation group signature. We propose a tangible plan based on the our method explanation. Our method chains the public examination and well-organized user revocation and also some nice properties, such as confidently, efficiency, countability and traceability of secure group user invalidation. Finally, the security and experimental analysis show that,compared with its appropriate methods our scheme is also safe and well-organized.
IRJET- A Study on Image Authentication MethodsIRJET Journal
This document discusses and compares different methods for authenticating digital images, including cryptographic authentication, robust image hashing authentication, and watermarking authentication. Cryptographic authentication uses encryption and decryption but has limitations in localization. Robust image hashing is based on rotation-invariant moments but struggles with large area cropping. Watermarking authentication allows for embedding watermarks for identification and tamper detection but cannot precisely locate tampered regions. Overall, the document concludes that watermarking schemes constructed using chaotic maps provide better security compared to other methods due to chaotic maps' sensitivity to initial conditions.
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.
Jiri ece-01-03 adaptive temporal averaging and frame prediction based surveil...Ijripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
Optimized WES-System with Image Bit Embedding for Enhancing the Security of H...IRJET Journal
This document proposes an optimized security method for transmitting images over networks that combines watermarking, steganography, and embedding another image within the host image. The method works by first watermarking the host image in both its image and text form to obscure it. Then another image is embedded within the watermarked host image as a carrier, providing another layer of security. This combined output image is then transmitted to the receiver, who can extract both the original host image and watermark text using extraction techniques. The goal of this optimized approach is to provide stronger security and resistance to unauthorized access during transmission compared to prior individual techniques.
An Intelligent System for Secured Authentication using Hierarchical Visual Cr...IDES Editor
This paper introduces the idea of hierarchical visual
cryptography. Authentication is the important issue over the
internet. This paper describes a secured authentication
mechanism with the help of visual cryptography. Visual
cryptography simply divides secret information in to number
of parts called shares. These shares are further transmitted
over the network and at the receiving end secrets are revealed
by superimposition. Many layers of visual cryptography exist
in proposed system hence called hierarchical visual
cryptography. Remote voting systems now a day’s widely using
visual cryptography for authentication purpose.
This document summarizes a student project on reversible data hiding techniques. The project compares different reversible watermarking methods and proposes a new technique that embeds a secret bitstream into a color image using bisection and square root interpolation. Experimental results showed the embedded and extracted bitstreams had a correlation of 1, indicating no data loss. Future work could improve the algorithm security by using multiple color planes and transformations for watermarking.
ROBUST LOSSLESS WATERMARKING OF RELATIONAL DATABASES USING MULTIMEDIA DATA_An...anjuvipin
The document discusses robust lossless watermarking of relational databases using multimedia data. It provides background on existing database watermarking techniques and their limitations. The proposed methodology embeds watermarks in a relational database by modulating color image planes and histograms in a way that is robust to attacks while inducing minimal distortion. It creates hash functions to make watermarks independent of the database contents. Experimental results show the technique achieves 100% detection even when the database size increases 100% and is robust against subset insertion, deletion and alteration attacks, with low mean squared error and high peak signal to noise ratio. The watermarking can be extended to video frames.
Using SVD and DWT Based Steganography to Enhance the Security of Watermarked ...TELKOMNIKA JOURNAL
Watermarking is the process of embedding information into a carrier file for the protection of ownership/copyright of digital media, whilst steganography is the art of hiding information. This paper presents, a hybrid steganographic watermarking algorithm based on Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) transforms in order to enhance the security of digital fingerprint images. A facial watermark is embedded into fingerprint image using a method of singular value replacement. First, the DWT is used to decompose the fingerprint image from the spatial domain to the frequency domain and then the facial watermark is embedded in singular values (SV’s) obtained by application of SVD. In addition, the original fingerprint image is not required to extract the watermark. Experimental results provided demonstrate the methods robustness to image degradation and common signal processing attacks, such as histogram and filtering, noise addition, JPEG and JPEG2000 compression with various levels of quality.
IRJET-Security Based Data Transfer and Privacy Storage through Watermark Dete...IRJET Journal
Gowtham.T ,Pradeep Kumar.G " Security Based Data Transfer and Privacy Storage through Watermark Detection ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Digital watermarking has been proposed as a technology to ensure copyright protection by embedding an imperceptible, yet detectable signal in visual multimedia content such as images or video. In every field key aspect is the security Privacy is a critical issue when the data owners outsource data storage or processing to a third party computing service. Several attempts has been made for increasing the security related works and avoidance of data loss. Existing system had attain its solution up to its level where it can be further able to attain the parameter refinement. In this paper improvising factor been made on the successive compressive sensing reconstruction part and Peak Signal-to-Noise Ratio (PSNR).Another consideration factor is to increase (CS) rate through de-emphasize the effect of predictive variables that become uncorrelated with the measurement data which eliminates the need of (CS) reconstruction.
In wireless communications sensitive data is frequently changed, requiring remote authentication. Remote authentication involves the submission of encrypted data, along with visual and audio cues (facial images/videos, human voice etc.). Nonetheless, malicious program and different attacks will cause serious issues, particularly in cases of remote examinations or interviewing. This paper proposes a sturdy authentication mechanism supported semantic segmentation, chaotic cryptography and knowledge concealment. Assuming that user X needs to be remotely documented, initially X’s video object (VO) is mechanically segmental, employing a head and-body detector. Next, one amongst X’s biometric signals is encrypted by a chaotic cipher. Subsequently the encrypted signal is inserted to the most vital riffle coefficients of the VO, victimization its Qualified Significant riffle Trees (QSWTs). QSWTs give invisibility and vital resistance against loss transmission and compression, conditions that area unit typical in wireless networks. Finally, the Inverse distinct riffle rework (IDWT) is applied to supply the stegno-object (SO). Experimental results, regarding: (a) security deserves of the planned cryptography theme, (b) strength to stegno-analytic attacks, to numerous transmission losses and JPEG compression ratios and (c) information measure potency measures, indicate the promising performance of the planned biometrics-based authentication theme.
IEEE 2012 Projects,academic projects in .net,academic projects in java,b tech mini projects,btech projects,electrical projects for students,electronic engineering final year project,electronic engineering final year projects,electronic final year project,electronics students projects,embedded in chennai,embedded projects chennai,engineering final project,engineering final projects,engineering projects in chennai,engineering projects in java,final year embedded projects,final year engineering projects,final year engineering projects chennai,final year engineering projects in chennai,final year ieee projects chennai,final year it projects,final year project chennai,final year project in chennai,final year project in electronics,final year project of electronics,final year projects for it,final year projects for mca,final year projects in .net,final year projects in chennai,final year projects in electronics,final year projects in embedded systems,final year projects in it,final year projects on embedded systems,final year student project,final year student projects,ieee embedded projects,ieee projects,ieee projects chennai,ieee projects for mca,ieee projects in .net,ieee projects in chennai,ieee projects in java,ieee projects in vlsi,ieee projects on embedded systems,ieee projects titles,ieee students projects,mca academic projects,mca final project,mca final year project,mca final year project in chennai,mca projects,mca projects chennai,mca projects titles,project in vlsi,project of mca,projects for mca,projects in vlsi,student project chennai,student projects in java,vlsi in chennai,year projects,Real Time IEEE Projects,Live Projects,Embedded Live Projects,Power Electronics Projects,Power System Projects,ME Projects,M.Tech Projects,VLSI Final Year projects,Embedded final Year Projects,Real Time Embedded Projects,Real Time Software Projects,Live Java Projects,Dot net Projects in Chennai,.Net Projects,B.tech projects,BE Projects,Real Time Project MBA, Real Time Project BE,Project Work BE,Real Time Project MCA,Real Time Project BE Electronic,Computer Software Training Embedded Systems, Real Time Project,Computer Project Work,Real Time Project IT,Embedded Training,Real Time Project Me,Project Work Ieee Based,Real Time Project B Tech,Project Work MCA,Project Work Computer Science,Project Work M E,Engineering Project Consultants,Real Time Project MSC,Real Time Project M Tech,Real Time Project Bio Medical,Project Consultants For Electronic,Project Work B Tech,Real Time Project BE Electrical,Real Time Project Dot Net,Real Time Project BCA,Project Work M Phil,Real Time Project M Phil,Project Work Embedded System,Real Time Project Embedded System,Project Work M Tech,Project Engineering,Real Time Project Java,Real Time Project PHD,Project Work IT,Real Time Project Networking,Real Time Project BSc,Real Time Project Matlab,Computer Software Training Embedded Network,Project Work Java,Real Time Project Vlsi,Real Time Project Animation,Project Work HTML,Real
Survey Paper: Cryptography Is The Science Of Information SecurityCSCJournals
Cryptography in the past was used in keeping military information, diplomatic correspondence secure and in protecting the national security. However, the use was limited. Nowadays, the range of cryptography applications have been expanded a lot in the modern area after the development of communication means; cryptography is essentially required to ensure that data are protected against penetrations and to prevent espionage. Also, cryptography is a powerful mean in securing e-commerce. Cryptography is used to ensure that the contents of a message are confidentiality transmitted and would not be altered. Confidentiality means nobody can understand the received message except the one who has the decipher key, and data cannot be changed means the original information would not be changed or modified; this is done when the sender includes a cryptographic operation called a hash function in the original message. A hash function is a mathematical representation of the information, when any information arrives at its receiver; the receiver calculates the value of this hash function. If the receiver’s hash function value is equivalent to the sender’s, the integrity of the message is assured .
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
DNA Encryption Algorithms: Scope and Challenges in Symmetric Key CryptographyAM Publications
Data security is now a crucial issue now in our day to day life. The protection of personal identity, personal finances depend on the protection of important and irreplaceable information. Cryptography is the science of converting some readable information into something unreadable format, which are hard to decipher. In modern times, cryptography has adopted a new medium: human DNA. At a time when conventional cryptography has been losing strength to more advanced cryptanalysis, DNA cryptography has added more elements of confusion and diffusion. The use of DNA sequences to encrypt data has strengthened the existing classical encryption algorithms. Thus, DNA cryptography has added another dimension to conventional cryptography. In the present paper the authors have made a systematics study on DNA encryption algorithms and how it can be used along with standard classical encryption algorithms.
Survey: Elliptic Curve Cryptography using Scalar Multiplication AlgorithmsAM Publications
This document summarizes an article from the International Journal of Innovative Research in Advanced Engineering that discusses elliptic curve cryptography and scalar multiplication algorithms. It begins with an introduction to elliptic curve cryptography and some of its applications. It then provides mathematical background on elliptic curves and discusses elliptic curve digital signature algorithm, elliptic curve Diffie-Hellman, and elliptic curve integrated encryption scheme. The document focuses on various algorithms for elliptic curve scalar multiplication, including non-adjacent form representation, and compares their features to determine the most efficient algorithm.
This document provides an introduction to cryptography concepts including symmetric and asymmetric cryptography, block ciphers, stream ciphers, hash functions, digital signatures, and digital envelopes. It defines common terms and describes popular algorithms for each concept. Symmetric cryptography uses a shared key for encryption and decryption while asymmetric cryptography uses public/private key pairs. Block and stream ciphers are the main types of symmetric algorithms. Hash functions and digital signatures provide integrity and authentication. Digital envelopes allow confidential messages with signatures.
This document discusses cryptography and network security. Cryptography is defined as the science of protecting data by converting it into an unreadable format. The goals of cryptography are confidentiality, authentication, integrity, and non-repudiation. The document outlines common cryptographic techniques like encryption, decryption, hashes, and digital signatures. It also discusses security threats to network communication like interception, modification, and repudiation. The importance of network security is growing as more applications move to distributed models and operate over the internet.
IRJET- A Survey on Reversible Watermarking Techniques for Image SecurityIRJET Journal
This document summarizes and compares various reversible watermarking techniques for image security. It discusses how reversible watermarking allows a watermark to be fully extracted from an image while also restoring the original cover image. The document reviews early techniques that used modulo addition and later techniques that improved imperceptibility by compressing image bits. It categorizes reversible techniques into data compression, difference expansion, and histogram shifting methods. Comparisons of techniques are presented to improve understanding of advances in reversible watermarking for image security.
The proposed scheme embedded the watermark during the differential pulse code modulation process and extracted through decoding the entropy details. This technique utilize the moving picture expert groups standard (MPEG-2) in which discrete cosine transform coefficients are adjusted from selected instantaneous decoder refresh frames for watermarking purpose. The subsets of frames as candidate I-frames are chosen to achieve better perceptibility and robustness. A secret key based cryptographic technique is used to select the candidate frames. Three more keys are required to extract the watermark whereas one of the key is used to stop the extraction process and the remaining two are used to display the scrambled watermark. The toughness is evaluated by testing spatial and temporal synchronization attacks. High sturdiness is achieved against video specific attacks frequently occurs in the real world. Even a single frame can accommodate thousand of watermark bits which reflect that high watermark capacity can be obtained.
STAGE STAFFING SCHEME FOR COPYRIGHT PROTECTION IN MULTIMEDIAIJNSA Journal
Copyright protection has become a need in today’s world. To achieve a secure copyright protection we embedded some information in images and videos and that image or video is called copyright protected. The embedded information can’t be detected by human eye but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright protection, we have analyzed image processing techniques i.e. Spatial Domain (Least Significant Bit (LSB)), Transform Domain (Discrete Cosine Transform (DCT)), Discrete Wavelet Transform (DWT) and there are numerous algorithm for watermarking using them. After having a good understanding of the same we have proposed a novel algorithm named as Stage Staffing Algorithm that generates results with high effectiveness, additionally we can use self extracted-watermark technique to increase the security and automate the process of watermark image. The proposed algorithm provides protection in three stages. We have implemented the algorithm and results of the simulations are shown. The various factors affecting spatial domain watermarking are also discussed.
A Brief Survey on Robust Video Watermarking Techniquestheijes
This document provides a survey of robust video watermarking techniques. It begins with an abstract discussing digital watermarking and its role in copyright protection as the growth of multimedia on the internet has led to more copyright issues. The document then reviews various video watermarking methods and factors like robustness, security, and perceptual fidelity. It discusses approaches like spatial domain and transform domain watermarking techniques that use discrete cosine transform, fast Fourier transform, and discrete wavelet transform. The document also provides a table comparing different video watermarking methods from past literature and concludes that watermarking combined with other cryptographic techniques can provide effective copyright protection for video.
Extended Visual Cryptography Using WatermarkingShivam Singh
Basically watermarking is used as a secret information to share, which is added with strong encryption and decryption technique using visual cryptography
This document discusses a proposed technique for secure data transmission that combines digital image watermarking and image compression. It begins with background information on digital watermarking, including its classifications, requirements, general system, and techniques such as spatial domain and frequency domain methods. It then provides an overview of image compression, including its benefits, techniques such as lossless and lossy compression, and common compression methods. The proposed technique embeds a watermark into an image using discrete cosine transform (DCT) based watermarking in the frequency domain. It then applies lossy image compression to the watermarked image using an improved adaptive Huffman coding algorithm. The goal is to achieve higher security for data transmission by combining these two techniques compared to
An Overview on Research Trends, Challenges, Applications and Future.pdfPavan A C
Digital data including photographs, audio, and video are now readily available
because to the development of the Internet. The ease of access to multimedia raises concerns about ownership identification, authentication of content,
security, and copyright protection. Here, we talk about the idea of digital picture watermarking with an emphasis on the method utilized for embedding and
extracting the watermark from images. This paper also presents a complete
classification of digital watermarking along with its fundamental properties,
such as visual imperceptibility, resilience, capacity, and security. Additionally,
we have covered the most recent uses of digital watermarking in the fields of
healthcare, distance learning, electronic voting, and the military. The robustness is assessed by looking at how image processing assaults affect the content
that is signed and the recoverability of the watermark. The thorough survey
that is offered in this study, in the opinion of the authors, will aid brand-new
scholars in learning more about this area. Additionally, the comparative study
can spark suggestions for how to enhance the methods already outlined.
This document proposes a reversible non-blind video watermarking technique based on interlacing using 3-level discrete wavelet transform (DWT) and alpha blending. The technique selects frames from a video, decomposes them using 3-level DWT, and embeds the watermark into the low frequency sub-band of original frames using alpha blending. Additionally, the Arnold transform is used as an encryption method before embedding for added security. The results of this technique are then analyzed and compared to other techniques. The technique aims to address the issues of non-blind watermarking requiring the original data for extraction and double bandwidth requirements.
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.
IRJET- Securely Performing Operations on Images using PSNRIRJET Journal
The document summarizes a research paper that proposes a system for securely performing operations like scaling and cropping on encrypted images stored in the cloud. The system uses a 2Dcrypt technique based on Paillier cryptosystem and tiling scheme. It aims to improve efficiency by avoiding data duplication using Shamir secret sharing algorithm. The system generates tokens using a timestamp for authorization and allows cloud servers to perform operations on encrypted images securely for a specific time period. It addresses limitations of existing systems like high storage usage and lack of collusion resistance.
This document summarizes a research paper on embedding digital signatures in video for security purposes. It discusses how digital watermarking can be used to authenticate digital video content by inserting copyright information. The paper proposes a method that uses discrete wavelet transform to embed different parts of a watermark image into different video scenes. It describes the watermark embedding process, which involves extracting video frames, applying DWT, dividing the watermark into parts, and embedding parts into DWT coefficients. Experimental results show the watermarked frames are visually similar to originals and maintain adequate quality metrics. The method aims to provide robust video authentication against various attacks.
Enhancing Security of Multimodal Biometric Authentication System by Implement...IOSR Journals
Abstract : Conventional personal identification techniques for instance passwords, tokens, ID card and PIN
codes are prone to theft or forgery and thus biometrics isa solution thereto. Biometrics is the way of recognizing
and scrutinizing the physical traits of a person. Automated biometrics verification caters as a conducive and
legitimate method, but there must be an assurance to its cogency. Furthermore, in most of the cases unimodal
biometric recognition is not able to meet the performance requirements of the applications. According to recent
trends, recognition based on multimodal biometrics is emerging at a greater pace. Multimodal biometrics
unifies two or more biometric traits and thus the issues that emerge in unimodal recognition can be mitigated in
multimodal biometric systems. But with the rapid ontogenesis of information technology, even the biometric
data is not secure. Digital watermarking is one such technique that is implemented to secure the biometric data
from inadvertent or premeditated attacks.This paper propounds an approach that is projected in both the
directions of improving the performance of biometric identification system by going multimodal and, increasing
the security through watermarking. The biometric traits are initially transformed using Discrete Wavelet and
Discrete Cosine Transformation and then watermarked using Singular Value Decomposition. Scheme depiction
and presented outcomes justifies the effectiveness of the scheme.
Keywords: Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), Multimodal biometrics,
Singular Value Decomposition, Watermarking
Performance Comparison of Digital Image Watermarking Techniques: A SurveyEditor IJCATR
Digital watermarking is the processing of combined information into a digital signal. A watermark is a secondary image,
which is overlaid on the host image, and provides a means of protecting the image. In order to provide high quality watermarked
image, the watermarked image should be imperceptible. This paper presents different techniques of digital image watermarking based
on spatial & frequency domain, which shows that spatial domain technique provides security & successful recovery of watermark
image and higher PSNR value compared to frequency domain.
IRJET- Secure Cloud Data Using Attribute Based EncryptionIRJET Journal
This document proposes a system for secure cloud data storage using attribute-based encryption. It aims to address challenges of key management, defining and enforcing access policies based on data attributes, and enabling keyword search over encrypted data. The system uses multi-authority attribute-based access control (MA-ABAC) to reduce key management complexity for data owners and users. Patient medical records are encrypted and access is determined based on user attributes from professional and personal domains. Attribute-based encryption, proxy re-encryption, and uniquely combining techniques are used to achieve security, key management, user revocation and efficient searches of encrypted data on the cloud.
A Review of BSS Based Digital Image Watermarking and Extraction MethodsIOSR Journals
Abstract :The field of Signal Processing has witnessed the strong emergence of a new technique, the Blind Signal Processing (BSP) which is based on sound theoretical foundation. An offshoot of the BSP is known as Blind Source Separation (BSS). This digital signal processing techniques have a wide and varied potential applications. The term blind is indicative of the fact that both the source signal and the mixing procedures are unknown. One of the more interesting applications of BSS is in field of image data security/authentication where digital watermarking is proposed. Watermarking is a promising technique to help protect data security and intellectual property rights. The plethora digital image watermarking methods are surveyed and discussed here with their features and limitations. Thus literature survey is presented in two major categories-Digital image watermarking methods and BSS based techniques in digital image watermarking and extraction. Keywords – BSP, BSS, Mixing Coefficient, Digital Image Watermarking, Watermark Extraction.
A Survey on Features Combination for Image WatermarkingEditor IJMTER
As the internet users are increasing day by day it is easy to transfer digital data. By this new
problem of data piracy is increasing. For this different methods of watermarking are developed for
protecting the digital data like video, audio, image, etc. Out of these many researcher are working on
image watermarking field from last few decades. This paper focus on the image watermarking features
combination with various techniques which are broadly categorized into spatial and frequency domain.
Many features are studied with their different requirement and functionality. It has been observed that
most of the researcher combines many features for achieving the prior goal of the watermark that is to
embed watermark and extract from the carrier image in presence of different attack.
Innovative Low-Cost Perimeter Security Gadget With In-built Mechanism to Ensu...IJCNCJournal
The concept is to capture and preserve the intruder’s details in unattended mode. A camera is integrated with a processing unit and counter arrangement to ensure authenticity and non-repudiation of the captured images of the intruder before court of law. Ownership claim is justified concocting confidential data sharing of visual cryptography. Signal quality is retained and unauthorized tampering of secret data resisted. Entire procedure indulges: Message Digest M is generated using SHA-2 from the date and time stamp of the acquired image, two shares are generated from MAC address (K) of the network card and encryption is done using AES involving encoding using Hamming 1 – bit technique. The cover image is prepared in DCT domain to restrict JPEG compression. Sensitive data is embedded in restricted areas of DCT transformed image. Extraction of secret data verifies an intruder. The experimental results prove its efficacy over existing conventional system.
INNOVATIVE LOW-COST PERIMETER SECURITY GADGET WITH IN-BUILT MECHANISM TO ENSU...IJCNCJournal
The concept is to capture and preserve the intruder’s details in unattended mode. A camera is integrated
with a processing unit and counter arrangement to ensure authenticity and non-repudiation of the captured
images of the intruder before court of law. Ownership claim is justified concocting confidential data
sharing of visual cryptography. Signal quality is retained and unauthorized tampering of secret data
resisted. Entire procedure indulges: Message Digest M is generated using SHA-2 from the date and time
stamp of the acquired image, two shares are generated from MAC address (K) of the network card and
encryption is done using AES involving encoding using Hamming 1 – bit technique. The cover image is
prepared in DCT domain to restrict JPEG compression. Sensitive data is embedded in restricted areas of
DCT transformed image. Extraction of secret data verifies an intruder. The experimental results prove its
efficacy over existing conventional system.
This document summarizes a master's thesis on video watermarking. It discusses three watermarking methods that were designed and implemented for video sequences compressed with the H.264 standard. Two methods embed watermarks in the frequency domain by modifying transform coefficients, while the third embeds in the spatial domain. It also describes a generic watermarking framework to provide an interface for implementing specific methods. The document evaluates the proposed methods through simulation tests examining perceptibility, uniqueness, processing time, and robustness against various attacks like recompression, scaling, and collusion. It finds the spatial domain method is preferred due to better robustness and perceptibility.
Similar to An Overview of Visual Cryptography based Video Watermarking Schemes: Techniques and Performance Comparison (20)
This document summarizes a research paper that proposes using an artificial neural network tuned by a simulated annealing algorithm for real-time credit card fraud detection. The paper describes how simulated annealing can be used to train the weights of a neural network model to classify credit card transactions as fraudulent or non-fraudulent based on attributes of past transactions. The algorithm is tested on a real-world credit card transaction dataset and is found to effectively classify most transactions correctly, though some misclassifications still occur.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
This document provides an overview of vertical handover decision strategies in heterogeneous wireless networks. It begins with an introduction to always best connectivity requirements in next generation networks that allow users to move between different network technologies. It then discusses the key aspects of handover management, including the three phases of initiation, decision, and execution. Various criteria for the handover decision process are described, such as received signal strength, network connection time, available bandwidth, power consumption, cost, security, and user preferences. Different types of handover decision strategies are categorized, including those based on network conditions, user preferences, multiple attributes, fuzzy logic/neural networks, and context awareness. The strategies are analyzed and their advantages/disadvantages compared.
This paper presents the design and performance comparison of a two stage
operational amplifier topology using CMOS and BiCMOS technology. This conventional op
amp circuit was designed by using RF model of BSIM3V3 in 0.6 μm CMOS technology and
0.35 μm BiCMOS technology. Both the op amp circuits were designed and simulated,
analyzed and performance parameters are compared. The performance parameters such as
gain, phase margin, CMRR, PSRR, power consumption etc achieved are compared. Finally,
we conclude the suitability of CMOS technology over BiCMOS technology for low power
RF design.
In Cognitive Radio Networks (CRN), Cooperative Spectrum Sensing (CSS) is
used to improve performance of spectrum sensing techniques used for detection of licensed
(Primary) user’s signal. In CSS, the spectrum sensing information from multiple unlicensed
(Secondary) users are combined to take final decision about presence of primary signal. The
mixing techniques used to generate final decision about presence of PU’s signal are also
called as Fusion techniques / rules. The fusion techniques are further classified as data
fusion and decision fusion techniques. In data fusion technique all the secondary users
(SUs) share their raw information of spectrum detection like detected energy or other
statistical information, while in decision fusion technique all the SUs take their local
decisions and share the decision by sending ‘0’ or ‘1’ corresponding to absence and presence
of PU’s signal respectively. The rules used in decision fusion techniques are OR rule, AND
rule and K-out-of-N rule. The CSS is further classified as distributed CSS and centralized
CSS. In distributed CSS all the SUs share the spectrum detection information with each
other and by mixing the shared information; all the SUs take final decision individually. In
centralized CSS all the SUs send their detected information to a secondary base station /
central unit which combines the shared information and takes final decision. The secondary
base station shares the final decision with all the SUs in the CRN. This paper covers
overview of information fusion methods used for CSS and analysis of decision fusion rules
with simulation results.
This paper analyzes the impact of network scalability on various physical attributes of Zigbee networks. Simulations were conducted using Qualnet to evaluate the performance of the Zigbee physical layer based on energy consumption and throughput. Energy consumption was analyzed for different modulation schemes (ASK, BPSK, OQPSK), network sizes (2-50 nodes), and clear channel assessment modes. The results showed that OQPSK and ASK had lower energy consumption than BPSK. Throughput was highest for OQPSK. While carrier sense had slightly higher throughput than other CCA modes, the energy consumption differences between CCA modes were minor.
This paper gives a brief idea of the moving objects tracking and its application.
In sport it is challenging to track and detect motion of players in video frames. Task
represents optical flow analysis to do motion detection and particle filter to track players
and taking consideration of regions with movement of players in sports video. Optical flow
vector calculation gives motion of players in video frame. This paper presents improved
Luacs Kanade algorithm explained for optical flow computation for large displacement and
more accuracy in motion estimation.
A rapid progress is seen in the field of robotics both in educational and industrial
automation sectors. The Robotics education in particular is gaining technological advances
and providing more learning opportunities. In automotive sector, there is a necessity and
demand to automate daily human activities by robot. With such an advancement and
demand for robotics, the realization of a popular computer game will help students to learn
and acquire skills in the field of robotics. The computer game such as Pacman offers
challenges on both software and hardware fronts. In software, it provides challenges in
developing algorithms for a robot to escape from the pool of attacking robots and to develop
algorithms for multiple ghost robots to attack the Pacman. On the hardware front, it
provides a challenge to integrate various systems to realize the game. This project aims to
demonstrate the pacman game in real world as well as in simulation. For simulation
purpose Player/Stage is used to develop single-client and multi-client architectures. The
multi- client architecture in player/stage uses one global simulation proxy to which all the
robot models are connected. This reduces the overhead to manage multiple robots proxy.
The single-client architecture enables only two robot models to connect to the simulation
proxy. Multi-client approach offers flexibility to add sensors to each port which will be used
distinctly by the client attached to the respective robot. The robots are named as Pacman
and Ghosts, which try to escape and attack respectively. Use of Network Camera has been
done to detect the global positions of the robots and data is shared through inter-process
communication.
In Content-Based Image Retrieval (CBIR) systems, the visual contents of the
images in the database are took out and represented by multi-dimensional characteristic
vectors. A well known CBIR system that retrieves images by unsupervised method known
as cluster based image retrieval system. For enhancing the performance and retrieval rate
of CBIR system, we fuse the visual contents of an image. Recently, we developed two
cluster-based CBIR systems by fusing the scores of two visual contents of an image. In this
paper, we analyzed the performance of the two recommended CBIR systems at different
levels of precision using images of varying sizes and resolutions. We also compared the
performance of the recommended systems with that of the other two existing CBIR systems
namely UFM and CLUE. Experimentally, we find that the recommended systems
outperform the other two existing systems and one recommended system also comparatively
performed better in every resolution of image.
Information Systems and Networks are subjected to electronic attacks. When
network attacks hit, organizations are thrown into crisis mode. From the IT department to
call centers, to the board room and beyond, all are fraught with danger until the situation is
under control. Traditional methods which are used to overcome these threats (e.g. firewall,
antivirus software, password protection etc.) do not provide complete security to the system.
This encourages the researchers to develop an Intrusion Detection System which is capable
of detecting and responding to such events. This review paper presents a comprehensive
study of Genetic Algorithm (GA) based Intrusion Detection System (IDS). It provides a
brief overview of rule-based IDS, elaborates the implementation issues of Genetic Algorithm
and also presents a comparative analysis of existing studies.
Step by step operations by which we make a group of objects in which attributes
of all the objects are nearly similar, known as clustering. So, a cluster is a collection of
objects that acquire nearly same attribute values. The property of an object in a cluster is
similar to other objects in same cluster but different with objects of other clusters.
Clustering is used in wide range of applications like pattern recognition, image processing,
data analysis, machine learning etc. Nowadays, more attention has been put on categorical
data rather than numerical data. Where, the range of numerical attributes organizes in a
class like small, medium, high, and so on. There is wide range of algorithm that used to
make clusters of given categorical data. Our approach is to enhance the working on well-
known clustering algorithm k-modes to improve accuracy of algorithm. We proposed a new
approach named “High Accuracy Clustering Algorithm for Categorical datasets”.
Brain tumor is a malformed growth of cells within brain which may be
cancerous or non-cancerous. The term ‘malformed’ indicates the existence of tumor. The
tumor may be benign or malignant and it needs medical support for further classification.
Brain tumor must be detected, diagnosed and evaluated in earliest stage. The medical
problems become grave if tumor is detected at the later stage. Out of various technologies
available for diagnosis of brain tumor, MRI is the preferred technology which enables the
diagnosis and evaluation of brain tumor. The current work presents various clustering
techniques that are employed to detect brain tumor. The classification involves classification
of images into normal and malformed (if detected the tumor). The algorithm deals with
steps such as preprocessing, segmentation, feature extraction and classification of MR brain
images. Finally, the confirmatory step is specifying the tumor area by technique called
region of interest.
A Proxy signature scheme enables a proxy signer to sign a message on behalf of
the original signer. In this paper, we propose ECDLP based solution for chen et. al [1]
scheme. We describe efficient and secure Proxy multi signature scheme that satisfy all the
proxy requirements and require only elliptic curve multiplication and elliptic curve addition
which needs less computation overhead compared to modular exponentiations also our
scheme is withstand against original signer forgery and public key substitution attack.
This document proposes a digital watermarking technique using LSB replacement with secret key insertion for enhanced data security. The technique works by inserting a watermark into the least significant bits of pixels in an image. A secret key is also inserted during transmission for additional security. The watermarked image is generated without noticeably impacting image quality. The proposed method was tested on sample images and successfully embedded watermarks while maintaining visual quality. The technique aims to provide copyright protection and authentication of digital images and documents.
Today among various medium of data transmission or storage our sensitive data
are not secured with a third-party, that we used to take help of. Cryptography plays an
important role in securing our data from malicious attack. This paper present a partial
image encryption based on bit-planes permutation using Peter De Jong chaotic map for
secure image transmission and storage. The proposed partial image encryption is a raw data
encryption method where bits of some bit-planes are shuffled among other bit-planes based
on chaotic maps proposed by Peter De Jong. By using the chaotic behavior of the Peter De
Jong map the position of all the bit-planes are permuted. The result of the several
experimental, correlation analysis and sensitivity test shows that the proposed image
encryption scheme provides an efficient and secure way for real-time image encryption and
decryption.
This paper presents a survey of Dependency Analysis of Service Oriented
Architecture (SOA) based systems. SOA presents newer aspects of dependency analysis due
to its different architectural style and programming paradigm. This paper surveys the
previous work taken on dependency analysis of service oriented systems. This study shows
the strengths and weaknesses of current approaches and tools available for dependency
analysis task in context of SOA. The main motivation of this work is to summarize the
recent approaches in this field of research, identify major issue and challenges in
dependency analysis of SOA based systems and motivate further research on this topic.
In this paper, proposed a novel implementation of a Soft-Core system using
micro-blaze processor with virtex-5 FPGA. Till now Hard-Core processors are used in
FPGA processor cores. Hard cores are a fixed gate-level IP functions within the FPGA
fabrics. Now the proposed processor is Soft-Core Processor, this is a microprocessor fully
described in software, usually in an HDL. This can be implemented by using EDK tool. In
this paper, developed a system which is having a micro-blaze processor is the combination
of both hardware & Software. By using this system, user can control and communicate all
the peripherals which are in the supported board by using Xilinx platform to develop an
embedded system. Implementing of Soft-Core process system with different peripherals like
UART interface, SPA flash interface, SRAM interface has to be designed using Xilinx
Embedded Development Kit (EDK) tools.
The article presents a simple algorithm to construct minimum spanning tree and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis and simulation results have also been included.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Radio Frequency identification (RFID) technology has become emerging
technique for tracking and items identification. Depend upon the function; various RFID
technologies could be used. Drawback of passive RFID technology, associated to the range
of reading tags and assurance in difficult environmental condition, puts boundaries on
performance in the real life situation [1]. To improve the range of reading tags and
assurance, we consider implementing active backscattering tag technology. For making
mobiles of multiple radio standards in 4G network; the Software Defined Radio (SDR)
technology is used. Restrictions in Existing RFID technologies and SDR technology, can be
eliminated by the development and implementation of the Software Defined Radio (SDR)
active backscattering tag compatible with the EPC global UHF Class 1 Generation 2 (Gen2)
RFID standard. Such technology can be used for many of applications and services.
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
A Visual Guide to 1 Samuel | A Tale of Two HeartsSteve Thomason
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
Temple of Asclepius in Thrace. Excavation resultsKrassimira Luka
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
2. complements (and does not replace) encryption. In fact, the historical roots of digital watermarking are
derived mainly from, the science of information hiding or steganography and are of major consequence from
a defence point of view.
Figure 1.Construction of shares in a (2, 2) VC Scheme
Data payload, fidelity and robustness are the main parameters that must be considered in digital
watermarking. Data payload refers to the number of bits of information that can be embedded via the
watermark. Fidelity is the imperceptibility to human observation even after distortion of the watermark while
robustness is the resilience of the watermark against attacks. Attacks on digital watermarks can be broadly
classified into categories like removal attacks, geometric attacks, cryptographic attacks, protocol attacks and
estimation based attacks. A watermark should be robust to all kinds of attacks and watermarking schemes
should be so designed such that it should be impossible to remove the watermark without severe quality
degradation of the cover content.
Naor and Shamir [2] proposed a lossless watermarking technique called visual cryptography (VC) in order to
protect the security of a binary watermark secret image. The major advantage of this technique is that it does
not modify the original image and decryption is done by human visual system. Here, a binary secret image is
divided into two sets called shares as shown in Fig. 1. The shares have a pseudorandom noise like pattern and
do not reveal any meaningful information alone. However, when all the shares are printed upon
transparencies and overlaid one upon the other, they reveal the secret image.
Visual cryptography requires no previous knowledge or experience of cryptography on the part of the person
decoding the message. Preparation of shares is a simple process which can be done with the help of the
simple mathematical techniques proposed in [2]. At the decryption end, the job is performed not by complex
cryptographic algorithms but by the human visual system, thus making the system both secure and simple.
For Naor’s (k, n) visual secret sharing approach, any k dealers can view the image by stacking them but
anything less than k shares cannot reveal any information. Researchers later on, developed variants of the
above mentioned scheme for image watermarking due to its sheer robustness, transparency, capacity to
distinguish between different watermarks, simplicity and non-intrusiveness. This class of watermarks came to
be known as perceptual watermarks since they used perceptual information based on human visual models
for establishing copyright.
In this paper, section 2 discusses a brief literature review on VC based image watermarking techniques while
section 3 presents detailed overview of existing VC based video watermarking schemes. A performance
comparison amongst the mentioned VC based video watermarking schemes is provided in Section 4 followed
by the conclusions drawn in Section 5.
II. VISUAL CRYPTOGRAPHY BASED IMAGE WATERMARKING SCHEMES
Watermarking in images can be done both in spatial and transform domains. Spatial domain techniques
though computationally less complex, are less resilient to attacks. Transform domain techniques, on the other
hand, are more robust in comparison to spatial domain techniques since they modify the coefficients of the
transform of the pixel values. Discrete wavelet transform (DWT), discrete cosine transform (DCT) and
discrete Fourier transform (DFT) based transformed domain techniques have been found to be more robust
than spatial domain techniques particularly in attacks like lossy compression, rescaling, rotation, noise
addition etc.
34
3. To perform watermarking in images, researchers over the years have attempted to incorporate Naor and
Shamir’s [2] unique Visual Secret Sharing (VSS) technique in watermarking schemes to protect the security
of their multimedia content. Many VC based watermarking schemes have been proposed for images in the
literature [3-7]. In the (k,n) basic model [2], any ‘k’ shares could decode the secret information. To improve
the level of security, the basic model was extended to general access structures [3] where an access structure
was a structure which deemed only certain shares as qualified. Retrieval of the secret was possible by
stacking only the qualified shares. Modified VC based schemes were suggested by developers to partition the
watermark into two pseudorandom noise-like shares. The first share was embedded in some specific pixels of
the host image by decreasing their gray level values. The watermark was retrieved by superimposing the
watermarked image and the second share. These methods had the drawback that it affected the host image
data by embedding first share directly into the host image. Hence it was intrusive in nature. Later, a blind,
non-intrusive VC based watermarking scheme was proposed where MSBs of selected pixels of host image
were used to generate shares. To retrieve the watermark, the receiver needed both the secret key and the
registered verification information simultaneously. Research was carried out in the following years to devise
VC based copyright protection schemes where sampling distribution of means calculated from host image
was used as a feature to form the shares. The scheme could register multiple secret images without altering
the host image. In addition, this scheme had the advantage that the size of the watermark was not restricted
by the size of the host image, i.e. binary image of any size can be used as a watermark.
In the conventional VSS schemes discussed above, the techniques revealed either the entire secret image or
nothing, and hence limited level of secrecy which could be achieved. Fang and Lin [4] proposed a
progressive visual secret sharing (PVSS) scheme which demonstrated that when more shares are stacked
progressively, the recovery of the secret image would be clearer and clearer. Although Fang and Lin’s
method could achieve a progressive effect, their adoption of expanding pixels meant that more transmission
time and storage space was needed. To overcome the disadvantages of [4], Hou and Quan [5] came up with a
PVSS scheme with unexpanded shares which reduced storage space of shares, transmission time, bandwidth
required for transmission and also was effective in maintaining the quality of the recovered image. In this
method, it was noted that when any k (k = 2 − n) shares were stacked, the probability of appearing black
pixels on the stacked shares increased to k/n; while for the white pixels, the probability of appearing as black
pixels remained as 1/n. After stacking all shares, black regions of the secret image could be completely
reconstructed and were recognized by the human eye owing to the large contrast between black and white
pixels.
Substantial work has been done on transformed domain VC based schemes also [6, 7]. A DWT-SVD
(Discrete Wavelet Transform- Singular Value Decomposition) approach was suggested by Wang and Chen
[6] where first DWT is applied to the host image followed by SVD. A feature vector is subsequently created
and k-means clustering is used to classify into two clusters. A master share is generated in the next stage and
ownership share constructed using the master share and secret image. In a method devised by Rawat et al [7],
Fractional Fourier transform (FrFT) is used as a major tool followed by SVD. The transform orders of FrFT
act as the key for the algorithm providing it enhanced security. The problem with these techniques was that
the shares were pseudo random noise like-patterns carrying no visual information and hence raised the
suspicion of cryptanalysts. To combat this drawback work was done to generate meaningful binary images as
shares. This reduced suspicion and made detection even more improbable, thus raising the security level.
III. VISUAL CRYPTOGRAPHY BASED VIDEO WATERMARKING SCHEMES
A video is nothing but a sequence of images yet image watermarking techniques cannot be directly applied to
videos owing to their three dimensional characteristics. In addition to their special preprocessing techniques,
the temporal nature of videos has to be taken into account [1]. Redundancy between frames and a large
volume of data makes it all the more difficult to perform watermarking in videos. Some common forms of
attack on videos are frame swapping, frame averaging, frame dropping, statistical analysis, interpolation etc.
which are unknown to the domain of image watermarking. Inter- video collusion attacks and intra-video
collusion attacks are also issues which need to be addressed. Real time implementations of video
watermarking techniques are generally much more complex than that of image watermarking which becomes
an important issue.
Video watermarking schemes are used for various video applications such as copyright protection, copy
control, fingerprinting, broadcast monitoring, video authentication, enhanced video coding etc. Some
35
4. traditional video watermarking schemes attempt to embed an entire watermark image within each video
frame or within random video frames to give the appearance of a hidden watermark to the casual observer.
Neither embedding the same watermark to each frame nor embedding different watermarks in every frame of
the video would be robust against all types of common attacks. Embedding identical watermark to each
frame of the video leads to the problem of maintaining statistical perceptual invisibility. The collusion can
estimate the watermark from each watermarked frame and obtain a refined estimate of the watermark by
linear combination. The non-watermarked frame can be obtained with subtraction with the watermarked one.
On the other hand, applying independent watermarks to each frame also presents a problem if regions in each
frame have little or no motion between the consecutive frames. The motionless regions may be averaged to
remove the independent watermarks. Previous schemes of video watermarking are based on the
uncompressed domain but most of the videos on the internet are available in a compressed format. A few
techniques have been developed in the recent years which perform video watermarking in the compressed
domain [8-10]. A scheme proposed in [8] uses the phase angle of the motion vectors of macroblocks in the
inter-frame to embed data in a video. A different approach has been suggested in [9] to achieve a lesser
distortion to prediction error and lower data size overhead in comparison to [8]. Here, motion vectors whose
associated macroblocks’ prediction error is high are taken to be candidate motion vectors (CMV). The
CMV’s are then used to hide a bit of data in their horizontal and vertical components. Shanableh [10] later
proposed two novel approaches to which gave a higher message extraction accuracy and payload. In the first
approach message bits are concealed by modifying the quantization scale of the MPEG video. Feature
extraction is performed by for individual macroblocks and a second order regression model is computed to
predict the content of the hidden message. Though this procedure has a high level of prediction accuracy the
payload is restricted to one bit per macroblock. The second approach proposed in [10] benefits from a high
message payload with negligible drop in the PSNR levels. This solution uses Flexible Macroblock Ordering
(FMO) to direct the encoder to create slice groups (independently coded and decoded units). Each slice group
contains slices and macroblocks are assigned in any order to these slices. The slice group ID’s of individual
macroblocks may then be used for to indicate the message bits that are hidden in the slice groups. Since this
method is compatible with H.264/AVC standards and is independent of the frame type being used (Intra
frame Predicted frame or Bidirectional Frame) it is advantageous from the point of view of implementation.
However, the drawback with this solution is that it increases the bitrate of the coded video. All of these
schemes [8-10] modify the content of the host video which in turn affects the host video quality. Instead of
mentioned traditional watermarking schemes, we can use VC based techniques effectively for copyright
protection. In this section, we present some of the existing VC based watermarking schemes for videos.
A. VC based Video Watermarking in Spatial Domain
One of the earliest video watermarking approaches was proposed in 2006 by Houmansadr and
Ghaemmaghami [11] in the spatial domain using VC which proved to be robust to collusion attacks and
geometrical attacks. The proposed scheme is based on Naor and Shamir’s (2, 2) visual secret sharing scheme
and can be broadly categorized into Embedding of Watermark and Detection of Watermark stages.
Within the embedding stage, the algorithm begins with the share creation phase wherein the binary
watermark image is split into two noise-like pseudo random shares. The binary format (0, 1) of the
watermark information is converted to the (-1, +1) signed format which gives a pseudo-random watermark
sequence which is approximately zero mean. In the following phase of the proposed algorithm, the frames of
the video are temporally scrambled by the use of a Linear Feedback Shift Register (LFSR) as illustrated in
Fig. 2(a). Initial condition of the LFSR serves as the private key in the watermark detection stage.
Figure 2(a). Block diagram for inserting watermark in [11]
Figure 2(b). Block diagram for detecting watermark in [11]
36
5. A one to one mapping is maintained between the frames of the original video and the temporally scrambled
video. The next phase which is the share insertion phase scales the shares by a parameter ‘α’ (a parameter to
determine the strength of the watermark which is fixed to be ‘3’) and combines them with the scrambled
video frames. The final watermarked video sequence is produced by the inverse temporal scrambling
process. The watermark detection stage, shown in Fig. 2(b), begins with passing the watermarked video
through a high pass filter (HPF) which preserves the high frequency components in the noise- like watermark
sequence. Subsequently, the video is temporally scrambled once again such that the frames containing the
shares now lie adjacent to each other. As a result L/2 stacked frames are obtained where a pixel by pixel
comparison between the stacked frames are done, followed by a reduction of the stacked image from (2M) X
(2N) pixels to (M X N) pixels. The detection algorithm uses the principle that stacking frames, containing
corresponding shares of the logo, makes higher correlation with the logo, as compared to stacked frames
containing non- relevant shares of the logo. The Corr (k) function gives a measure of the correlation between
the L/2 stacked frames and the binary watermark, based on which we draw the conclusion about the presence
or absence of the specified watermark.
(1)
where W is the watermark, Fst is the stacked frame, E(Fst) returns the energy of the stacked frame, E(W) gives
the energy of the watermark and the dot returns the dot product.
In this simple and effective spatial domain method, the inserted watermark shows high resilience against
some attacks, such as geometrical distortions and collusion attacks. However, the scheme is in spatial domain
which provides a lower robustness to steganalysis in comparison to VC based watermarking techniques of
the transformed domain. Further, since the shares are embedded into the host video in the watermark
embedding stage, it alters the contents of the host and hence degrades it.
B. VC based generation of Embedded Crypto-Watermarks
Later in 2008, Zeng and Pei [12] suggested a novel video diagnosing method where the generation of cryptowatermarks was carried out by using the concept of visual cryptography. Here, significant information in the
form of crypto-watermarks is embedded into the video through a Dual Domain Quaternary Watermarking
Algorithm which lends robustness to the scheme. The proposed method can identify the attack category
(frame attack and temporal attack) and the video authentication type (whether video is a watermarked video
or non-watermarked video) by means of the BER (bit error rate).
The first stage of the algorithm is the generation of such crypto- watermarks while the next stage embeds the
crypto-watermarks using the quaternary watermarking algorithm. The crypto-watermarks are generated
through visual cryptography from binary images and have different resistances against different attacks. Four
crypto-watermarks, namely first watermark (W1), second watermark (W2), intra-watermark (W3 ) and interwatermark (W4) are generated as shown in Fig.3. W1 and W2 form the quaternary watermark (Wq). This
quaternary watermark is added into the intra frame in the DCT domain in the embedding stage. During the
watermark extraction stage at the receiver end, the data stream is divided into 8x8 non overlapping blocks
and then W*q is extracted by calculating sample values in the DCT domain.
Figure 3. Generation of crypto-watermarks in [12]
37
6. The bit-error-rate (BER) between the extracted watermarks of the suspected video and the original cryptowatermarks is measured. Analysis of BER determines the nature of attack on the video. Based on a
comparison of BER’s between the first, second, intra and inter watermarks, status of frame attack is assigned.
The status can be used to diagnose a video to be a non-watermarked video, authorized video, recompressed
video and unauthorized frame inserted video.
Important applications of this methodology include dispute resolving, content identity verification and
prevention of illegal video editing. However, the decryption process is not done by merely overlaying the
shares. Since the watermark extraction process involves computations in the DCT domain followed by
calculation of sample, it causes a computational overhead. Thus the inherent advantage of visual
cryptography that is, extracting the secret information directly by the human visual system without the use of
any complex computational process, is compromised. Also, similar to the method proposed in [11], this is an
intrusive method and operates by directly embedding the watermark into the contents of the host.
C. VC based Video Watermarking using scene averaged image
In both previous mentioned techniques, content of host audio is modified. In 2010, Vashistha et al. proposed
a method [13] that employs (2, 2) visual cryptography, scene change detection and extraction of features
from scene to create Verification Information (VI). The authors’ have rightly coined the term ‘non-intrusive
watermarking’ for visual cryptographic schemes since the information of the watermark has been extracted
by creation of shares applying the principles of visual cryptography rather than embedding watermark
information directly into the cover content (host image or video). This is indeed a major advantage over the
previously mentioned schemes of [11] and [12]. The process to generate VI for watermark pattern W of size
(h × l) and an original 256 gray-leveled image I of size (m × n) with the help of a secret key, S (a random
number) and by the rule shown in Fig. 4(a) and 4(b). The VI is constructed by assembling all the (Vi1, Vi2)
pairs. In the verification process, the authenticity of the image I’ is assessed by using the inverse process. The
above process is used in the context of videos by first performing scene change detection and then by
forming a scene averaged image which is converted into grey scale for computing the Verification
Information (VI). The number of scenes detected decides the number of VI vectors since these two values
have to be necessarily equal. The VI vector is thus one of the shares generated from the watermark pattern
and the secret image.
Since no data is embedded into the host video in this technique, the method is resilient to attacks aimed at
distorting the data embedded into videos. The method is particularly effective against frame averaging, frame
dropping, frame swapping and interpolation attacks. All watermarked scenes, and not just individual frames,
need to be dropped for an effective attack. Dropping of scenes makes illegal copying and distribution
pointless and thus automatically discourages malpractices. The scheme can survive as much as a 50% frame
drop attack. However, when the VI of a different scene is used, the extracted watermark quality is highly
degraded. Also, the scheme is in the spatial domain which makes it less robust than its transform domain
counterparts.
Figure 4 (a). Visual Threshold Scheme of [13]
Figure 4 (b). Rules to assign values for VI in [13]
D. VC based Video Watermarking using scene change detection
In 2011, Singh et al. [14] implemented VC based scheme based on DWT transform domain and scene change
detection. Here, 1- level Discrete Wavelet Transform (DWT) is applied on averaged frame and features are
38
7. extracted from LL subband. The watermark is split into sub-watermarks, the number of sub-watermarks
being equal to the number of detected scenes. Frame mean (I) of all frames in a scene and global mean (µ) of
the frame mean in a scene are found by taking the average of all corresponding pixel values in all frames in
the same scene and the average of all pixel values in the frame mean (I) in the same scene respectively.
Next, the construction of owner’s share is done by checking the pixel value of the binary watermark and
comparing the pixel value of the frame mean of same scene of the video with the global mean. Since,
different parts of a single watermark are used in different scenes while the same sub-watermark is used for
the different frames of a same scene the algorithm becomes robust to frame attacks like frame averaging,
frame dropping, frame swapping and interpolation attacks. The identification share is generated by
comparing the frame mean (I’) of the suspected video with the global mean (µ’) of this frame mean. The
stacking of both the shares reveals copyright information. An overview of this scheme is demonstrated in Fig.
5(a) and 5(b). The robustness of DWT to noise attacks and the security and simplicity of VC makes this
technique easy to implement.
E. VC based Video Watermarking using unique frame identification
In [13] and [14], authors have used all the frames belonging to one scene in order to extract features and
create share. Kumar and Hensman [15] proposed a scheme which pre-process video in order to extract unique
frames from a given video before watermarking. Hence instead of embedding watermark in all frames, the
watermark is distributed only in selected unique frames. Here, DWT based similarity approach, first,
segregates the video into similar and dissimilar frames. Following this, k shares are created where k is the
number of unique frames which were detected in the previous stage through DWT. The watermark image is
divided into n size sub blocks, and then each n block is divided into k sub blocks. The i th block from this k
block sequence will be taken to build the i th sub image. In the same way, all sub images will be composed to
generate the cryptography watermark. Hence, selected frames only will contain a fractional number of pixels
from the watermark logo until the entire logo is distributed over different frames. This gives the advantage
that information from a single frame will not reveal the watermark information or even give any indication
that it contains a fraction of the watermark pixels. Further, he used a lossless/reversible data hiding
technique to embed the watermark. The stage by stage representation of the multi layered structure for this
scheme is illustrated in Fig.6. Here, the author claims that the video frame before and after watermarking
may appear to be the same.
Figure 5 .Overview of the watermarking process in [14] (a) generation of owner’s share and (b) generation of identification share.
IV. PERFORMANCE COMPARISON OF THE REVIEWED SCHEMES
Though all above mentioned VC based video watermarking schemes have tried to achieve high
imperceptibility, high robustness, they suffer from limitations imposed by VC technique itself. For any VC
scheme, resolution of extracted secret watermark binary image is degraded due to pixel expansion [2]. Here,
pixel expansion increases apparent randomness and security but often leads to a poorer quality of extracted
watermark. Therefore, a compromise between security and resolution should be made for successful
implementation of these VC based schemes. Also, certain VC schemes operate by dividing the host image or
video into non-overlapping blocks and then by selecting only a few blocks on which the feature extraction
techniques are applied [7, 14]. When a smaller block size is chosen, the number of blocks obviously
39
8. increases. Thus, there is more randomness in selecting the blocks which enhances the security of the scheme.
On the other hand, a larger block size captures the features of the host more effectively as compared to a
smaller block size. Therefore, a tradeoff needs to be achieved in between level of security and feature
extraction accuracy too.
Figure 6. Layered design of the approach proposed in [15]
TABLE I. Performance Comparison of Various VC Schemes for Videos
S.
N
o.
1
Proposed
Scheme
Year
No. Of
Shares
Domain
Houmansad
r and
Ghaemmag
h-ami [11]
2006
2
Spatial
2
Zeng and
Pei [12]
2008
4
3
Vashistha
et al. [13]
2010
4
Singh et al.
[14]
Kumar and
Hensman
[15]
5
Intrusive/
Nonintrusive
intrusive
Techniques Used
Performance mentioned in
related work
Temporal Scrambling,
Stacking, Correlation
intrusive
Inter-Frame and Intra-Frame
crypto watermark generation
2
Dual
Domain
(DCT
and
Spatial)
Spatial
nonintrusive
2013
2
DWT
2013
k
DWT
nonintrusive
intrusive
Construction of Verification
Information vector, Scene
change detection by
segmentation based on colour
difference histogram, scene
averaging.
Scene change detection,
scene averaging
DWT for unique frame
extraction, Multi-Layer
Approach
For 50 % frame cropping
decrement in correlation
coefficient 16%; For 8 times
frame scaling, decrement in
correlation coefficient 39%;
Average PSNR found to be
52.78 dB for original frames
and 42.18 dB for watermark;
capable of identifying different
types of attacks.
Survives as much as a 50%
frame drop
NC above 0.95 for all kinds of
frame attacks
Not mentioned
A watermarking scheme is evaluated on the basis of criteria like perceptibility, reliability, robustness,
capacity, speed of implementation and statistical detectability. MSE (Mean Square Error), PSNR (PeakSignal–to-Noise Ratio) and NC (Normalized Correlation) are some of the metrics which are used for
comparison. MSE is defined as the mean square error between the pixels of the original image H and the
attacked image
(2)
40
9. PSNR gives us a measure of the degree of distortion to the watermark.
(3)
NC is the measure of similarity between the original and extracted watermarks.
(4)
where m x n is the image size, Si,j and
represent original and extracted watermarks respectively. In
mentioned schemes, the watermarked videos were subjected to variety of attacks like frame attacks (like
frame swapping, frame averaging, frame dropping, statistical analysis, interpolation etc.), noise attacks (like
impulse and Gaussian noise etc.) and geometrical attacks (like cropping, reshaping, resizing, rotating etc.).
Apart from these, blurring, filtering, sharpening, scaling and JPEG compression attacks were also used to
ascertain the robustness. Here, we have provided comparison of the above mentioned techniques in Table I.
S’’i,j
V. CONCLUSION
Visual Cryptography has proven to be a simple, robust and non-intrusive watermarking technique. Though
VC is widely used in case of image watermarking, video watermarking imposes more challenges. The feature
extraction techniques applied for creating shares from videos are more complex than images. Generally
Group of Pictures (GOPs), scene change detection, unique frame identifications etc. are considered in these
feature extraction techniques. Video files have a larger size compared to simple images; this provides an
excellent opportunity to add more secret information. Utilizing the power of visual secret sharing methods for
videos in transform domain may offer a very attractive and robust solution for different sectors like defence
or military video based communication services, music industries to establish their rightful copyright
ownerships, digital video forensic applications etc.
REFERENCES
[1] Hartung F, Kutter M. “Multimedia watermarking techniques.” Proc IEEE 1999; 87(7 (July)).
[2] Naor M. and Shamir A., “Visual Cryptography,” in Proceedings of Advances in Cryptology-EUROCRYPT, Lecture
Notes in Computer Science, Berlin, pp. 1-12, 1995.
[3] G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, “Visual cryptography for general access structures”,
Information and Computation 129 (1996), 86-106.
[4] W. P. Fang and J. C. Lin, “Progressive viewing and sharing of sensitive images,” Patt. Recog. Image Anal., vol. 16,
no. 4, pp. 638–642, 2006.
[5] Young-Chang Hou and Zen-Yu Quan, “Progressive Visual Cryptography with Unexpanded Shares”, IEEE
Transactions On Circuits And Systems For Video Technology, Vol. 21, No. 11, November 2011, pp. 1760-1764.
[6] M.S.Wang, W.C.Chen,”A Hybrid DWT-SVD Copyright Protection Scheme Based On K-Means Clustering And
Visual Cryptography”, Computer Standards &Interfaces, 31 (2009)757–762.
[7] Rawat, S and Balasubramanian Raman, “A Blind Watermarking Algorithm Based On Fractional Fourier Transform
And Visual Cryptography,” Elsevier Signal Processing, Vol 92 ,2012, pp. 1480–1491
[8] Ding-Yu Fang, Long-Wen Chang, “Data Hiding For Digital Video with Phase of Motion Vector,” IEEE International
Symposium on Circuits and Systems, 2006, pp. 1422- 1425.
[9] Aly, H., “Data Hiding In Motion Vectors Of Compressed Video Based On Their Associated Prediction Error,” IEEE
Transactions on Information and Forensics Security, Vol. 6, No. 21, Mar 2011, pp. 14–18.
[10] Shanableh, T., “Data Hiding in MPEG Video Files Using Multivariate Regression and Flexible Macroblock
Ordering,” IEEE Transactions on Information Forensics and Security, Vol. 7, No. 2, Apr 2012, pp. 455–464.
[11] Amir Houmansadr and Shahrokh Ghaemmaghami, “A Novel Video Watermarking Method Using Visual
Cryptography,” IEEE International Conference on Engineering of Intelligent Systems, Islamabad, Pakistan, 2006.
[12] Yi-Chong Zeng, Soo-Chang Pei, “ Automatic Video Diagnosing Method Using Embedded Crypto-Watermarks”,
IEEE International Symposium on Circuits and Systems, 2008. (ISCAS 2008).dg
[13] Aditya Vashistha, Rajarathnam Nallusamy, Amitabha Das, Sanjoy Paul,” Watermarking Video Content Using
Visual Cryptography And Scene Averaged Image”, IEEE Conference, 2010.
[14] Rupachandra Singh, Th., Manglem Kh Singh, , and Sudipta Roy “Video Watermarking Scheme Based On Visual
Cryptography And Scene Change Detection,” Elsevier International Journal of Electronics and Communications
(AEU) , Vol 67, Jan 2013, pp. 645- 651.
[15] Kumar, M. and Hensman, A. “Robust Digital Video Watermarking Using Reversible Data Hiding and Visual
Cryptography”, ISSC conference 2013 at LYIT, Ireland.
41