Secret Sharing on Evolving Multi-level Access Structure

Sabyasachi Dutta, Partha Sarathi Roy, Kazuhide Fukushima, Shinsaku Kiyomoto, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


Secret sharing is a process that allows storing secret information in a distributed manner among several participants. In the original setting of secret sharing schemes, it was assumed that the total number of participants is fixed from the very beginning. However, to meet the state of the art needs, it is required to consider the scenario where any time a new participant can join and the total number of participants is (possibly) unbounded. Evolving secret sharing solves the problem. Secret sharing for evolving threshold access structure has been considered in the last few years. Here, we consider the Multi-level access structures. More specifically, we consider evolving compartmental and hierarchical access structures. We provide constructions with the estimation of share sizes.

Original languageEnglish
Title of host publicationInformation Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers
EditorsIlsun You
Number of pages12
ISBN (Print)9783030393021
Publication statusPublished - 2020
Event20th World Conference on Information Security Applications, WISA 2019 - Jeju Island, Korea, Republic of
Duration: Aug 21 2019Aug 24 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11897 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th World Conference on Information Security Applications, WISA 2019
Country/TerritoryKorea, Republic of
CityJeju Island

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Secret Sharing on Evolving Multi-level Access Structure'. Together they form a unique fingerprint.

Cite this