University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Weightedness and Structural Characterization of Hierarchical Simple Games

Weightedness and Structural Characterization of Hierarchical Simple Games

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Secret sharing schemes—first introduced by Shamir (1979) and now widely used in many cryptographic protocols—is a tool designed for securely storing information that is highly sensitive and highly important. The set of all authorised coalitions of a secret sharing scheme is known as the access structure. It can also be modeled by a simple game. In the theory of simple games seniority of players is usually modeled by assigning to players different weights. Shamir (1979) also suggested (independently from any literature on simple games) to model seniority of users in access structure by assigning weights to them. However this approach was not actively pursued. Instead, Simmons (1990) introduced the concept of a hierarchical access structures. In this talk we will compare these two different approaches to model seniority of players. Also we will characterize hierarchical access structures from game theoretical point of view.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity