Verifiable secret sharing (VSS) is a fundamental cryptographic primitive, lying at the core of secure multi-party computation (MPC) and, as the distributed analogue of a commitment functionality, used in numerous applications. In this paper we focus on unconditionally secure VSS protocols with honest majority. In this setting it is typically assumed that parties are connected pairwise by authen...

In Shamir’s scheme that the security based on the numbers of the field of a prime number P which the coefficients' polynomial reduced to modulo P (takes a value from some field p Z , where P is a large prime number). Thus, the adversary must know only the free coefficient of the polynomial in order to break the scheme. Our scheme which based on representation integer using the so-called g a d i...

Running the key-management service of cryptographic systems in the cloud is an attractive cost saving proposition. Supporting key-recovery is an essential component of every key-management service. We observe that to verifiably support key-recovery in a public cloud, it is essential to use publicly verifiable secret-sharing (PVSS) schemes. In addition, a holistic approach to security must be ta...

It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa code) has been well-developed since the work of V.Goppa and Tsfasman, Vladut, and Zink( see [17], [18] a...

Title of dissertation: BROADCAST AND VERIFIABLE SECRET SHARING: NEW SECURITY MODELS AND ROUND-OPTIMAL CONSTRUCTIONS Ranjit Kumaresan, Doctor of Philosophy, 2012 Dissertation directed by: Professor Jonathan Katz Department of Computer Science Broadcast and verifiable secret sharing (VSS) are central building blocks for secure multi-party computation. These protocols are required to be resilient ...

A novel verifiable secret sharing method for Verifiable secret sharing (VSS) in halftone image based on linear block code with a parity check matrix is proposed. The proposed method, which not only verifies a secret image but also introduces multiple shadows for multiple users. The proposed method adopts forward error correction code (FEC) strategy based on property of linear block codes. There...

Verifiable Secret Sharing (VSS) is a fundamental tool of cryptography and distributed computing in Internet Things. Since network bandwidth scarce resource, minimizing the number verification data will improve performance VSS. Existing VSS schemes, however, face limitations meeting energy consumptions for low-end devices, which make their adoption challenging resource-limited IoTs. To address a...

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition, some secrets may require a higher security level than others involving t...