scholarly journals Data Hiding for Text and Binary Files

2014 ◽  
pp. 1495-1514
Author(s):  
Hioki Hirohisa
Keyword(s):  
Data Hiding ◽  
Binary Code ◽  
Binary Codes ◽  
Secret Information ◽  
Textual Data ◽  
Executable File

This chapter presents an overview of text-based and binary-based data hiding methods. Text methods, through which secret information is embedded into innocent-looking textual data, are mostly used for steganography. Binary methods are applied to program binary codes: executables and libraries. In binary methods, information is embedded into a binary code so that its functionality is preserved. Data hiding methods for binary codes have been studied intensively to perform watermarking for protecting software from piracy acts. A message can also be embedded into a binary code in a steganographic manner. Another method is also introduced, which is proposed for enhancing the performance of an executable file.

Data Hiding for Text and Binary Files

2013 ◽  
pp. 351-371
Author(s):  
Hioki Hirohisa
Keyword(s):  
Data Hiding ◽  
Binary Code ◽  
Binary Codes ◽  
Secret Information ◽  
Textual Data ◽  
Executable File

This chapter presents an overview of text-based and binary-based data hiding methods. Text methods, through which secret information is embedded into innocent-looking textual data, are mostly used for steganography. Binary methods are applied to program binary codes: executables and libraries. In binary methods, information is embedded into a binary code so that its functionality is preserved. Data hiding methods for binary codes have been studied intensively to perform watermarking for protecting software from piracy acts. A message can also be embedded into a binary code in a steganographic manner. Another method is also introduced, which is proposed for enhancing the performance of an executable file.

scholarly journals High-Capacity Reversible Data Hiding in Encrypted Images by Information Preprocessing

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Xi-Yan Li ◽  
Xia-Bing Zhou ◽  
Qing-Lei Zhou ◽  
Shi-Jing Han ◽  
Zheng Liu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Main Idea ◽  
Original Image ◽  
Chaos Encryption ◽  
Secret Information ◽  
Encrypted Image ◽  
Encrypted Images ◽  
Scanned Documents

With the development of cloud computing, high-capacity reversible data hiding in an encrypted image (RDHEI) has attracted increasing attention. The main idea of RDHEI is that an image owner encrypts a cover image, and then a data hider embeds secret information in the encrypted image. With the information hiding key, a receiver can extract the embedded data from the hidden image; with the encryption key, the receiver reconstructs the original image. In this paper, we can embed data in the form of random bits or scanned documents. The proposed method takes full advantage of the spatial correlation in the original images to vacate the room for embedding information before image encryption. By jointly using Sudoku and Arnold chaos encryption, the encrypted images retain the vacated room. Before the data hiding phase, the secret information is preprocessed by a halftone, quadtree, and S-BOX transformation. The experimental results prove that the proposed method not only realizes high-capacity reversible data hiding in encrypted images but also reconstructs the original image completely.

scholarly journals New Bounds on the Minimum Average Distance of Binary Codes

2010 ◽  
Vol 2 (3) ◽  
pp. 489
Author(s):  
M. Basu ◽  
S. Bagchi
Keyword(s):  
Lower Bounds ◽  
Binary Code ◽  
Hamming Distance ◽  
Average Distance ◽  
Upper And Lower Bounds ◽  
Binary Codes ◽  
Large N

The minimum average Hamming distance of binary codes of length n and cardinality M is denoted by b(n,M). All the known lower bounds b(n,M) are useful when M is at least of size about 2n-1/n . In this paper, for large n, we improve upper and lower bounds for b(n,M). Keywords: Binary code; Hamming distance; Minimum average Hamming distance. © 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v2i3.2708                  J. Sci. Res. 2 (3), 489-493 (2010) 

Audio and Video Steganography for Secure Data Hiding

2020 ◽  
pp. 703-707
Author(s):  
Ms Swathi ◽  
Supriya A V ◽  
Soundarya Shridhar Patgar
Keyword(s):  
Data Hiding ◽  
Video Steganography ◽  
Secret Information ◽  
Secure Data ◽  
Use Of Internet

Today, the protection is getting the imperative interest due to the elevated use of internet. As the use of internet is increased, the charge at which the records are interchanged per day is additionally increased. The data that is interchanged every day might also turn out to be the target of fraudsters. To take action to do something in particular to resolve this hassle one of the powerful technology is the Steganography. The Steganography is a process of concealing secret information behind an harmless cover file, such that the existence of information is no longer usually admitted. This paper uses the idea of Audio and Video Steganography, where the data is hidden behind the audios and frames of videos.

scholarly journals Online Hashing with Efficient Updating of Binary Codes

2020 ◽  
Vol 34 (07) ◽  
pp. 12354-12361
Author(s):  
Zhenyu Weng ◽  
Yuesheng Zhu
Keyword(s):  
Image Retrieval ◽  
Binary Code ◽  
Hash Functions ◽  
Image Databases ◽  
Streaming Data ◽  
Binary Codes ◽  
Retrieval Process ◽  
Retrieval Accuracy ◽  
Projection Functions

Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be recomputed to guarantee the retrieval accuracy. Recomputing the binary codes by accumulating the whole database brings a timeliness challenge to the online retrieval process. In this paper, we propose a novel online hashing framework to update the binary codes efficiently without accumulating the whole database. In our framework, the hash functions are fixed and the projection functions are introduced to learn online from the streaming data. Therefore, inefficient updating of the binary codes by accumulating the whole database can be transformed to efficient updating of the binary codes by projecting the binary codes into another binary space. The queries and the binary code database are projected asymmetrically to further improve the retrieval accuracy. The experiments on two multi-label image databases demonstrate the effectiveness and the efficiency of our method for multi-label image retrieval.

scholarly journals Improved Secure Data Transfer Using Video Steganographic Technique

Cryptography ◽  
2020 ◽  
pp. 355-372
Author(s):  
V. Lokeswara Reddy
Keyword(s):  
Information Security ◽  
Data Hiding ◽  
Data Transfer ◽  
Secret Data ◽  
Confidential Information ◽  
Video File ◽  
Video Steganography ◽  
Secret Information ◽  
High Embedding Capacity ◽  
Using Data

Information security using data hiding in video provides high embedding capacity and security. Steganography is one of the oldest data protecting methodologies deals with the embedding of data. Video Steganography hides secret information file within a video. Present day communications are treated to be “un-trusted” in terms of security, i.e. they are relatively easy to be hacked. The proposed technique is invented to hide secret information into a video file keeping two considerations in mind which are size and security of the cover video file. At the sender side, the secret information which is to be hidden is encoded into cover video file. Double layered security for the secret data can be achieved by encrypting confidential information and by embedding confidential information into cover video file frames using encrypted embedding technique.

scholarly journals Ant Colony Optimization (ACO) based Data Hiding in Image Complex Region

2018 ◽  
Vol 8 (1) ◽  
pp. 379 ◽  
Author(s):  
Sahib Khan
Keyword(s):  
Ant Colony Optimization ◽  
Data Hiding ◽  
Experimental Results ◽  
Ant Colony ◽  
Cover Image ◽  
Complex Region ◽  
Secret Information ◽  
Lsb Substitution ◽  
Least Significant Bits

This paper presents data an Ant colony optimization (ACO) based data hiding technique. ACO is used to detect complex region of cover image and afterward, least significant bits (LSB) substitution is used to hide secret information in the detected complex regions’ pixels. ACO is an algorithm developed inspired by the inborn manners of ant species. The ant leaves pheromone on the ground for searching food and provisions. The proposed ACO-based data hiding in complex region establishes an array of pheromone, also called pheromone matrix, which represents the complex region in sequence at each pixel position of the cover image. The pheromone matrix is developed according to the movements of ants, determined by local differences of the image element’s intensity. The least significant bits of complex region pixels are substituted with message bits, to hide secret information. The experimental results, provided, show the significance of the performance of the proposed method.

scholarly journals On a Class of Constant Weight Codes

10.37236/1228 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Mihai Caragiu
Keyword(s):  
Prime Power ◽  
Binary Code ◽  
Hamming Distance ◽  
Character Sums ◽  
Bch Codes ◽  
Binary Codes ◽  
Quadratic Character ◽  
Constant Weight Codes ◽  
Constant Weight ◽  
Non Linear

For any odd prime power $q$ we first construct a certain non-linear binary code $C(q,2)$ having $(q^2-q)/2$ codewords of length $q$ and weight $(q-1)/2$ each, for which the Hamming distance between any two distinct codewords is in the range $[q/2-3\sqrt q/2,\ q/2+3\sqrt q/2]$ that is, 'almost constant'. Moreover, we prove that $C(q,2)$ is distance-invariant. Several variations and improvements on this theme are then pursued. Thus, we produce other classes of binary codes $C(q,n)$, $n\geq 3$, of length $q$ that have 'almost constant' weights and distances, and which, for fixed $n$ and big $q$, have asymptotically $q^n/n$ codewords. Then we prove the possibility of extending our codes by adding the complements of their codewords. Also, by using results on Artin $L-$series, it is shown that the distribution ofthe $0$'s and $1$'s in the codewords we constructed is quasi-random. Our construction uses character sums associated with the quadratic character $\chi$ of $F_{q^n}$ in which the range of summation is $F_q$. Relations with the duals of the double error correcting BCH codes and the duals of the Melas codes are also discussed.

scholarly journals Six Fractal Codes of Biological Life:perspectives in Exobiology, Cancers Basic Research and Artificial Intelligence Biomimetism Decisions Making

2018 ◽  
Author(s):  
Jean Claude Perez
Keyword(s):  
Local Stability ◽  
Binary Code ◽  
Basic Research ◽  
Atomic Mass ◽  
Amino Acid Sequences ◽  
Binary Codes ◽  
Fractal Nature ◽  
Whole Genomes ◽  
Nested Codes ◽  
Numerical Formula

The discovery of a simple numerical formula for the projection of all the atomic mass of life-sustaining CONHSP bioatoms leads to the emergence of a set of Nested CODES unifying all the biological, genetic and genomic components by unifying them from bioatoms up to 'to whole genomes. In particular, we demonstrate the existence of a digital meta-code common to the three languages ​​of biology that are RNA, DNA and amino acid sequences. Through this meta-code, genomic and proteomic images appear almost analogous and correlated. The analysis of the textures of these images then reveals a binary code as well as an undulatory code whose analysis on the human genome makes it possible to predict the alternating bands constituting the cariotypes of the chromosomes. The application of these codes to perspectives in astrobiology, in Cancers basic research and the emergence of binary codes and regions of local stability (voting process), whose fractal nature we demonstrate, is illustrated.

Sign in / Sign up

Export Citation Format

Share Document