@inproceedings{92375e029c94458fae24162583fa1409,
title = "Verifiable multi-secret sharing schemes for multiple threshold access structures",
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.",
author = "Christophe Tartary and Josef Pieprzyk and Huaxiong Wang",
year = "2008",
doi = "10.1007/978-3-540-79499-8_14",
language = "English",
isbn = "3540794980",
volume = "4990 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "167--181",
editor = "Dingyi Pei and Moti Yung and Chuankun Wu",
booktitle = "Information Security and Cryptology - Third SKLOIS Conference, Inscrypt 2007, Revised Selected Papers",
address = "United States",
note = "3rd SKLOIS Conference on Information Security and Cryptology, Inscrypt 2007 ; Conference date: 31-08-2007 Through 05-09-2007",
}