Paper 2023/959
Randomness Recoverable Secret Sharing Schemes
Abstract
It is well-known that randomness is essential for secure cryptography. The randomness used in cryptographic primitives is not necessarily recoverable even by the party who can, e.g., decrypt or recover the underlying secret/message. Several cryptographic primitives that support randomness recovery have turned out useful in various applications. In this paper, we study randomness recoverable secret sharing schemes (RR-SSS), in both information-theoretic and computational settings and provide two results. First, we show that while every access structure admits a perfect RR-SSS, there are very simple access structures (e.g., in monotone
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. ITC 2023
- Keywords
- Secret sharingRandomness recovery
- Contact author(s)
-
mdhajiabadi @ uwaterloo ca
shahram khazaei @ sharif ir
vahdani behzad @ proton me - History
- 2024-08-26: revised
- 2023-06-19: received
- See all versions
- Short URL
- https://ia.cr/2023/959
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/959, author = {Mohammad Hajiabadi and Shahram Khazaei and Behzad Vahdani}, title = {Randomness Recoverable Secret Sharing Schemes}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/959}, year = {2023}, url = {https://eprint.iacr.org/2023/959} }