An efficient construction of perfect secret sharing schemes for graph-based structures

Hung Min Sun*, Shiuh-Pyng Shieh

*Corresponding author for this work

研究成果: Article

13 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based access structures where a vertex denotes a participant and an edge does a qualified pair of participants. The secret sharing scheme is based on the assumptions that the pairs of participants corresponding to edges in the graph can compute the master key but the pairs of participants corresponding to nonedges in the graph cannot. The information rate of our scheme is 1/(n - 1), where n is the number of participants. We also present an application of our scheme to the reduction of storage and computation loads on the communication granting server in a secure network.

原文English
頁(從 - 到)129-135
頁數7
期刊Computers and Mathematics with Applications
31
發行號7
DOIs
出版狀態Published - 1 一月 1996

指紋 深入研究「An efficient construction of perfect secret sharing schemes for graph-based structures」主題。共同形成了獨特的指紋。

引用此