For a secret sharing scheme, two parameters dmin and dcheat are defined in [1] and [2]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [1-3]. The MDS secret-sharing scheme is defined in [2] and it is proved that MDS perfect secret sharin...

Secret sharing is a mechanism by which a trusted dealer holding a secret “splits” the secret into many “shares” and distributes the shares to a collections of parties. Associated with the sharing is a monotone access structure, that specifies which parties are “qualified” and which are not: any qualified subset of parties can (efficiently) reconstruct the secret, but no unqualified subset can l...

This paper considers when the utility function of the bidders is ambiguity averse, how does the bidding strategy differ in four classical auction mechanisms. In particular, if there is no information affiliation, i.e., when first order sealed auction is equivalent to English auction in terms of bidding, bidders may bid higher or lower relative to ambiguity neutral case. From the seller’s point ...

This paper inquires about the ability of double auction institutions to aggregate information in the context of a " common value " information structure that is known to produce the winner's curse in sealed bid environments. While many fundamental features of the economic environment are different from those studied in the context of sealed bids, the pattern of information distributed to the po...

A (t, n) secret sharing scheme [1, 2] allows a secret to be shared among n users in such a way that only t or more users can reconstruct the secret, but any t − 1 or less users have absolutely no information about the secret. One common drawback of almost all known secret sharing schemes is that they are one-time schemes. That is, once any t or more users reconstruct the secret by pooling their...