Abstract
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1,..., sm among a set of participants P. In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures. Finally, we prove the optimality of the bounds by providing protocols.
Cite
CITATION STYLE
Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. G., & Vaccaro, U. (1994). Multi-secret sharing schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 839 LNCS, pp. 150–163). Springer Verlag. https://doi.org/10.1007/3-540-48658-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
