Weightedness and Structural Characterization of Hierarchical Simple Games
- 👤 Speaker: Tatiana Gvozdeva, NTU Singapore
- 📅 Date & Time: Wednesday 02 May 2012, 14:00 - 15:00
- 📍 Venue: Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
Abstract
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.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Tatiana Gvozdeva, NTU Singapore
Wednesday 02 May 2012, 14:00-15:00