A High Capacity Test Disguise Method Combined With Interpolation Backup and Double Authentications

A High Capacity Test Disguise Method Combined With Interpolation Backup and Double Authentications

Hai Lu, Liping Shao, Qinglong Wang
Copyright: © 2021 |Pages: 23
DOI: 10.4018/ijdcf.295815
Article PDF Download
Open access articles are freely available for download

Abstract

To improve the hidden capacity of a single question, further avoid the absence of authentication and provide self-repair ability, this paper proposes a high capacity test disguise method combined with interpolation backup and double authentications. Firstly, secret byte sequence is backed up and further encoded to a backup index sequence by secret information backup and encoding strategy. Secondly, a test question database divided into eight sets is created. Finally, the backup index sequence is disguised as a stego test paper using 24 different candidate answer orders and 4-bit hash values. In restoration, double authentications are applied to authenticate candidate restored value, and the most reliable candidate restored values are obtained by the reliable calculation to reconstruct secret information. The experimental results and analysis show that the proposed method can distinguish error candidate restored values, and calculate the reliability of each restored byte. Moreover, it has excellent self-repair ability with a higher hidden capacity of a single question.
Article Preview
Top

Introduction

Information hiding is a technique to hide secret information in other irrelevant carriers to make embedded information invisible. Traditional information hiding usually modifies carrier redundancy for embedding. However, it is challenging to escape detections from steganalysis for it always leaves modification traces. To address it, CIH (coverless information hiding) is proposed. Unlike modification-based information hiding, CIH generates or searches stego carriers according to secret information directly. In CIH, SCIH (search-based CIH) is a typical class of strategies. The main idea of SCIH is finding appropriate carriers from a big database and using keywords following location tags to express secret information.

According to different properties of text and image, SCIH has two categories: one is SCIHT (SCIH for text), the other is SCIHI(SCIH for image).

SCIHT usually regarded text features as location tags to mark positions of secrets such as radicals of Chinese characters, hash values about series of Chinese character, ranks of English words, and so on. For example, Chen et al. (2015) regarded Chinese character radicals appeared in the top 50 as location tags and used Chinese characters or words following location tags as keywords. To avoid the extraction confusion in the work of Chen et al. (2015), Zhou et al. (2016b) restricted the range of location tags to the first appearing top 50 radicals in texts, and the hidden information following location tags must be a single character. Chen et al. (2017) further transformed a series of ijdcf.295815.m01 Chinese characters into ijdcf.295815.m02-bit hash value as location tags to extract secret Chinese words following them. To enhance the hidden capacity of the work of Chen et al. (2017), Chen et al. (2018) regarded the high-frequency combination of Chinese word following location tags as keywords. To reduce the number of texts in database and improve the success rate of secret matching, Xia et al. (2017) used 12 predefined positions as location tags in one text, regarded LSBs of located Chinese characters as keywords. Based on English linguistic characteristics, Zhang et al. (2017a) and Zhang et al. (2017b) employed both the word rank map and the frequent word distance to express secret information.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 3 Issues (2022)
Volume 13: 6 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing