Randomness Recoverable Secret Sharing Schemes

ePrint Report: Randomness Recoverable Secret Sharing Schemes

Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani

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 …

cryptography decrypt eprint report message party randomness recover recovery report secret sharing support well-known