Verifiable multi-secret sharing schemes for multiple threshold access structures

Tartary, Christophe, Pieprzyk, Josef, & Wang, Huaxiong (2008) Verifiable multi-secret sharing schemes for multiple threshold access structures. Lecture Notes in Computer Science : Information Security and Cryptology, 4990, pp. 167-181.

View at publisher

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.

Impact and interest:

6 citations in Scopus
Search Google Scholar™
2 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

120 since deposited on 23 Apr 2014
19 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 70393
Item Type: Journal Article
Refereed: Yes
Additional Information: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers
Keywords: Secret Sharing Scheme, Threshold Access Structures, Share Verifiability, Chinese Remainder Theorem, Keyed One-Way Functions
DOI: 10.1007/978-3-540-79499-8_14
ISSN: 0302-9743
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2008 Springer-Verlag Berlin Heidelberg
Copyright Statement: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-79499-8_14
Deposited On: 23 Apr 2014 05:21
Last Modified: 27 Jul 2014 13:40

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page