Security Secret Information Hiding Based on Hash Function and Invisible ASCII Characters Replacement

2016 ◽  
Author(s):  
Feng Liu ◽  
Pengpeng Luo ◽  
Zhujuan Ma ◽  
Cheng Zhang ◽  
Yiwen Zhang ◽  
...  
Keyword(s):  
Information Hiding ◽  
Hash Function ◽  
Secret Information

A Steganography Embedding Method Based on Hamming Coding and Histogram-Preserving

2019 ◽  
Vol 33 (14) ◽  
pp. 1954039
Author(s):  
Ya-Feng Li ◽  
Ren-Er Yang ◽  
Jie Cheng ◽  
Hong-Zhu Dai
Keyword(s):  
Digital Media ◽  
Adaptive Algorithm ◽  
Information Hiding ◽  
Entropy Analysis ◽  
Hamming Codes ◽  
Secret Information ◽  
Matrix Embedding ◽  
Before And After ◽  
Histogram Preserving ◽  
Break Even Point

This paper proposes an information hiding algorithm using matrix embedding with Hamming codes and histogram preservation in order to keep the histogram of the image unchanged before and after hiding information in digital media. First, the algorithm uses matrix embedding with Hamming codes to determine the rewriting bits of the original image, rewrite and flip them, and successfully embed the secret information. Then, according to the idea of a break-even point, a balanced pixel frequency adaptive algorithm is proposed and each embedded bit of secret information is detected and compensated by the adjacent bit of histogram data, so that the histogram change of the image before and after information hiding is minimized. At present, most of the histogram distortion values after steganography are generally over 1000 or even higher. As a contrast, the method proposed in this paper can keep the histogram distortion values to be less than 1000. The feasibility and effectiveness of the algorithm are verified by relative entropy analysis as well. The experimental results also show that the algorithm performs well in steganographic analyses of images.

scholarly journals Fast Mutual Authentication Using RSA Moduli

2021 ◽  
Author(s):  
Anatoly Anisimov ◽  
Andrey Novokshonov
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Third Party ◽  
Interactive Proof ◽  
Zero Knowledge ◽  
Trusted Third Party ◽  
Secret Information ◽  
Mutual Authentication Protocol

We describe a fast three-round mutual authentication protocol for parties A and B belonging to the same coalition group. Parties A and B keep their own independent long-term private keys that are used in the process of authentication and can be used for other purposes. The scheme assumes an initial setup with a trusted third party T. This party initiates another secret information that includes factors of a large RSA modulus. For authentication, both parties must demonstrate each other the knowledge of their private keys without revealing them and the ability to factorize a large RSA modulus. Thus, the protocol based on the suggested scheme provides reciprocal authentication. The scheme possesses all desirable properties of an interactive proof, i.e., completeness, soundness, and zero-knowledge. The security of the protocol relies on assumptions of difficulty of the RSA factorization and existence of a cryptographic hash function.

scholarly journals An Improved Information Hiding Method Based on Sparse Representation

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Minghai Yao ◽  
Miao Qi ◽  
Yugen Yi ◽  
Yanjiao Shi ◽  
Jun Kong
Keyword(s):  
Sparse Representation ◽  
Information Hiding ◽  
High Capacity ◽  
Cover Image ◽  
Biometric Authentication ◽  
Secret Information ◽  
Residual Image ◽  
Representation Method ◽  
Visual Attention Mechanism ◽  
Biometric Information

A novel biometric authentication information hiding method based on the sparse representation is proposed for enhancing the security of biometric information transmitted in the network. In order to make good use of abundant information of the cover image, the sparse representation method is adopted to exploit the correlation between the cover and biometric images. Thus, the biometric image is divided into two parts. The first part is the reconstructed image, and the other part is the residual image. The biometric authentication image cannot be restored by any one part. The residual image and sparse representation coefficients are embedded into the cover image. Then, for the sake of causing much less attention of attackers, the visual attention mechanism is employed to select embedding location and embedding sequence of secret information. Finally, the reversible watermarking algorithm based on histogram is utilized for embedding the secret information. For verifying the validity of the algorithm, the PolyU multispectral palmprint and the CASIA iris databases are used as biometric information. The experimental results show that the proposed method exhibits good security, invisibility, and high capacity.

An efficient (t,n) threshold quantum secret sharing without entanglement

2016 ◽  
Vol 30 (12) ◽  
pp. 1650138 ◽  
Author(s):  
Huawang Qin ◽  
Yuewei Dai
Keyword(s):  
Secret Sharing ◽  
Hash Function ◽  
Quantum Secret Sharing ◽  
Utilization Efficiency ◽  
Single Particles ◽  
Secret Information

An efficient [Formula: see text] threshold quantum secret sharing (QSS) scheme is proposed. In our scheme, the Hash function is used to check the eavesdropping, and no particles need to be published. So the utilization efficiency of the particles is real 100%. No entanglement is used in our scheme. The dealer uses the single particles to encode the secret information, and the participants get the secret through measuring the single particles. Compared to the existing schemes, our scheme is simpler and more efficient.

scholarly journals Fast Mutual Authentication Using RSA Moduli

2021 ◽  
Author(s):  
Anatoly Anisimov ◽  
Andrey Novokshonov
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Third Party ◽  
Interactive Proof ◽  
Zero Knowledge ◽  
Trusted Third Party ◽  
Secret Information ◽  
Mutual Authentication Protocol

We describe a fast three-round mutual authentication protocol for parties A and B belonging to the same coalition group. Parties A and B keep their own independent long-term private keys that are used in the process of authentication and can be used for other purposes. The scheme assumes an initial setup with a trusted third party T. This party initiates another secret information that includes factors of a large RSA modulus. For authentication, both parties must demonstrate each other the knowledge of their private keys without revealing them and the ability to factorize a large RSA modulus. Thus, the protocol based on the suggested scheme provides reciprocal authentication. The scheme possesses all desirable properties of an interactive proof, i.e., completeness, soundness, and zero-knowledge. The security of the protocol relies on assumptions of difficulty of the RSA factorization and existence of a cryptographic hash function.

scholarly journals An Efficient Information Hiding Mechanism Based on Confusion Component over Local Ring and Moore-Penrose Pseudo Inverse

2021 ◽  
Vol 20 ◽  
pp. 24-36
Author(s):  
Nabilah Abughazalah ◽  
Majid Khan
Keyword(s):  
Present Article ◽  
Local Ring ◽  
Information Hiding ◽  
Galois Field ◽  
Ring Structure ◽  
Basic Requirement ◽  
Secret Information ◽  
Substitution Boxes ◽  
Efficient Information ◽  
Pseudo Inverse

The basic requirement by adding confusion is to ensure the confidentiality of the secret information. In the present article, we have suggested new methodology for the construction of nonlinear confusion component. This confusion component is used for enciphering the secret information and hiding it in a cover medium by proposed scheme. The proposed scheme is based on ring structure instead of Galois field mechanism. To provide multi-layer security, secret information is first encrypted by using confusion component and then utilized three different substitution boxes (S-boxes) to hide into the cover medium

Smart Home Privacy Protection Based on the Improved LSB Information Hiding

2021 ◽  
pp. 2160005
Author(s):  
Lina Yang ◽  
Haiyu Deng ◽  
Ren Ping Liu ◽  
Patrick Wang ◽  
Xiaocui Dang ◽  
...  
Keyword(s):  
Information Hiding ◽  
Privacy Protection ◽  
Smart Home ◽  
Data Encryption ◽  
The Internet ◽  
Least Significant Bit ◽  
Secret Data ◽  
Secret Information ◽  
Protection Method ◽  
Using Data

Smart home is an emerging form of the Internet of Things (IoT), enabling people to enjoy a convenient and intelligent life. The data generated by smart home devices are transmitted through the public channel, which is not secure enough, so the secret data in smart home are easily intercepted by malicious adversaries. In order to solve this problem, this paper proposes a smart home privacy protection method combining DES encryption and the improved Least Significant Bit (LSB) information hiding algorithm, changing the practice of directly exposing smart home secret information to the Internet, first, using Data Encryption Standard (DES) encryption to encrypt the smart home information and second, the improved LSB information hiding algorithm is used to hide the ciphertext, so that the adversary cannot detect the smart home secret information. The goal of the scheme is to provide a double protection for the secure transmission of the smart home secret information. If an attacker wants to carry out an attack, it has to break through at least two defense lines, which seems impossible to do. Experiment results show that the improved LSB algorithm is more robust than the existing algorithms, and it is very safe. Therefore, the scheme proposed in this paper is very practical for protecting the smart home secret information.

Sign in / Sign up

Export Citation Format

Share Document