International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation

Authors:
Oriol Farràs , Universitat Rovira i Virgili
Miquel Guiot , Universitat Rovira i Virgili
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: TCC 2024
Abstract: A secret sharing scheme is a cryptographic primitive that allows a dealer to share a secret among a set of parties, so that only authorized subsets of them can recover it. The access structure of the scheme is the family of authorized subsets. In a weighted threshold access structure, each party is assigned a weight according to its importance, and the authorized subsets are those in which the sum of their weights is at least the threshold value. For these access structures, the share size of the best known secret sharing schemes is either linear on the weights or quasipolynomial on the number of parties, which leads to long shares, in general. In certain settings, a way to circumvent this efficiency problem is to approximate the access structure by another one that admits more efficient schemes. This work is dedicated to the open problem posed by this strategy: Finding secret sharing schemes with a good tradeoff between the efficiency and the accuracy of the approximation. We present a method to approximate weighted threshold access structures by others that admit schemes with small shares. This method is based on the techniques for the approximation of the Chow parameters developed by De et al. [Journal of the ACM, 2014]. Our method provides secret sharing schemes with share size $n^{1+o(1)}$, where $n$ is the number of parties, and whose access structure is \emph{close} to the original one. Namely, in this approximation the condition of being authorized or not is preserved for almost all subsets of parties. In addition, applying the recent results on computational secret sharing schemes by Applebaum et al. [STOC, 2023] we show that there exist computational secret sharing schemes whose security is based on the RSA assumption and whose share size is polylogarithmic in the number of parties.
BibTeX
@inproceedings{tcc-2024-34778,
  title={Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation},
  publisher={Springer-Verlag},
  author={Oriol Farràs and Miquel Guiot},
  year=2024
}