Hybrid DNA Chaos Based Steganography on ECG Signal for Secured Data Communication

2020 ◽  
Vol 17 (9) ◽  
pp. 4678-4682
Author(s):  
S. Yogalakshmi ◽  
Rekha Chakravarthi
Keyword(s):  
Data Communication ◽  
Ecg Signal ◽  
Secret Key ◽  
Privacy Measures ◽  
One Step ◽  
Hidden Data ◽  
Secured Data ◽  
Host Signal ◽  
Do So ◽  
Hybrid Dna

One of the principal issues in data sharing is security. Data being transferred on the internet is prone to severe attacks. Securing data is kind of digital privacy measures that are implemented to prevent the data to be hacked by unauthorized person while sharing the information over the communication network. Data may be of any form like image, signal or text. Encrypting the data before being transmitted is one step taken to promote security which is the well-known process of cryptography. Steganography deals with hiding the message in any unknown format. Combination of these methods turns to be more secure. A hybrid DNA hyper chaotic based algorithm with lifting wavelet technology to secure ECG signal is proposed here. The wavelet technique that decomposes the image into four bands namely LL, LH, HH, HL. To remove the redundancies the coefficients are utilised in the encoder process. The data hiding is implemented by selective embedding process is introduced in this method by determine host signal samples. The encrypted data then is hidden inside image using DNA method logically. When one knows and tries to get the hidden data they require the secret key to do so and any mistake in that leads to distortion of the signal which results in loss of data. This method is found to be secure and the simulation is done using MATLAB. A GUI is developed to choose the required ECG signal and other operations to embed the data and find the original signal after retrieval.

Explosions

2018 ◽  
Author(s):  
E. Douglas Bomberger
Keyword(s):  
United States ◽  
New York ◽  
Puerto Rico ◽  
The United States ◽  
Woodrow Wilson ◽  
One Step ◽  
Do So ◽  
Laws And Regulations

On 2 April 1917, President Woodrow Wilson urged Congress to enter the European war, and Congress voted to do so on Friday, 6 April. On the 15th of that month, Victor released the Original Dixieland Jazz Band’s record of “Livery Stable Blues” and “Dixieland Jass Band One-Step”; it caused an immediate nationwide sensation. James Reese Europe travelled to Puerto Rico in search of woodwind players for the Fifteenth New York Regiment Band, and the Creole Band ended its vaudeville career when it missed the train to Portland, Maine. German musicians in the United States came under increased scrutiny in the weeks after the declaration of war, as the country prepared to adopt new laws and regulations for wartime.

scholarly journals Dual Protectıon for Data usıng Steganographıc Technıques with Embedded Framework

2019 ◽  
Vol 8 (5S3) ◽  
pp. 155-159
Keyword(s):  
High Performance ◽  
Data Communication ◽  
Original Data ◽  
Cover Image ◽  
Original Text ◽  
Dual Protection ◽  
Proposed Model ◽  
Encryption And Decryption ◽  
Secured Data

As the world is getting digitalized, the rush for need of secured data communication is overtop. Provoked by the vulnerability of human visual system to understand the progressive changes in the scenes, a new steganography method is proposed. The paper represents a double protection methodology for secured transmission of data. The original data is hidden inside a cover image using LSB substitution algorithm. The image obtained is inserted inside a frame of the video producing a stego-video. Stego-video attained is less vulnerable to attacks. After decryption phase, the original text is obtained which is error-free and the output image obtained is similar as the cover image. The quality of stego-video is high and there is no need for additional bandwidth for transmission. The hardware implement is required in order to calculate the corresponding analytical results. The proposed algorithm is examined and realized for various encryption standards using Raspberry Pi3 embedded hardware. The results obtained focuses on the attributes of the proposed model. On comparing with other conventional algorithms, the proposed scheme exhibits high performance in both encryption and decryption process with increase in efficiency of secured data communication.

Bernoulli's Chaotic Map-Based 2D ECG Image Steganography

2019 ◽  
pp. 208-241 ◽  
Author(s):  
Anukul Pandey ◽  
Barjinder Singh Saini ◽  
Butta Singh ◽  
Neetu Sood
Keyword(s):  
Signal Processing ◽  
Chaotic Map ◽  
Image Steganography ◽  
Cover Image ◽  
Ecg Signal ◽  
Mean Square ◽  
Secret Key ◽  
Mean Square Difference ◽  
Electrocardiogram Ecg ◽  
Ecg Steganography

Signal processing technology comprehends fundamental theory and implementations for processing data. The processed data is stored in different formats. The mechanism of electrocardiogram (ECG) steganography hides the secret information in the spatial or transformed domain. Patient information is embedded into the ECG signal without sacrificing the significant ECG signal quality. The chapter contributes to ECG steganography by investigating the Bernoulli's chaotic map for 2D ECG image steganography. The methodology adopted is 1) convert ECG signal into the 2D cover image, 2) the cover image is loaded to steganography encoder, and 3) secret key is shared with the steganography decoder. The proposed ECG steganography technique stores 1.5KB data inside ECG signal of 60 seconds at 360 samples/s, with percentage root mean square difference of less than 1%. This advanced 2D ECG steganography finds applications in real-world use which includes telemedicine or telecardiology.

scholarly journals A NEW AND ADAPTIVE SECURITY MODEL FOR PUBLIC COMMUNICATION BASED ON CORRELATION OF DATA FRAMES

2019 ◽  
Vol 59 (2) ◽  
pp. 126-133
Author(s):  
Haider Tarish Haider ◽  
Dhiaa Halboot Muhsen ◽  
Haider Ismael Shahadib ◽  
Ong Hang See
Keyword(s):  
Information Technologies ◽  
High Capacity ◽  
Data Communication ◽  
Superior Performance ◽  
Secret Message ◽  
Communication Model ◽  
Security Model ◽  
Secret Key ◽  
Proposed Model ◽  
Capacity Data

Recent developments in communication and information technologies, plus the emerging of the Internet of Things (IoT) and machine to machine (M2M) principles, create the need to protect data from multiple types of attacks. In this paper, a secure and high capacity data communication model is proposed to protect the transmitted data based on identical frames between a secret and cover data. In this model, the cover data does not convey any embedded data (as in normal steganography system) or modify the secret message (as in traditional cryptography techniques). Alternatively, the proposed model sends the positions of the cover frames that are identical with the secret frames to the receiver side in order to recover the secret message. One of the significant advantages of the proposed model is the size of the secret key message which is considerably larger than the cover size, it may be even hundred times larger. Accordingly, the experimental results demonstrate a superior performance in terms of the capacity rate as compared to the traditional steganography techniques. Moreover, it has an advantage in terms of the required bandwidth to send the data or the required memory for saving when compared to the steganography methods, which need a bandwidth or memory up to 3-5 times of the original secret message. Where the length of the secret key (positions of the identical frames) that should be sent to the receiver increases by only 25% from the original secret message. This model is suitable for applications with a high level of security, high capacity rate and less bandwidth of communication or low storage devices.

scholarly journals Notice of Retraction Coupled Tree Parity Machines: Synchronized Secured Session Key based Encryption in Online Transaction

2019 ◽  
Vol 4 (1) ◽  
pp. 27-36
Author(s):  
Arindam Sarkar ◽  
Joydeep Dey ◽  
Sunil Karforma ◽  
Anirban Bhowmik
Keyword(s):  
Data Communication ◽  
Weight Vector ◽  
Expert Committee ◽  
Brute Force ◽  
Secret Key ◽  
Session Key ◽  
Online Data ◽  
Plain Text ◽  
Degree Of Coupling ◽  
Tree Parity Machine

Notice of Retraction-----------------------------------------------------------------------After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of APTIKOM's Publication Principles.We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.The presenting author of this paper has the option to appeal this decision by contacting ij.aptikom@gmail.com.----------------------------------------------------------------------- In this paper, tree parity synchronized session key validation followed by encryption has been proposed for online data communication. Tree Parity Machine transmitting systems at both ends accepted an identical input vector, generated an output bit, validated the weight vector and the networks were trained accordingly based on the output bit which was used to form a protected variable length secret key. Existence of a better degree of coupling between the two topological same tree parity machines has been reflected in this paper. Instead of sharing the entire weight vector, the proposed technique guided the partial transmission and validation of session key. A string of sub key has been derived from the synchronized session key for initial ciphering matrix. The plain text was encrypted through single columnar transposition ciphering at first round of encryption followed by successive cascaded XORing of TPM generated session key. If size of the final block of plain text was less than the size of the key then this block was treated unaltered.  Recipient used identical generated session key for performing deciphering process for getting the plain text. Brute force attacks analysis has been implemented which determines a higher amount of time to decrypt by the intruders. Such long computational operations were not feasible by any of randomly selected fast networks at the intruders’ terminals.

scholarly journals A Text Steganographic System Based on Word Length Entropy Rate

2017 ◽  
Vol 5 (3) ◽  
pp. 71
Author(s):  
Francis Xavier Kofi Akotoye
Keyword(s):  
Word Length ◽  
Entropy Rate ◽  
Secret Message ◽  
Embedding Capacity ◽  
Secret Key ◽  
Text Document ◽  
Electronic Distribution ◽  
Starting Point ◽  
Hidden Data ◽  
Space Encoding

<p class="0abstract">The widespread adoption of electronic distribution of material is accompanied by illicit copying and distribution. This is why individuals, businesses and governments have come to think of how to protect their work, prevent such illicit activities and trace the distribution of a document. It is in this context that a lot of attention is being focused on steganography. Implementing steganography in text document is not an easy undertaking considering the fact that text document has very few places in which to embed hidden data. Any minute change introduced to text objects can easily be noticed thus attracting attention from possible hackers. This study investigates the possibility of embedding data in text document by employing the entropy rate of the constituent characters of words not less than four characters long. The scheme was used to embed bits in text according to the alphabetic structure of the words, the respective characters were compared with their neighbouring characters and if the first character was alphabetically lower than the succeeding character according to their ASCII codes, a zero bit was embedded otherwise 1 was embedded after the characters had been transposed. Before embedding, the secret message was encrypted with a secret key to add a layer of security to the secret message to be embedded, and then a pseudorandom number was generated from the word counts of the text which was used to paint the starting point of the embedding process. The embedding capacity of the scheme was relatively high compared with the space encoding and semantic method.</p>

Constraint-Based Privacy Preserving-Path Computation Element

2019 ◽  
Vol 6 (2) ◽  
pp. 1-32
Author(s):  
Hamid Hajaje ◽  
Mouhcine Guennoun ◽  
Zine El Abidine Guennoun
Keyword(s):  
Shortest Path ◽  
Homomorphic Encryption ◽  
Information Privacy ◽  
Sensitive Information ◽  
Encryption Scheme ◽  
Secret Key ◽  
Path Computation ◽  
Minimum Bandwidth ◽  
Path Computation Element ◽  
Do So

Information privacy and protection is fundamental in the context of path computation. When a path computation client (PCC) requests the shortest path between two nodes from a path computation element (PCE), it desires to do so while protecting the sensitive information carried by the query as well as the overall topology of the network. The authors provide a novel framework to compute the shortest path, between a source and a destination, subject to a constraint, represented in the case by a required minimum bandwidth, while preserving the privacy of both client and server. By employing a secure homomorphic encryption scheme, the PCE can blindly compute the path while being oblivious to the content of the encrypted queries. The output of the PCE computation is an encrypted path that is only decipherable by its original secret key. The implementation using the homomorphic scheme over the integers from Van Dijk, Gentry, Halevi, and Vaikuntanathan (DGHV) shows promising results that the authors analyze in detail throughout this paper.

Sign in / Sign up

Export Citation Format

Share Document