Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations

In a (n, n)-secret image sharing scheme, a secret image is distributed among n parties in such a way that cooperation of all the shares is needed for reconstruction of the original secret image. Moreover, in these schemes, we have the security requirement which states that fewer than n shares should...

Full description

Saved in:
Bibliographic Details
Published in:Journal of information security and applications 2019-08, Vol.47, p.16-27
Main Authors: Kabirirad, Saeideh, Eslami, Ziba
Format: Article
Language:English
Subjects:
(n, n)-secret image sharing scheme
Boolean operations
Multi-secret image sharing
Security
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a (n, n)-secret image sharing scheme, a secret image is distributed among n parties in such a way that cooperation of all the shares is needed for reconstruction of the original secret image. Moreover, in these schemes, we have the security requirement which states that fewer than n shares should not reveal any information about the secret. Recently, three efficient (n, n)-multi-secret image sharing schemes based on Boolean operations are proposed. The goal of this paper is to prove that these schemes don’t satisfy the threshold security, i.e., with knowledge of (n−1) or fewer shares, considerable information about the secret image can be obtained using efficient computations. We further propose an improvement which successfully overcomes the reported security flaw. We show that the improved scheme generates pseudo-random shares and outperforms the recent secure Boolean-based schemes in computational cost.
ISSN:2214-2126
DOI:10.1016/j.jisa.2019.03.018