Secret sharing in multilevel and compartmented groups

Hossein Ghodosi, Josef Pieprzyk, Rei Safavi-Naini

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

60 Citations (Scopus)

Abstract

The paper proposes efficient solutions to two long standing open problems related to secret sharing schemes in multilevel (or hierarchical) and compartmented access structures. The secret sharing scheme in multilevel access structures uses a sequence of related Shamir threshold schemes with overlapping shares and the secret. The secret sharing scheme in compartmented access structures applies Shamir schemes first to recover partial secrets and second to combine them into the requested secret. Both schemes described in the paper are ideal and perfect.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publicationThird Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings
EditorsColin Boyd, Ed Dawson
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages367-378
Number of pages12
ISBN (Electronic)9783540691013
ISBN (Print)3540647325, 9783540647324
DOIs
Publication statusPublished - Jul 1998
Externally publishedYes
Event3rd Australasian Conference on Information Security and Privacy, ACISP - 1998 - Brisbane, Australia
Duration: 13 Jul 199815 Jul 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1438
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd Australasian Conference on Information Security and Privacy, ACISP - 1998
Country/TerritoryAustralia
CityBrisbane
Period13/07/9815/07/98

Keywords

  • Hierarchical and compartmented access structures
  • Ideal schemes
  • Perfect security
  • Secret sharing

Fingerprint

Dive into the research topics of 'Secret sharing in multilevel and compartmented groups'. Together they form a unique fingerprint.

Cite this