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

In this paper, we attempt to construct practical secret sharing schemes, which scheme has smaller share size and can detect cheating with high probability. We de ne two secure ramp schemes, secure ramp scheme and strongly secure ramp scheme. Then, we propose two constructions of secure ramp scheme. These schemes both have small share size and the cheating can be detected with high probability. ...

The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer to test whether a certain rate vector is achievable with vector linear network codes for a multisource network coding instance and whether there exists a mul...

In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n,t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide ...

E-voting systems (EVS)are having potential advantages over many existing voting schemes. Security, transparency, accuracy and reliability are the major concern in these systems. EVS continues to grow as the technology advances. It is inexpensive and efficient as the resources become reusable. Fast and accurate computation of results with voter privacy is the added advantage. In the proposed sys...

The Secret Sharing scheme assumes long-lived shares. However the protection provided for such long lived and sensitive shares may be insufficient. The security in a system that is exposed to attacks and break-ins might become exhausted. The goal of the pro-active security scheme is to prevent the adversary from learning the secret or from destroying it. The Shamir’s Secret Sharing is pioneer me...