Ramp secret image sharing
| Autor: | Lin Tao Liu, Yu Liang Lu, Xian Hua Song, Xuehu Yan, Long Long Li |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Scheme (programming language)
Modular arithmetic Computer science Applied Mathematics 05 social sciences Image sharing 02 engineering and technology General Medicine Secret sharing Image (mathematics) Computational Mathematics Modeling and Simulation 0502 economics and business 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Arithmetic General Agricultural and Biological Sciences Chinese remainder theorem computer 050203 business & management computer.programming_language |
| Zdroj: | Mathematical biosciences and engineering : MBE. 16(5) |
| ISSN: | 1551-0018 |
| Popis: | 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 (k1,k2,n) ramp SIS based on the Chinese remainder theorem (CRT). In the proposed scheme, on the one hand, when we collect any k1 or more and less than k2 shadows, the secret image will be disclosed in a progressive way. On the other hand, when we collect any k2 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|