秘密共享中理想的存取结构及秘密共享实施方案的研究-信息安全专业毕业论文.docxVIP

IV IV Abstract With the widespread application and development of information security technology, secret sharing schemes have been widely applied for a variety of cryptography procotols, in which ideal secret sharing schemes have optimal efficiency. The structures realized by ideal secret sharing schemes are called ideal access structures. Not all access structures are ideal since there does not exist an ideal secret sharing scheme realizing it, namely, they are non-ideal access structures. Thus, the characterization of ideal access structures is a longstanding open problem in secret sharing, which has interesting connection to martoid theory since all access structures induced by representable matroids are ideal. By using the well known connection between ideal secret sharing and matroids, several researchers study the characterization of ideal access structures and further construct ideal secret sharing schemes for particular families of access structures. Due to the fact that every access structure and matroid are multipartite, by using the connection between multipartite matroids and discrete polymatroids, we study the bases and the rank functions of discrete polymatroids. As a result, we obtain multiple sufficient or necessary conditions for a multipartite matroid to be representable or non-representable, which imply multiple sufficient or necessary conditions for an access structure to be ideal. Subsequently, by applyng these conclusions for two particular families of access structures, we build an ideal threshold secret sharing protocol for member expansion and an ideal multi-secret sharing scheme based on connectivity of graphs respectively. Since the representability of a muliparite matroid can be completely characterized by the representability of the associated discrete polymatroid which is completely determined by its rank function, by dealing the rank functions of discrete polymatroids, we define D-reduction discrete polymatroids such that multiple d