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...

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 7.1.2). It uses polynomials to obtain the desired properties. Before pr...

Secure E-voting is a challenging protocol.Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature.But most of them need complicated homomorphic encryption which involves complicated encryption decryption process and key management which is not efficient.In this paper we propose a secure and efficient E-voting scheme based on secret sharin...

An efficient, computationally secure, verifiable (t, n) multi secret sharing scheme, based on YCH is proposed for multiple 3D models. The (t, n) scheme shares the 3D secrets among n participants, such that shares less than t cannot reveal the secret. The experimental results provide sufficient protection to 3D models. The feasibility and the security of the proposed system are demonstrated on v...

A simple secret sharing scheme for secure visual communications is presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shares” or “shadows”). In case of the (k, n) secret sharing scheme only a group of k qualified participants among n (where k ≤ n) can reconstruct the s...

We consider a distributed secret sharing system that consists of dealer, n storage nodes, and m users. Each user is given access to certain subset where it can download the stored data. The dealer wants securely convey specific s j j via for j=1,2, ..., m. More specifically, two secrecy conditio...