Department of Mathematics
Title : Secret sharing schemes 2 (elementary introduction)
| Speaker: Arkadii Slinko Affiliation: The University of Auckland Time: 4:00 pm Tuesday, 21 May, 2013 Location: Room 6115, Owen Glenn Building |
Abstract
| This is a continuation of my talk on 7 May 2013. This time I will first introduce two large classes of ideal access structures, namely, conjunctive and disjunctive hierarchical access structures. They are characterised by the fact that users are divided into classes so that users within each class are equivalent but users of different classes have different status with respect to the activity. For example, the UN Security Council with its permanent and non-permanent members represent a conjunctive hierarchical access structure (to the passage of a resolution). The main part of the talk will be focused on the connection between ideal secret sharing schemes and matroids. The theorem of Brickel and Davenport (1991) which describes this connection plays a central role in the theory of secret sharing. A short introduction to matroids will be given, no prior knowledge of matroids will be necessary. |
-
Programmes and Centres
- New Zealand Institute of Mathematics and its Applications (NZIMA)
- Community for Understanding and Learning in the Mathematical Sciences (CULMS)
- Centre for Mathematical Social Science (CMSS)
- Department of Computer Science
- Department of Engineering Science
- Department of Physics
- Department of Statistics
- Auckland Bioengineering Institute
