Showing papers on "Verifiable secret sharing published in 1986"
11 Aug 1986
TL;DR: A homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets to be combined by direct computation on shares is described which reduces the need for trust among agents and allows secret sharing to be applied to many new problems.
Abstract: In 1979, Blackley and Shamir independently proposed schemes by which a secret can be divided into many shares which can be distributed to mutually suspicious agents. This paper describes a homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets to be combined by direct computation on shares. This property reduces the need for trust among agents and allows secret sharing to be applied to many new problems. One application described here gives a method of verifiable secret sharing which is much simpler and more efficient than previous schemes. A second application is described which gives a fault-tolerant method of holding verifiable secret-ballot elections.
168 citations
TL;DR: In this article, the authors considered games with lack of information on one side where the uncertainty of the uniformed player concerns the (verifiable) identity of his opponent and compared two solution concepts: the correlated equilibrium and the noisy channel equilibrium.
Abstract: Games with lack of information on one side are considered where the uncertainty of the uniformed player concerns the (verifiable) identity of his opponent. Two solution concepts are compared: the correlated equilibrium and the noisy channel equilibrium. The analysis shows in particular that correlated equilibria behave differently in the model with verifiable types and in the one with unverifiable types.
19 citations