Paper 2021/1156

Evolving Secret Sharing in Almost Semi-honest Model

Jyotirmoy Pramanik and Avishek Adhikari

Abstract

Evolving secret sharing is a special kind of secret sharing where the number of shareholders is not known beforehand, i.e., at time t = 0. In classical secret sharing such a restriction was assumed inherently i.e., the the number of shareholders was given to the dealer’s algorithm as an input. Evolving secret sharing relaxes this condition. Pramanik and Adhikari left an open problem regarding malicious shareholders in the evolving setup, which we answer in this paper. We introduce a new cheating model, called the almost semi-honest model, where a shareholder who joins later can check the authenticity of share of previous ones. We use collision resistant hash function to construct such a secret sharing scheme with malicious node identification. Moreover, our scheme preserves the share size of Komargodski et al. (TCC 2016).

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision.ICSP 2021
DOI
10.1007/978-3-030-90553-8_9
Keywords
Secret SharingEvolvingMaliciousCollision resistance.
Contact author(s)
jyotirmoy pramanik2 @ gmail com
avishek adh @ gmail com
History
2021-11-25: revised
2021-09-14: received
See all versions
Short URL
https://ia.cr/2021/1156
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1156,
      author = {Jyotirmoy Pramanik and Avishek Adhikari},
      title = {Evolving Secret Sharing in Almost Semi-honest Model},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1156},
      year = {2021},
      doi = {10.1007/978-3-030-90553-8_9},
      note = {\url{https://eprint.iacr.org/2021/1156}},
      url = {https://eprint.iacr.org/2021/1156}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.