Ideal Compartmented Secret Sharing Scheme Based on the Chinese Remainder Theorem for Polynomial Rings

Alexandru-Valentin Basaga; Sorin Iftene

Paper 2025/504

Ideal Compartmented Secret Sharing Scheme Based on the Chinese Remainder Theorem for Polynomial Rings

Alexandru-Valentin Basaga, Faculty of Computer Science, Alexandru Ioan Cuza University of Iasi, Romania

Sorin Iftene, Faculty of Computer Science, Alexandru Ioan Cuza University of Iasi, Romania

Abstract

A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups. In case of compartmented secret sharing, the set of users is partitioned into compartments and the secret can be recovered only if the number of participants from any compartment is greater than or equal to a fixed compartment threshold and the total number of participants is greater than or equal to a global threshold. In this paper we use the Chinese Remainder Theorem for Polynomial Rings in order to construct an ideal compartmented secret sharing scheme, inspired by the work from [20].

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: secret sharing compartmented access structure Chinese remainder theorem
Contact author(s): alexandru basaga @ info uaic ro
sorin iftene @ info uaic ro
History: 2025-03-19: approved; 2025-03-17: received; See all versions
Short URL: https://ia.cr/2025/504
License: CC BY

BibTeX

@misc{cryptoeprint:2025/504,
      author = {Alexandru-Valentin Basaga and Sorin Iftene},
      title = {Ideal Compartmented Secret Sharing Scheme Based on the Chinese Remainder Theorem for Polynomial Rings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/504},
      year = {2025},
      url = {https://eprint.iacr.org/2025/504}
}