entropy-logo

Journal Browser

Journal Browser

Information Hiding and Coding Theory

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: closed (28 February 2022) | Viewed by 13221

Special Issue Editors


E-Mail Website
Guest Editor
School of Computing and Information Systems, Melbourne School of Engineering, University of Melbourne, Parkville, VIC 3010, Australia
Interests: quantum computing; cryptography; sequences for communications and security; coding theory

E-Mail Website
Guest Editor
Department of Computer Science, National Institute of Technology, Tokyo College, 1220-2, Kunugidamachi, Hachioji, Tokyo 193-0997, Japan
Interests: information hiding; sequence design; information theory; communication system

Special Issue Information

Dear Colleagues,

Information hiding technologies such as steganography and watermarking have played important roles in multimedia security and services over the last fifty years. In the last decade, alongside the proliferation of the Internet technologies, information hiding has been increasingly used to provide specialized security guarantees to medical records of scans, X-rays, and reports. The use of information hiding technologies in commercial applications is becoming more popular due to the extraordinary unique special security features they provide to the domain, which are otherwise difficult or expensive to realize using regular methods. The coding theory, which was initially developed to solve errors in communication channels can achieve information hiding primitives. When used in information hiding applications, custom specific coding and decoding techniques are required. Furthermore, the choice of hiding techniques must respect the domain-specific needs of the multimedia application and, accordingly, techniques from machine learning are required to support their use in actual practice.  

We intend for this Special Issue to serve as a forum for the presentation of novel and improved techniques for information hiding and coding theory in modern commercial multimedia and medical technologies. Relevant topics include novel coding and decoding techniques in conjunction with appropriate signal processing of the relevant multimedia cover data. Our focus is on both fundamental and application-specific analyses of modern information hiding techniques using machine learning and other statistical analysis techniques using information theory.  

We invite authors to submit previously unpublished contributions in any area related to information hiding and coding including, but not limited to, the following subtopics: 

- Theory of information hiding;
- Coding and decoding for information hiding;
- Embedding functions for information hiding;
- Signal processing for information hiding;
- Spread spectrum-based information hiding;
- Watermarking;
- Covert communications;
- Fingerprinting codes;
- Machine learning and information hiding;
- Deep steganography (extension of machine learning with steganography);
- Steganographic data security for virtual healthcare (relevant to COVID-19 as the use of telehealth has become more pronounced and could remain this way for 3 to 5 years).

Prof. Dr. Udaya Parampalli
Prof. Dr. Tetsuya Kojima
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • information hiding
  • watermarking
  • spread spectrum steganography
  • coding and decoding for watermarking
  • machine learning for information hiding processing

Published Papers (5 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Jump to: Other

17 pages, 632 KiB  
Article
Blind Speech Watermarking Method with Frame Self-Synchronization Based on Spread-Spectrum Using Linear Prediction Residue
by Takuto Isoyama, Shunsuke Kidani and Masashi Unoki
Entropy 2022, 24(5), 677; https://doi.org/10.3390/e24050677 - 11 May 2022
Cited by 2 | Viewed by 1550
Abstract
State-of-the-art speech watermarking techniques enable speech signals to be authenticated and protected against any malicious attack to ensure secure speech communication. In general, reliable speech watermarking methods must satisfy four requirements: inaudibility, robustness, blind-detectability, and confidentiality. We previously proposed a method of non-blind [...] Read more.
State-of-the-art speech watermarking techniques enable speech signals to be authenticated and protected against any malicious attack to ensure secure speech communication. In general, reliable speech watermarking methods must satisfy four requirements: inaudibility, robustness, blind-detectability, and confidentiality. We previously proposed a method of non-blind speech watermarking based on direct spread spectrum (DSS) using a linear prediction (LP) scheme to solve the first two issues (inaudibility and robustness) due to distortion by spread spectrum. This method not only effectively embeds watermarks with small distortion but also has the same robustness as the DSS method. There are, however, two remaining issues with blind-detectability and confidentiality. In this work, we attempt to resolve these issues by developing an approach called the LP-DSS scheme, which takes two forms of data embedding for blind detection and frame synchronization. We incorporate blind detection with frame synchronization into the scheme to satisfy blind-detectability and incorporate two forms of data embedding process, front-side and back-side embedding for blind detection and frame synchronization, to satisfy confidentiality. We evaluated these improved processes by carrying out four objective tests (PESQ, LSD, Bit-error-rate, and accuracy of frame synchronization) to determine whether inaudibility and blind-detectability could be satisfied. We also evaluated all combinations with the two forms of data embedding for blind detection with frame synchronization by carrying out BER tests to determine whether confidentiality could be satisfied. Finally, we comparatively evaluated the proposed method by carrying out ten robustness tests against various processing and attacks. Our findings showed that an inaudible, robust, blindly detectable, and confidential speech watermarking method based on the proposed LP-DSS scheme could be achieved. Full article
(This article belongs to the Special Issue Information Hiding and Coding Theory)
Show Figures

Figure 1

16 pages, 1274 KiB  
Article
Speech Watermarking Method Using McAdams Coefficient Based on Random Forest Learning
by Candy Olivia Mawalim and Masashi Unoki
Entropy 2021, 23(10), 1246; https://doi.org/10.3390/e23101246 - 25 Sep 2021
Cited by 6 | Viewed by 1733
Abstract
Speech watermarking has become a promising solution for protecting the security of speech communication systems. We propose a speech watermarking method that uses the McAdams coefficient, which is commonly used for frequency harmonics adjustment. The embedding process was conducted, using bit-inverse shifting. We [...] Read more.
Speech watermarking has become a promising solution for protecting the security of speech communication systems. We propose a speech watermarking method that uses the McAdams coefficient, which is commonly used for frequency harmonics adjustment. The embedding process was conducted, using bit-inverse shifting. We also developed a random forest classifier, using features related to frequency harmonics for blind detection. An objective evaluation was conducted to analyze the performance of our method in terms of the inaudibility and robustness requirements. The results indicate that our method satisfies the speech watermarking requirements with a 16 bps payload under normal conditions and numerous non-malicious signal processing operations, e.g., conversion to Ogg or MP4 format. Full article
(This article belongs to the Special Issue Information Hiding and Coding Theory)
Show Figures

Figure 1

11 pages, 2394 KiB  
Article
Consideration for Affects of an XOR in a Random Number Generator Using Ring Oscillators
by Ryoichi Sato, Yuta Kodera, Md. Arshad Ali, Takuya Kusaka, Yasuyuki Nogami and Robert H. Morelos-Zaragoza
Entropy 2021, 23(9), 1168; https://doi.org/10.3390/e23091168 - 05 Sep 2021
Cited by 3 | Viewed by 2269
Abstract
A cloud service to offer entropy has been paid much attention to. As one of the entropy sources, a physical random number generator is used as a true random number generator, relying on its irreproducibility. This paper focuses on a physical random number [...] Read more.
A cloud service to offer entropy has been paid much attention to. As one of the entropy sources, a physical random number generator is used as a true random number generator, relying on its irreproducibility. This paper focuses on a physical random number generator using a field-programmable gate array as an entropy source by employing ring oscillator circuits as a representative true random number generator. This paper investigates the effects of an XOR gate in the oscillation circuit by observing the output signal period. It aims to reveal the relationship between inputs and the output through the XOR gate in the target generator. The authors conduct two experiments to consider the relevance. It is confirmed that combining two ring oscillators with an XOR gate increases the complexity of the output cycle. In addition, verification using state transitions showed that the probability of the state transitions was evenly distributed by increasing the number of ring oscillator circuits. Full article
(This article belongs to the Special Issue Information Hiding and Coding Theory)
Show Figures

Figure 1

20 pages, 13007 KiB  
Article
Generalized Reversible Data Hiding with Content-Adaptive Operation and Fast Histogram Shifting Optimization
by Limengnan Zhou, Hongyu Han and Hanzhou Wu
Entropy 2021, 23(7), 917; https://doi.org/10.3390/e23070917 - 19 Jul 2021
Cited by 3 | Viewed by 2118
Abstract
Reversible data hiding (RDH) has become a hot spot in recent years as it allows both the secret data and the raw host to be perfectly reconstructed, which is quite desirable in sensitive applications requiring no degradation of the host. A lot of [...] Read more.
Reversible data hiding (RDH) has become a hot spot in recent years as it allows both the secret data and the raw host to be perfectly reconstructed, which is quite desirable in sensitive applications requiring no degradation of the host. A lot of RDH algorithms have been designed by a sophisticated empirical way. It is not easy to extend them to a general case, which, to a certain extent, may have limited their wide-range applicability. Therefore, it motivates us to revisit the conventional RDH algorithms and present a general framework of RDH in this paper. The proposed framework divides the system design of RDH at the data hider side into four important parts, i.e., binary-map generation, content prediction, content selection, and data embedding, so that the data hider can easily design and implement, as well as improve, an RDH system. For each part, we introduce content-adaptive techniques that can benefit the subsequent data-embedding procedure. We also analyze the relationships between these four parts and present different perspectives. In addition, we introduce a fast histogram shifting optimization (FastHiSO) algorithm for data embedding to keep the payload-distortion performance sufficient while reducing the computational complexity. Two RDH algorithms are presented to show the efficiency and applicability of the proposed framework. It is expected that the proposed framework can benefit the design of an RDH system, and the introduced techniques can be incorporated into the design of advanced RDH algorithms. Full article
(This article belongs to the Special Issue Information Hiding and Coding Theory)
Show Figures

Figure 1

Other

Jump to: Research

10 pages, 1163 KiB  
Brief Report
A Confidential QR Code Approach with Higher Information Privacy
by Pei-Yu Lin, Wen-Shao Lan, Yi-Hui Chen and Wen-Chuan Wu
Entropy 2022, 24(2), 284; https://doi.org/10.3390/e24020284 - 16 Feb 2022
Cited by 7 | Viewed by 3344
Abstract
In present times, barcode decoders on mobile phones can extract the data content of QR codes. However, this convenience raises concerns about security issues when using QR codes to transmit confidential information, such as e-tickets, coupons, and other private data. Moreover, current secret [...] Read more.
In present times, barcode decoders on mobile phones can extract the data content of QR codes. However, this convenience raises concerns about security issues when using QR codes to transmit confidential information, such as e-tickets, coupons, and other private data. Moreover, current secret hiding techniques are unsuitable for QR code applications since QR codes are module-oriented, which is different from the pixel-oriented hiding manner. In this article, we propose an algorithm to conceal confidential information by changing the modules of the QR Code. This new scheme designs the triple module groups based on the concept of the error correction capability. Additionally, this manner can conceal two secret bits by changing only one module, and the amount of hidden confidential information can be twice the original amount. As a result, the ordinary data content (such as URL) can be extracted correctly from the generated QR code by any barcode decoders, which does not affect the readability of scanning. Furthermore, only authorized users with the secret key can further extract the concealed confidential information. This designed scheme can provide secure and reliable applications for the QR system. Full article
(This article belongs to the Special Issue Information Hiding and Coding Theory)
Show Figures

Figure 1

Back to TopTop