A(t,n)-multi secret image sharing scheme based on Boolean operations
| Autor: | Ziba Eslami, Saeideh Kabirirad |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Scheme (programming language)
Theoretical computer science Computer science Volume (computing) Image sharing 020206 networking & telecommunications 020207 software engineering 02 engineering and technology Mathematical proof Secret sharing Range (mathematics) Signal Processing 0202 electrical engineering electronic engineering information engineering Media Technology Computer Vision and Pattern Recognition Boolean operations in computer-aided design Electrical and Electronic Engineering computer computer.programming_language |
| Zdroj: | Journal of Visual Communication and Image Representation. 57:39-47 |
| ISSN: | 1047-3203 |
| Popis: | In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are shared among n users so that participation of at least t of them is needed to recover the shared images. Due to the high volume of images and computing complexity of secret sharing schemes, recent Boolean-based approaches are highly desirable. Unfortunately, to the best of our knowledge, existing literature on Boolean-based MSIS schemes only supports two cases: ( 2 , n ) and ( n , n ) . In ( n , n ) -schemes, we lose fault tolerancy such that in the absence of even one share, secret images can not be recovered. On the other hand, ( 2 , n ) -MSIS seems to be quite restrictive for the wide range of applications that might occur in practice. It is therefore a challenging problem to propose a Boolean-based ( t , n ) -MSIS for t ≠ 2 , n . The aim of this paper is to solve this problem. We further provide formal proofs of security as well as comparison with existing literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect