A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...

In a (t, n) secret sharing scheme (SS), the secret is shared among n shareholders in such a way that (a) with t or more than t shares can recover the secret, and (b) with fewer than t shares cannot obtain the secret. The threshold signature scheme is an application that extends the SS to a digital signature scheme. In a threshold signature scheme, any t or more than t group members can represen...

In a threshold scheme, the sensitivity of the secret as well as the number of players may fluctuate due to various reasons, e.g., mutual trust may vary or the structure of the players’ organization might be changed. A possible solution to this problem is to modify the threshold and/or change the secret. Moreover, a common problem with almost all secret sharing schemes is that they are “one-time...

Security on digital medical image storage system has become a significant concern in today’s healthcare institution. Picture Archiving and Communication (PACS) which is one of current conventional storage systems for digital medical images, faced with several security issues. It fails to guarantee digital medical image survivability, confidentiality and integrity. Based on this issue this study...

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will reduce the problem of secret recovery to the polynomial reconstruction problem which can be solved using a recent algorithm by Guruswami and Sudan. In addition to be dealer-free, our protocol does not increase the commun...

A hierarchical threshold secret image sharing (HTSIS) scheme is a method to share a secret image among a set of participants with different levels of authority. Recently, Guo et al. (2012) [22] proposed a HTSIS scheme based on steganography and Birkhoff interpolation. However, their scheme does not provide the required secrecy needed for HTSIS schemes so that some non-authorized subsets of part...

We propose deceptive secret sharing, which is a novel approach to provide both confidentiality and deception in distributed storage systems. The motivation for this is to protect confidentiality as far as possible while acknowledging that no confidentiality scheme provides perfect protection. If confidentiality is breached and information is accessed by unauthorized individuals, our deceptive s...

(t, n) threshold secret sharing is a cryptographic mechanism to divide and disseminate information among n participants in a way that at least t(t ≤ n) of them should be present for the original data to be retrieved. This has practical applications in the protection of secure information against loss, destruction and theft. In this study, the authors propose a new multi-secret sharing scheme wh...

In modern cryptography, the secret sharing scheme is an important cryptographic primitive and it is used in various situations. In this paper, a timed-release secret sharing scheme (TR-SS) with information-theoretic security is first studied. TRSS is a secret sharing scheme with the property that participants more than a threshold number can reconstruct a secret by using their shares only when ...