標題: An efficient construction of perfect secret sharing schemes for graph-based structures
作者: Sun, HM
Shieh, SP
資訊工程學系
Department of Computer Science
關鍵字: secret sharing scheme;data security;cryptography;access structure
公開日期: 1-四月-1996
摘要: 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.
URI: http://dx.doi.org/10.1016/0898-1221(96)00022-3
http://hdl.handle.net/11536/1372
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00022-3
期刊: COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume: 31
Issue: 7
起始頁: 129
結束頁: 135
顯示於類別:期刊論文


文件中的檔案:

  1. A1996TZ56500010.pdf