A Study in Bound of Graph and Generalized Access Structures

Please enable javascript in your browser.

Nasirzadeh, Sajjad | 2019

595 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 52143 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): khazaei, Shahram
Abstract:
Determining the value of optimal information ratio for a given access structure and finding the upper and lower bounds for the information ratio in secreet sharing is one of the main problems that has been studied over time. In this thesis, we have tried to introduce the tools used in this field, including polymatroids and Shannon’s inequalities, linear programming, decomposition and etc, examine the papers presented in this field and rewrite obtained results in a simpler way
Keywords:
Secret Sharing Scheme ; Access Structure ; Access Functions ; Information Ratio ; Ideal Access Structure