Enhanced Secret Image Sharing Using POB Number System

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 2017, Singh et al. constructed a secure cloud-based (2, 2) secret image sharing with the capability of tampering detection using (r, n) Permutation Ordered Binary (POB) number system. This scheme can solve the problem of secure storage of image-shares at cloud servers, and is also capable of authenticating image-shares at pixel level. However, Singh et al.’s scheme assumes that participants already know the parameters r in (r, n) POB, on which they can recover each image pixel efficiently. In fact, the distribution of parameters r is not that easy as described in their scheme, it needs secure channels and the storage of r is almost same as the share. In Singh et al.’s scheme, the authors did not show how to share the information of r among participants. In this paper, we proposed a new secret image sharing using (r, n) POB number system which is extended from Singh et al.’s framework. In our scheme, the parameters r for all image pixels are identical and are publicly published. Thus, the problem of Singh et al.’s scheme is solved. In addition, our scheme can also authenticate tampered shares at pixel level.

Cite

CITATION STYLE

APA

Liu, Y. X., & Yang, C. N. (2020). Enhanced Secret Image Sharing Using POB Number System. In Advances in Intelligent Systems and Computing (Vol. 895, pp. 94–102). Springer Verlag. https://doi.org/10.1007/978-3-030-16946-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free