Order reprints

Ramp secret image sharing

Xuehu Yan Longlong Li Lintao Liu Yuliang Lu Xianhua Song

*Corresponding author: Xuehu Yan publictiger@126.com

MBE2019,5,4433doi:10.3934/mbe.2019221

Secret image sharing (SIS) belongs to but differs from secret sharing. In general, conventional (k,n) threshold SIS has the shortcoming of “all-or-nothing”. In this article, first we introduce ramp SIS definition. Then we propose a $(k_1,k_2,n)$ ramp SIS based on the Chinese remainder theorem (CRT). In the proposed scheme, on the one hand, when we collect any $k_1$ or more and less than $k_2$ shadows, the secret image will be disclosed in a progressive way. On the other hand, when we collect any $k_2$ or more shadows, the secret image will be disclosed losslessly. Furthermore, the disclosing method is only modular arithmetic, which can be used in some real-time applications. We give theoretical analyses and experiments to show the effectiveness of the proposed scheme.

Please supply your name and a valid email address you yourself

Fields marked*are required

Article URL   http://www.aimspress.com/MBE/article/3725.html
Article ID   mbe-16-05-221
Editorial Email  
Your Name *
Your Email *
Quantity *

Copyright © AIMS Press All Rights Reserved