Learn More
Many simple calculations can be done easier without computers than by using them. We show that the same holds for secure multiparty computations if the function to be computed is simple enough. Our starting point is an observation of Bert den Boer: a multiparty computation of a logical ANDgate can be performed by ve simple playing cards. We show that by(More)
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the(More)