In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will reduce the problem of secret recovery to the polynomial reconstruction problem which can be solved using a recent algorithm by Guruswami and Sudan. In addition to be dealer-free, our protocol does not increase the commun...

A commitment multiplication proof, CMP for short, allows a player who is committed to secrets s, s and s = s ·s, to prove, without revealing s, s or s, that indeed s = ss. CMP is an important building block for secure general multi-party computation as well as threshold cryptography. In the standard cryptographic model, a CMP is typically done interactively using zero-knowledge protocols. In th...

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

We give an abstraction of verifiable multi-secret sharing schemes that is accessible to a fully mechanized analysis. This abstraction is formalized within the applied pi-calculus by using an equational theory which characterizes the cryptographic semantics of secret share. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automa...

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

Securing ad hoc networks represents a challenging issue, related to their very characteristics of decentralized architecture, low-complexity, and multiple hops communications. Even if several methods are available, this paper presents a novel approach to allow secret sharing of information at lower levels of the node protocol stack. In fact, secret sharing schemes provide a natural way of addre...

Visual Cryptographic technique has become an important field of study in modern cryptography. Visual cryptography (VC) has quite a few applications and some of them are authentication and identification, steganography, and image encryption. As the era demands the need of security and Visual Secret Sharing to resist cheating scenario is a Visual Cryptographic technique. VSS is simple as it is ea...

With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introdu...

Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t + 1, n) threshold scheme which is perfect and ideal, and then extend it to schemes for any general access structure. The schemes can be further set up as proactive or verifiable if necessary. The setup a...