23 November 2020 in Security and Communication Networks
Shadow images generated from Shamir’s polynomial-based secret image sharing (SSIS) may leak the original secret image information, which causes a significant risk. The occurrence of this risk is closely related to the basis of secret image sharing, Shamir’s polynomial. Shamir’s polynomial plays an essential role in secret sharing, but there are relatively few studies on the power and order number of Shamir’s polynomial. In order to improve the security and effectiveness of SSIS, this paper mainly studies the utility of two parameters in Shamir’s polynomial, order number and power. Through the research of this kind of utility, the choice of order number and power can be given under different security requirements. In this process, an effective shadow image evaluation algorithm is proposed, which can measure the security of shadow images generated by SSIS. The user can understand the influence rule of the order number and power in SSIS, so that the user can choose the appropriate order number and power according to different security needs.
25 May 2022 in IET Information Security
Secret image sharing (SIS) is an important method to protect the security of secret images. When part of the shadows generated by the secret sharing is leaked or when the secret image is restored, the shadows and the secret need to be renewed. Aiming at secret image and shadow image renewal, a scheme for renewing secret image and shadow images is proposed. The scheme is to multiply the original and renewed shadow of the corresponding serial number to get a new shadow over finite fields. Our scheme can realise the renewal of the secret image and shadows and has characteristics of the variable threshold, secure public transmission, variable size, and lossless recovery. This paper theoretically analyses and proves the security of the proposed scheme and verifies the effectiveness through a large number of experiments.
2 July 2021 in Security and Communication Networks
In some particular situations, participants need to recover different secrets both within a group (i.e., intragroup) and between two groups (i.e., intergroup). However, most of the existing multilevel secret sharing (MLSS) and multigroup secret sharing (MGSS) schemes mainly focus on how to protect a secret between one or more groups. In this paper, we propose a polynomial-based scheme to share multiple secret images both within a group and between groups. The random elements’ utilization model of integer linear programming is used to find polynomial coefficients that meet certain conditions so that each participant holds only one shadow image and some of them can recover secrets of both intergroup and intragroup. In addition, our scheme based on polynomials has the advantage of low computational complexity. Theoretical analysis and experiments show that the proposed scheme is feasible and effective.