In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying collision-resistant one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. Moreover, high compl...

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 a multi-secret sharing scheme (MSSS), ` different secrets are distributed among the players in some set P = {P1, . . . , Pn}, each one according to an access structure. The trivial solution to this problem is to run ` independent instances of a standard secret sharing scheme, one for each secret. In this solution, the length of the secret share to be stored by each player grows linearly with...

Secret sharing scheme is a method to distribute secret information to a set P of participants so that only authorised subsets of P can reconstruct the secret. A set of subsets of P that can reconstruct the secret is called an access structure of the scheme. A simple undirected graph G is called a sum graph if there exists a labeling L of the vertices of G into distinct numbers, usually positive...

Multi secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure.The secrets can be reconstructed according to the access structure by participants using their private shares.Each participant has to hold a single share, additional information are made available in a public bulletin board.Th...

A t-out-of-n secret-sharing scheme allows an honest dealer D to distribute a secret s among n players, such that any subset of t players has no information about s, but every set of t + 1 players can collaboratively reconstruct the secret. The most famous secret-sharing scheme is Shamir’s Sharing Scheme [Sha79] (cf. Section 8.1.2). It uses polynomials to obtain the desired properties. Before pr...