Secret sharing schemes for graph-based prohibited structures

檔案

本條目沒有附加檔案。

日期

1998-10-01

期刊名稱

COMPUTERS & MATHEMATICS WITH APPLICATIONS

摘要

A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain prespecified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect, if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key. The information rate of our scheme is 2/n, where n is the number of participants. (C) 1998 Elsevier Science Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料