Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe ex...

FUNCTION AND SECRET SHARING EXTENSIONS FOR BLAKLEY AND ASMUTH-BLOOM SECRET SHARING SCHEMES İlker Nadi Bozkurt M.S. in Computer Engineering Supervisor: Assist. Prof. Dr. Ali Aydın Selçuk August, 2009 Threshold cryptography deals with situations where the authority to initiate or perform cryptographic operations is distributed amongst a group of individuals. Usually in these situations a secret s...

In this paper, a method is proposed to construct a visual secret sharing (VSS) scheme for multiple secret images in which each share can be rotated with 180 degrees in decryption. The proposed VSS scheme can encrypt more number of secret images compared with the normal VSS schemes. Furthermore, the proposed technique can be applied to the VSS scheme that allows to turn over some shares in decry...

Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these schemes the secret is composed of some field elements and the sharing is done by applying some fixed linear mapping on the field elements of the secret and some randomly chosen field elements. If the secret contains one field element, then the scheme is called linear. The importance of multi-linear schemes ...

An ideal secret sharing scheme is a method of sharing a secret key in some key space among a finite set of participants in such a way that only the authorized subsets of participants can reconstruct the secret key from their shares which are of the same length as that of the secret key. The set of all authorized subsets of participants is the access structure of the secret sharing scheme. In th...

After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed ...

Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.

Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares

In this paper, we will study the question of performing arbitrary updates in secret sharing schemes when shares of unaffected parties shall remain unchanged. We will introduce a zonal transformation matrix in the lifetime of secret sharing schemes to simplify constructions of multitime secret sharing schemes and propose management models that allow unlimited updates from arbitrary schemes witho...