On perfect secret sharing schemes and coalitional game forms

  • Authors:

  • Stefano Vannucci

  • Affiliations:

  • Universita' di Siena

  • Venue:
  • TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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 0-normalized 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 1-threshold schemes as elementary 'building blocks'. JEL Classification Numbers 025,026