Perpetual Secret Sharing from Dynamic Data Structures

Shion Samadder Chaudhury, Sabyasachi Dutta, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

In this paper we propose a secret sharing scheme where the access structure changes over time following a dynamic data structure. The proposed scheme can accommodate an unbounded number of new parties and when the number of parties become very large, the scheme utilizes the dynamic data structure to search, add and delete parties which makes the scheme practical. Evolving Secret sharing was proposed in the literature to include unbounded number of parties into the scheme. We introduce a related idea called perpetual secret sharing which has the following advantages over the existing evolving schemes:-our construction reduces the memory usage of a dealer to a large extent and our scheme is implementable by constant-depth circuits (AC^{0}). Moreover, the construction is flexible and with some modifications, the construction can handle dynamic and evolving versions of several other multipartite access structures such as hierarchical access structures, compartmental access structures etc.

本文言語英語
ホスト出版物のタイトル2021 IEEE Conference on Dependable and Secure Computing, DSC 2021
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781728175348
DOI
出版ステータス出版済み - 1 30 2021
イベント2021 IEEE Conference on Dependable and Secure Computing, DSC 2021 - Aizuwakamatsu, Fukushima, 日本
継続期間: 1 30 20212 2 2021

出版物シリーズ

名前2021 IEEE Conference on Dependable and Secure Computing, DSC 2021

会議

会議2021 IEEE Conference on Dependable and Secure Computing, DSC 2021
Country日本
CityAizuwakamatsu, Fukushima
Period1/30/212/2/21

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems and Management
  • Safety, Risk, Reliability and Quality

フィンガープリント 「Perpetual Secret Sharing from Dynamic Data Structures」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル