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

Hung Min Sun*, Shiuh-Pyng Shieh

*Corresponding author for this work

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)129-135
Number of pages7
JournalComputers and Mathematics with Applications
Volume31
Issue number7
DOIs
StatePublished - 1 Jan 1996

Keywords

  • Access structure
  • Cryptography
  • Data security
  • Secret sharing scheme

Fingerprint Dive into the research topics of 'An efficient construction of perfect secret sharing schemes for graph-based structures'. Together they form a unique fingerprint.

  • Cite this