An efficient threshold scheme is proposed in this paper. It overcomes the weakness of Asmuth et al.’s scheme. The (r, n)-threshold scheme proposed below only takes O(r) operations to recover the shared secret while Shamir’s scheme takes O(rlogr) operations. We show that our scheme is perfect. Further, we also propose a method to generate a pairwise relatively prime integer set which satisfies t...

Secret sharing schemes are widely used now a days in various applications, which need more security, trust and reliability. In secret sharing scheme, the secret is divided among the participants and only authorized set of participants can recover the secret by combining their shares. The authorized set of participants are called access structure of the scheme. In Multi-Secret Sharing Scheme (MS...

We construct forward-secure threshold signature schemes. These schemes have the following property: even if more than the threshold number of players are compromised, it is not possible to forge signatures relating to the past. This property is achieved while keeping the public key fixed and updating the secret keys at regular intervals. The schemes are reasonably efficient in that the amount o...

Multi-Level Secret Sharing Scheme for Mobile Ad-Hoc Networks P.V. Siva Kumar Department of Computer Science and Engineering, VNR VJIET, Hyderabad, India Email: [email protected] Dr. Rajasekhara Rao Kurra Sri Prakash College of Engineering, Tuni, India, email: [email protected]. in Appala Naidu Tentu and G.Padmavathi CRRao AIMSCS, University of Hyderabad Ca mp us , Hyderabad , I nd ia ...

Proactive Secret Sharing Scheme (PSSS) is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme without modifying the secret or reconstructing the secret to reproduce new shares. Given enough time, a hacker may be able to compromise enough shares (k or more) to gain the secret. PSSS is a scheme that allows generating new set of shares for the same secr...

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

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

In [3] Damgard and Thorbek proposed the linear integer secret sharing (LISS) scheme. In this note we show that the LISS scheme can be made proactive.

In this report we examine two secret sharing schemes which are based on different constructions. We present Cooper, Donovan and Seberry’s [6], Secret Sharing Scheme Arising from Latin Squares. Secondly we present Shoup’s threshold protocol based on the RSA digital signature algorithm. These two protocols will be compared in terms of their positive and negative aspects of their security.

Secret sharing schemes (SSS) are very important, because they are used in critical applications such as e-voting, cryptographic key distribution and sharing, secure online auctions, information hiding, and secure multiparty computation. We explained some popular algorithms of secret sharing such as threshold, graph, and visual schemes and their access structures. Besides, we discussed the limit...