Optimal Information Rates of Novel Graph Based Access Structures

摘要：

The optimal information rate of a graph (based access structure) is the best achievable information rate of any PSSS realizing it, which has been studied in a large number of articles during the last two decades. However the optimal information rates are only known for certain graphs. It is an open problem to determine the optimal information rates of other graphs. In this paper, we provide optimal information rates for a novel infinite family of graphs based on a nontrivial relationship between a graph and its subgraphs.

关键词： optimal information rate secret sharing graph based access structure

作者: Mingkun Yang

作者单位: State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing,China

会议类型: 国际会议

会议名称: The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

会议地点: 西安

会议语种:英文

页码: 701-704

在线出版日期: 2009-08-18（万方平台首次上网日期，不代表论文的发表时间）