Verifiable multi-secret sharing schemes for multiple threshold access structures

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant's share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tartary, C., Pieprzyk, J., & Wang, H. (2008). Verifiable multi-secret sharing schemes for multiple threshold access structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 167–181). https://doi.org/10.1007/978-3-540-79499-8_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free