Abstract
It is shown that Perfect Secret Sharing Schemes are Simple Weak Effectivity Functions. Namely, for any finite set K of keys and any finite set N of participants the set of all Perfect Secret Sharing Schemes having O-normaliaed security level #K - 1 is characterized as the set of all Simple Weak Effectivity Functions on (N,K): perfection in secret sharing turns out to have simplicity as its nice game-theoretic counterpart. It also follows that Perfect Secret Sharing Schemes do admit universal implementation procedures using l-threshold schemes as elementary 'building blocks'.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call