Abstract
Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.
Cite
CITATION STYLE
Ghodosi, H., Pieprzyk, J., Safavi-Naini, R., & Wang, H. (1998). On construction of cumulative secret sharing schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1438, pp. 379–390). Springer Verlag. https://doi.org/10.1007/bfb0053749
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
