Welcome to the resource topic for 2024/811
Title:
Traceable Secret Sharing Based on the Chinese Remainder Theorem
Authors: Charlotte Hoffmann
Abstract:Traceable threshold secret sharing schemes, introduced by Goyal, Song and Srinivasan (CRYPTO’21), allow to provably trace leaked shares to the parties that leaked them. The authors give the first definition and construction of traceable secret sharing schemes. However, the size of the shares in their construction are quadratic in the size of the secret. Boneh, Partap and Rotem (CRYPTO’24) recently proposed a new definition of traceable secret sharing and the first practical constructions. In their definition, one considers a reconstruction box R that contains f leaked shares and, on input t-f additional shares, outputs the secret s. A scheme is traceable if one can find out the leaked shares inside the box R by only getting black-box access to R. Boneh, Partap and Rotem give constructions from Shamir’s secret sharing and Blakely’s secret sharing. The constructions are efficient as the size of the secret shares is only twice the size of the secret.
In this work we present the first traceable secret sharing scheme based on the Chinese remainder theorem. This was stated as an open problem by Boneh, Partap and Rotem, as it gives rise to traceable secret sharing with weighted threshold access structures. The scheme is based on Mignotte’s secret sharing and increases the size of the shares of the standard Mignotte secret sharing scheme by a factor of 2.
ePrint: https://eprint.iacr.org/2024/811
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .