Robust Secret Image Sharing Scheme Against Noise in Shadow Images

Sun, Yuyuan; Lu, Yuliang; Yan, Xuehu; Liu, Lintao; Li, Longlong

doi:10.1109/access.2021.3056893

Cited by 20 publications

(6 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…What is more, the RSS scheme can be applied in the situation where the number of shares is large [36]. Also, we can apply RSS in other fields such as robust secret image sharing and threshold private set intersection [37,38].…”

Section: Discussionmentioning

confidence: 99%

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

Zhang

Yang

Fan

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Robust secret sharing (RSS) is an extension of secret sharing, which can reconstruct a secret correctly even if any t shares are incorrect. The existing scheme would not effectively achieve fairness. Moreover, even for an optimal scheme, RSS still has the problem that one party is verified by multiple parties, leading to expensive communication costs. In this work, we construct a blockchain-aided RSS scheme that can ensure decentralization and fairness. The central building block for our scheme to handle a rushing adversary is a bulletin board we implement on the InterPlanetary File System. Furthermore, we design a monetary penalty mechanism to impose real penalties on corrupt parties. Each participant either uploads his share correctly or loses his deposit. In addition, our scheme eliminates considerable communication between participants. Compared with the previous schemes, our scheme has a lower communication complexity, which is close to O ˜ n . We conduct experiments to show the performance of our scheme. To our knowledge, this is the first implementation of a fair RSS scheme. For shares with a length of 128 bits, the time for each participant to execute the verification phase is 470 ms.

show abstract

Section: Discussionmentioning

confidence: 99%

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

Zhang

Yang

Fan

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Some of the recent related works on image steganography are listed as follows: Sun et al [24] proposed Cloud Eyes, a cloud-based antimalware system. The proposed system provided efficient and trusted security services to the devices in the IoT network.…”

Section: Related Workmentioning

confidence: 99%

SSII: Secured and High-Quality Steganography Using Intelligent Hybrid Optimization Algorithms for IoT

et al. 2021

View full text Add to dashboard Cite

Internet of Things (IoT) is a domain where the transfer of big data is taking place in every single second. The security of these data is a challenging task; however, security challenges can be mitigated with cryptography and steganography techniques. These techniques are crucial when dealing with user authentication and data privacy. In the proposed work, a highly secured technique is proposed using IoT protocol and steganography. This work proposes an image steganography procedure by utilizing the combination of various algorithms that build the security of the secret data by utilizing Binary bit-plane decomposition (BBPD) based image encryption technique. Thereafter a Salp Swarm Optimization Algorithm (SSOA) based adaptive embedding process is proposed to increase the payload capacity by setting different parameters in the steganographic embedding function for edge and smooth blocks. Here the SSOA algorithm is used to localize the edge and smooth blocks efficiently. Then, the hybrid Fuzzy Neural Network with a backpropagation learning algorithm is used to enhance the quality of the stego images. Then these stego images are transferred to the destination in the highly secured protocol of IoT. The proposed steganography technique shows better results in terms of security, image quality and the payload capacity in comparison with the existing state of art methods.

show abstract

“…In 2002, Thien and Lin realized SIS for the first time [3]. Many researches focus on SIS with various realizations [4][5][6], and continuously study the applications [7][8][9] and improvements [10][11][12][13]. With the development of network technology, users are increasingly demanding the security, robustness and efficiency of secret image transmission.…”

Section: Introductionmentioning

confidence: 99%

“…The following analyses support three payload situations from (n, n)-threshold IHSD-PMSISS. According to Equation ( 7), the embedding rate of (n, n)-threshold IHSD-PMSISS in 2-bit payload denoted by ER I HSD−PMSISS 2−bit is calculated in Equation (13).…”

mentioning

confidence: 99%

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

Xing

Yan

et al. 2022

Entropy

Self Cite

View full text Add to dashboard Cite

(k,n)-threshold secret image sharing (SIS) protects an image by dividing it into n shadow images. The secret image will be recovered as we gather k or more shadow images. In complex networks, the security, robustness and efficiency of protecting images draws more and more attention. Thus, we realize multiple secret images sharing (MSIS) by information hiding in the sharing domain (IHSD) and propose a novel and general (n,n)-threshold IHSD-MSIS scheme (IHSD-MSISS), which can share and recover two secret images simultaneously. The proposed scheme spends less cost on managing and identifying shadow images, and improves the ability to prevent malicious tampering. Moreover, it is a novel approach to transmit important images with strong associations. The superiority of (n,n)-threshold IHSD-MSISS is in fusing the sharing phases of two secret images by controlling randomness of SIS. We present a general construction model and algorithms of the proposed scheme. Sufficient theoretical analyses, experiments and comparisons show the effectiveness of the proposed scheme.

show abstract

Robust Secret Image Sharing Scheme Against Noise in Shadow Images

Cited by 20 publications

References 30 publications

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

Fair and Efficient Robust Secret Sharing Scheme against Rushing Adversaries

SSII: Secured and High-Quality Steganography Using Intelligent Hybrid Optimization Algorithms for IoT

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

Contact Info

Product

Resources

About