A secret sharing scheme is a method for distributing a secret among several parties in such a way that only qualified subsets of the parties can reconstruct it.

Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio. Author: Giovanni Di Crescenzo.

In this paper we study the problem of sharing many secrets, each having its own set of qualified subsets, in a more efficient way than the basic approach of ...

Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio · G. Di Crescenzo. Computer Science, Mathematics. SODA '00. 2000.

TL;DR: This paper shows the first instance for which an improvement is possible, and shows instances of multi-secret sharing schemes which achieve this ...

Sharing one secret vs. sharing many secrets:tight bounds on the average improvement ratio. ; Di Crescenzo, Giovanni ...

Aug 27, 2001 · Di Crescenzo, Sharing One Secret vs. Sharing Many Secrets: Tight Bounds on The Average Improvement Ratio, in Proceedings of SODA2000.

Although no improvement is possible for several instances of multi secret sharing, we present the first instance for which some improvement is possible, and, in ...

Sep 5, 2001 · A multi secret sharing scheme is the natural extension of a secret sharing scheme to the case in which many secrets need to be shared, each with ...

Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio · G. Di Crescenzo. Computer Science, Mathematics. ACM-SIAM Symposium ...