Randomness recoverable secret sharing schemes (Q6617634)

The present article deals with the case study of particular models of sharing secrets as well as modal schemes treated from the informational-theoretical and computational perspectives. The main novelty brought by the authors refers to the demonstration of the conclusion that access structures can be treated with RR-SSS. Still, some models of simpler structures did not show an efficient implementation of the model. Also, a connection between RR-SSS and some unidirectional functions is highlighted, by demonstrating the possibility of constructing an RR-SSS scheme that is efficient in the case of descriptive access structures of unidirectional functions. Indeed, there are similar researches in this sense, with the authors' work having a clear way of separating the complexities associated with RR-SSS and SSS, by highlighting their parameterization in the two cases. From the model in which this comparative modality is exposed, the applicability of these models in real cryptographic requirements, where unidirectional functions are analyzed, is evident, which constitutes the essential contribution of this research. The obtained results are applicable in the implementation of informational security structures, but also in certain types of authentication.