Multipartite matroids and secret sharing

作     者：HSU ChingFang TANG XueMing CHENG Qi XIAO HaiJun 

作者机构：College of Computer Science & Technology Huazhong University of Science and Technology Wuhan 430074 China Institute of Wuhan Digital Engineering Wuhan 430074 China School of Mathematics & Physics China University ofGeosciences Wuhan 430074 China 

出 版 物：《Chinese Science Bulletin》 (Chin. Sci. Bull.)

年 卷 期：2010年第55卷第29期

页      面：3261-3266页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by the National Natural Science Foundation of China (60903196) 

主　　题：秘密共享方案 拟阵 访问结构 接入结构 最佳长度 充分条件 公开问题 参与者 

摘      要：In a secret-sharing scheme,a secret value is distributed among a set of participants by giving each participant a *** requirement is that only predefined subsets of participants can recover the secret from their *** family of the predefined authorized subsets is called the access *** access structure is ideal if there exists a secret-sharing scheme realizing it in which the shares have optimal length,that is,in which the shares are taken from the same domain as the *** and Davenport proved that ideal access structures are induced by ***,ideal access structures and access structures induced by matroids have received a lot of *** gave the first example of an access structure induced by a matroid namely the Vamos matroid,that is *** every matroid is multipartite and has the associated discrete polymatroid,in this paper,by dealing with the rank functions of discrete polymatroids,we obtain a sufficient condition for a multipartite access structure to be ***,we give a new proof that all access structures related to bipartite and tripartite matroids coincide with the ideal *** results give new contributions to the open problem,that is,which matroids induce ideal access structures.