Author: Martin Sečkár
Supervisor: Petr Švenda
Abstract: This thesis explores the configuration structures of threshold signature schemes, also known as the cryptographic policies. By utilizing the already existing knowledge and a survey of existing policies, the thesis aims to answer several questions. Notably, whether useful policies can be generated automatically, and what it means for a policy to be meaningful. We continue with the formal description of the problem using a recursive tree set definition. By developing a software pipeline, in combination with manual analysis, we obtain the potential answers to the posed questions. In particular, we are able to generate the valid policies en masse without any apparent bias, and we can obtain an insight into what a meaningful policy is. We also lay out the plans for further research into the area.