Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

A Reversible Data Hiding Algorithm Based on Secret Sharing

Xin Jin*, Lanxin Su, Jitao Huang

School of Computer and Software, Nanjing University of Information Science & Technology, Nanjing, 210044, China

* Corresponding Author: Xin Jin. Email: email

Journal of Information Hiding and Privacy Protection 2021, 3(2), 69-82. https://doi.org/10.32604/jihpp.2021.014108

Abstract

In traditional secret sharing schemes, all shared images containing secret segments are needed to recover secret information. In this paper, a reversible data hiding scheme based on Shamir secret sharing is used. Secret information can be recovered even if only part of the encrypted sharing is owned. This method can reduce the vulnerability of traditional encryption sharing schemes to attack. Before uploading the secret information to the cloud server, embed the encrypted n segments of secret information into n different pictures. The receiver downloads t images from the cloud server (t < n), extracts the encrypted information using the watermark extraction algorithm, and obtains the original secret information after decryption through Shamir secret sharing.

Keywords


Cite This Article

APA Style
Jin, X., Su, L., Huang, J. (2021). A reversible data hiding algorithm based on secret sharing. Journal of Information Hiding and Privacy Protection, 3(2), 69-82. https://doi.org/10.32604/jihpp.2021.014108
Vancouver Style
Jin X, Su L, Huang J. A reversible data hiding algorithm based on secret sharing. J Inf Hiding Privacy Protection . 2021;3(2):69-82 https://doi.org/10.32604/jihpp.2021.014108
IEEE Style
X. Jin, L. Su, and J. Huang "A Reversible Data Hiding Algorithm Based on Secret Sharing," J. Inf. Hiding Privacy Protection , vol. 3, no. 2, pp. 69-82. 2021. https://doi.org/10.32604/jihpp.2021.014108



cc Copyright © 2021 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1350

    View

  • 1063

    Download

  • 0

    Like

Share Link