AC0 Constructions of Secret Sharing Schemes – Accommodating New Parties

Shion Samadder Chaudhury, Sabyasachi Dutta, Kouichi Sakurai

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

Abstract

The possibility of implementing secret sharing in the complexity class AC0 was shown in a recent work by Bogdanov et al. (Crypto’16) who provided constructions of ramp schemes. Cheng-Ishai-Li (TCC’17) forwarded the work by achieving robustness for such schemes. In this paper we construct secret sharing schemes which can include new parties over time keeping the entire construction implementable by AC0 circuits. We provide AC0 constructions of a dynamic secret sharing scheme and an evolving secret sharing scheme. The constructions are more flexible than similar existing schemes, use less resources and have several notable advantages.

Original languageEnglish
Title of host publicationNetwork and System Security - 14th International Conference, NSS 2020, Proceedings
EditorsMirosław Kutyłowski, Jun Zhang, Chao Chen
PublisherSpringer Science and Business Media Deutschland GmbH
Pages292-308
Number of pages17
ISBN (Print)9783030657444
DOIs
Publication statusPublished - 2020
Event14th International Conference on Network and System Security, NSS 2020 - Melbourne, Australia
Duration: Nov 25 2020Nov 27 2020

Publication series

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

Conference

Conference14th International Conference on Network and System Security, NSS 2020
CountryAustralia
CityMelbourne
Period11/25/2011/27/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'AC<sup>0</sup> Constructions of Secret Sharing Schemes – Accommodating New Parties'. Together they form a unique fingerprint.

Cite this