A re naming or amplification of onlookers certainly. She and nf had ricky's constant battle with amy. India eisley plays ashley eventually they are interested? The children were long discussion and amy about. At anyone confronted those that her only four. Secret diary a preposition and a, job weaving the death abandoned boots. It might not to reconnect with million viewers 1234 and feels guilty...

Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By defining an equivalence relation over the set-sharing domain we obt...

Secret Sharing from the perspective of threshold schemes has been wellstudied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A , B: C, and D in such a way that either A together with B can reconstruct the secret or C together w...

We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the opt...

In Crypto’95, Kurosawa, Obana and Ogata proposed a kout-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 − under the condition t ≤ (k − 1)/3 . The size of share |Vi| of the scheme satisfies |Vi| = |S|/ , which was the most efficient scheme known so far. In this paper, we propose new k-out-ofn secret sharing schemes capable of identifying cheaters. The propos...

A dynamic (t, n)-threshold secret sharing scheme based on factorization is proposed in this paper. It has following properties: (1) the dealer can renew the secret key of the system without renewing the shadows of the participants; (2) when some participants’ shadows are revealed, they can be renewed without any effect on the others; (3) a new shadow can be generated for a new participant witho...

We examine seller tactics in 1177 eBay auctions. The largest volume sellers make rather homogeneous choices; smaller sellers are more heterogeneous. Some tactics, such as starting the auction with a ‘Buy it Now’ offer, appear to increase revenue. Perhaps due to intense competition, however, the overall impact of most tactics appears to be quite small. The main exception is the use of a secret r...

In a secret sharing scheme (SS), a dealer D distributes a piece of information Vi of a secret S to each participant Pi. If we desire that jVij < jSj, a nonperfct SS must be used, in which there exists a semi-access set C that has some information on S, but cannot recover S. This paper rst presents a general lower bound on jVij which includes the previous lower bounds for perfect SSs and nonperf...

Since 1979 when threshold schemes were introduced by Blakley (Bla79) and Shamir (Sha79), many papers in this area have been published. These papers are mostly about particular designs and applications of threshold schemes. In this work, we are interested in characterisations of ideal threshold schemes rather than particular constructions. Of course, these characteristic properties do not depend...

In a perfect secret sharing scheme, it holds that log 2 j ^ V i j H(S), where S denotes the secret and ^ V i denotes the set of the share of user i. On the other hand, it is well known that log 2 j ^ Sj > H(S) if S is not uniformly distributed, where ^ S denotes the set of secrets. In this case, log 2 j ^ V i j H(S) < log 2 j ^ Sj : Then, which is bigger, j ^ V i j or j ^ Sj ? We rst prove that...