The reconstruction probability is the probability that secret sharing schemes distributed on the nodes of a graph can be reconstructed. In this thesis a method to compute the reconstruction probability is presented. The reconstruction probabilities of secret sharing schemes in basic graph classes and two graphs based on real world networks are computed. Further more, algorithms to create distributed secret sharing schemes with a high reconstruction probability are analyzed.
