DocumentCode
1824879
Title
Optimal Information Rates of Novel Graph Based Access Structures
Author
Yang, Mingkun
Author_Institution
State Key Lab. of Inf. Security, Grad. Univ. of Chinese Acad. of Sci., Beijing, China
Volume
2
fYear
2009
fDate
18-20 Aug. 2009
Firstpage
701
Lastpage
704
Abstract
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.
Keywords
authorisation; cryptography; graph theory; PSSS; graph based access structure; optimal information rate; perfect secrete sharing scheme; Cryptography; Entropy; Graph theory; Information rates; Information security; Laboratories; Particle measurements; Size measurement; Terminology; Tree graphs; graph based access structure; optimal information rate; secret sharing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Assurance and Security, 2009. IAS '09. Fifth International Conference on
Conference_Location
Xian
Print_ISBN
978-0-7695-3744-3
Type
conf
DOI
10.1109/IAS.2009.297
Filename
5284207
Link To Document