Each member of a team consisting of n person has a secret. The k out of n simultaneous threshold secret sharing requires that any group of k members should be able to recover the secret of the other n−k members, while any group of k − 1 or less members should have no information on the secret of other team members. We show that when all secrets are independent and have size s then each team mem...

In a classical secret sharing scheme, some sensitive classical data is distributed among a number of people such that certain sufficiently large sets of people can access the data, but smaller sets can gain no information about the shared secret. For instance, a possible application is to share the key for a joint checking account shared by many people. No individual is able to withdraw money, ...

Secret Sharing techniques are now the building blocks of several security protocols. A (t, n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing schemes are modified and generalized to share multiple secrets.Use of elliptic curve and pairing in secret sharing is gaining more importance.In this paper we...

quantum secret sharing where a quantum participant Alice can share a secret key with two classical participants Bobs. After analyz.Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is. Quantum cryptography with secret sharing in a way that will.We show how a quantum secret sharing protocol, similar to that of Hillery, Buzek, and Berthiaume. A pr...

The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite...

This document provides the basic concept of Secret Sharing technique in practice. Main overview of some current secret sharing schemes are discussed according to the papers, provided during the course. Future scope and possibilities of secret sharing schemes are also introduced.

We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste’s method. However the contrast of its scheme is 1/(2n). In this paper, it is shown that for every integer n ≥ 4, there exists no construction of such a visual secret sharing s...

This paper takes up the question of secrecy and sovereignty in Derrida’s final seminar on The Beast and the Sovereign. Focusing primarily on Derrida’s readings of Lacan and Celan in Volume I, it argues that, for Derrida, we should distinguish between the lie (or what Lacan calls ‘trickery’ or ‘feigning feint’), and the secret (or what Celan calls ‘the secret of an encounter’), and understand th...