scholarly journals Lossless Data Hiding in LWE-Encrypted Domains Based on Key-Switching

2021 ◽  
Vol 13 (4) ◽  
pp. 71-89
Author(s):  
Ting-ting Su ◽  
Yan Ke ◽  
Yi Ding ◽  
Jia Liu
Keyword(s):  
Data Hiding ◽  
Experimental Results ◽  
Third Party ◽  
Least Significant Bit ◽  
Private Key ◽  
The Third ◽  
Lossless Data Hiding ◽  
Learning With Errors ◽  
Key Switching ◽  
Embedding Rate

This paper proposes a lossless data hiding scheme in learning with errors (LWE)-encrypted domain based on key-switching technique. Lossless data hiding and extraction could be realized by a third party without knowing the private key for decryption. Key-switching-based least-significant-bit (KSLSB) data hiding method has been designed during the lossless data hiding process. The owner of the plaintext first encrypts the plaintext by using LWE encryption and uploads ciphertext to a (trusted or untrusted) third server. Then the server performs KSLSB to obtain a marked ciphertext. To enable the third party to manage ciphertext flexibly and keep the plaintext secret, the embedded data can be extracted from the marked ciphertext without using the private key of LWE encryption in the proposed scheme. Experimental results demonstrate that data hiding would not compromise the security of LWE encryption, and the embedding rate is 1 bit per bit of plaintext without introducing any loss into the directly decrypted result.

scholarly journals Application of Text Message Held in Image Using Combination of Least Significant Bit Method and One Time Pad

2019 ◽  
Vol 13 (4) ◽  
pp. 323
Author(s):  
Eferoni Ndruru ◽  
Taronisokhi Zebua
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Data Hiding ◽  
Text Message ◽  
Third Party ◽  
Least Significant Bit ◽  
Market Basket Analysis ◽  
Market Basket ◽  
Sales Data ◽  
The Third

Stenography and security are one of the techniques to develop art in securing data. Stenography has the most important aspect is the level of security in data hiding, which makes the third party unable to detect some information that has been secured. Usually used to hide textinformationThe (LSB) algorithm is one of the basic algorithms proposed by Arawak and Giant in 1994 to determine the frequent item set for Boolean association rules. A priory algorithm includes the type of association rules in data mining. The rule that states associations between attributes are often called affinity analysis or market basket analysis. OTP can be widely used in business. With the knowledge of text message, concealment techniques will make it easier for companies to know the number of frequencies of sales data, making it easier for companies to take an appropriate transaction action. The results of this study, hide the text message on the image (image) by using a combination of LSB and Otp methods.

scholarly journals Secure E-Health: Managing Risks to Patient Personal Identity

2017 ◽  
Vol 13 (24) ◽  
pp. 377
Author(s):  
Haryadi Amran D. ◽  
Mike Yuliana ◽  
Reni Soelistijorini ◽  
Amang Sudarsono
Keyword(s):  
Personal Identity ◽  
Experimental Results ◽  
Third Party ◽  
Computational Time ◽  
Digital Society ◽  
The Third ◽  
The Third Party ◽  
Anonymous Credential

As we are becoming a digital society, it is very important for us to protect the security of personal identity in any transactions. One of the efforts to maintain the security of personal identity is by unrevealed our data more than necessary. Anonymous credential allows an organization to give a credential to a user. This credential consists of user attribute such as address and date of birth. By using this credential, the user can prove the ownership to the third party without revealing the information that contained in credential information more than necessary. This paper proposes secure ehealth system that focuses on proving protocol to reveal and prove some of the patient attributes while others remain hidden, so the security of personal identity more awake. The experimental results showed that the computational time of each proving protocol less than 1 second.

scholarly journals Reversible Data Hiding Based on DNA Computing

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Bin Wang ◽  
Yingjie Xie ◽  
Shihua Zhou ◽  
Changjun Zhou ◽  
Xuedong Zheng
Keyword(s):  
Information Security ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Dna Computing ◽  
Experimental Results ◽  
Signal To Noise ◽  
Histogram Modification ◽  
Biological Technology ◽  
Embedding Rate ◽  
Great Development

Biocomputing, especially DNA, computing has got great development. It is widely used in information security. In this paper, a novel algorithm of reversible data hiding based on DNA computing is proposed. Inspired by the algorithm of histogram modification, which is a classical algorithm for reversible data hiding, we combine it with DNA computing to realize this algorithm based on biological technology. Compared with previous results, our experimental results have significantly improved the ER (Embedding Rate). Furthermore, some PSNR (peak signal-to-noise ratios) of test images are also improved. Experimental results show that it is suitable for protecting the copyright of cover image in DNA-based information security.

scholarly journals On the Security of Practical Mail User Agents against Cache Side-Channel Attacks

2020 ◽  
Vol 10 (11) ◽  
pp. 3770
Author(s):  
Hodong Kim ◽  
Hyundo Yoon ◽  
Youngjoo Shin ◽  
Junbeom Hur
Keyword(s):  
Third Party ◽  
Side Channel ◽  
Software Components ◽  
Side Channel Attack ◽  
Side Channel Attacks ◽  
User Agent ◽  
Root Cause ◽  
Private Key ◽  
The Third ◽  
And Control

Mail user agent (MUA) programs provide an integrated interface for email services. Many MUAs support email encryption functionality to ensure the confidentiality of emails. In practice, they encrypt the content of an email using email encryption standards such as OpenPGP or S/MIME, mostly implemented using GnuPG. Despite their widespread deployment, there has been insufficient research on their software structure and the security dependencies among the software components of MUA programs. In order to understand the security implications of the structures and analyze any possible vulnerabilities of MUA programs, we investigated a number of MUAs that support email encryption. As a result, we found severe vulnerabilities in a number of MUAs that allow cache side-channel attacks in virtualized desktop environments. Our analysis reveals that the root cause originates from the lack of verification and control over the third-party cryptographic libraries that they adopt. In order to demonstrate this, we implemented a cache side-channel attack on RSA in GnuPG and then conducted an evaluation of the vulnerability of 13 MUAs that support email encryption in Ubuntu 14.04, 16.04 and 18.04. Based on our experiment, we found that 10 of these MUA programs (representing approximately 77% of existing MUA programs) allow the installation of a vulnerable version of GnuPG, even when the latest version of GnuPG, which is secure against most cache side-channel attacks, is in use. In order to substantiate the importance of the vulnerability we discovered, we conducted a FLUSH+RELOAD attack on these MUA programs and demonstrated that the attack restored 92% of the bits of the 2048-bit RSA private key when the recipients read a single encrypted email.

scholarly journals Viewing Direction Based LSB Data Hiding in 360° Videos

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1527
Author(s):  
Dang Ninh Tran ◽  
Hans-Jürgen Zepernick ◽  
Thi My Chinh Chu
Keyword(s):  
Data Hiding ◽  
Gaussian Mixture Models ◽  
Visual Quality ◽  
Structural Similarity ◽  
Gaussian Mixture ◽  
Experimental Results ◽  
Weight Functions ◽  
Least Significant Bit ◽  
Secret Data ◽  
The Impact

In this paper, we propose a viewing direction based least significant bit (LSB) data hiding method for 360° videos. The distributions of viewing direction frequency for latitude and longitude are used to control the amount of secret data to be hidden at the latitude, longitude, or both latitude and longitude of 360° videos. Normalized Gaussian mixture models mimicking the viewing behavior of humans are formulated to define data hiding weight functions for latitude, longitude, and both latitude and longitude. On this basis, analytical expressions for the capacity offered by the proposed method to hide secret data in 360° cover videos are derived. Numerical results for the capacity using different numbers of bit planes and popular 360° video resolutions for data hiding are provided. The fidelity of the proposed method is assessed in terms of the peak signal-to-noise ratio (PSNR), weighted-to-spherically uniform PSNR (WS-PSNR), and non-content-based perceptual PSNR (NCP-PSNR). The experimental results illustrate that NCP-PSNR returns the highest fidelity because it gives lower weights to the impact of LSB data hiding on fidelity outside the front regions near the equator. The visual quality of the proposed method as perceived by humans is assessed using the structural similarity (SSIM) index and the non-content-based perceptual SSIM (NCP-SSIM) index. The experimental results show that both SSIM-based metrics are able to account for the spatial perceptual information of different scenes while the PSNR-based fidelity metrics cannot exploit this information. Furthermore, NCP-SSIM reflects much better the impact of the proposed method on visual quality with respect to viewing directions compared to SSIM.

scholarly journals Reversible Data Hiding Based on Adaptive Block Selection Strategy

2020 ◽  
Vol 12 (1) ◽  
pp. 157-168
Author(s):  
Dan Huang ◽  
Fangjun Huang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Visual Quality ◽  
Original Method ◽  
Experimental Results ◽  
Selection Strategy ◽  
Original Image ◽  
Histogram Shifting ◽  
Carrier Image ◽  
Embedding Rate

Recently, a reversible data hiding (RDH) method was proposed based on local histogram shifting. This method selects the peak bin of the local histogram as a reference and expands the two neighboring bins of the peak bin to carry the message bits. Since the peak bin keeps unchanged during the embedding process, the neighboring bins can be easily identified at the receiver end, and the original image can be restored completely while extracting the embedded data. In this article, as an extension of the algorithm, the authors propose an RDH scheme based on adaptive block selection strategy. Via a new block selection strategy, those blocks of the carrier image may carry more message bits whereas introducing less distortion will take precedence over data hiding. Experimental results demonstrate that higher visual quality can be obtained compared with the original method, especially when the embedding rate is low.

Optimal Bit Plane Arrangement for Image Size-Performance Tradeoff

2013 ◽  
Vol 705 ◽  
pp. 327-331
Author(s):  
Gwang Gil Jeon
Keyword(s):  
Experimental Results ◽  
Image Size ◽  
Least Significant Bit ◽  
The Third ◽  
Binary Signal ◽  
Plane Image ◽  
Bit Plane ◽  
And Performance ◽  
Bit Planes ◽  
Performance Tradeoff

This paper discusses the issue of tradeoff between image size and performance in PSNR on bit plane image. A bit plane of a digital discrete signal is a set of bits indicate a presented bit plane in each of the binary numbers depicting the image. Image can be converted into a series of binary signal by shattering them up into their bit planes. The 0thbit plane is the least significant bit and the last bit plane is the most significant bit. Experimental results show that the best tradeoff is using the third to the seventh bit planes.

scholarly journals Pixel Grouping of Digital Images for Reversible Data Hiding

2020 ◽  
Author(s):  
Sultan Abdul Hasib ◽  
Hussain Md Abu Nyeem
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Computational Models ◽  
Digital Images ◽  
Rate Distortion ◽  
Experimental Results ◽  
Triangular Shape ◽  
Original Scheme ◽  
Pixel Grouping ◽  
Embedding Rate

Pixel Grouping (PG) of digital images has been a key consideration in recent development of the Reversible Data Hiding (RDH) schemes. While a PG kernel with neighborhood pixels helps compute image groups for better embedding rate-distortion performance, only horizontal neighborhood pixel group of size 1×3 has so far been considered. In this paper, we formulate PG kernels of sizes 3×1, 2×3 and 3×2 and investigate their effect on the rate-distortion performance of a prominent PG-based RDH scheme. Specially, a kernel of size 3×2 (or 2×3) that creates a pair of pixel-trios having triangular shape and offers a greater possible correlation among the pixels. This kernel thus can be better utilized for improving a PG-based RDH scheme. Considering this, we develop and present an improved PG-based RDH scheme and the computational models of its key processes. Experimental results demonstrated that our proposed RDH scheme offers reasonably better  embedding rate-distortion performance than the original scheme.

Resolving tension from the third-party forgiveness effect

2014 ◽  
Author(s):  
Jaclyn M. Moloney ◽  
Chelsea A. Reid ◽  
Jody L. Davis ◽  
Jeni L. Burnette ◽  
Jeffrey D. Green
Keyword(s):  
Third Party ◽  
The Third ◽  
The Third Party
Sign in / Sign up

Export Citation Format

Share Document