Verifiable multi-secret sharing schemes for multiple threshold access structures


Autoria(s): Tartary, Christophe; Pieprzyk, Josef; Wang, Huaxiong
Data(s)

2008

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/70393/

Publicador

Springer Berlin Heidelberg

Relação

http://eprints.qut.edu.au/70393/2/Verifiable_Multi_Secret_Sharing_Schemes_INSCRYPT2007.pdf0.pdf

DOI:10.1007/978-3-540-79499-8_14

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.

Direitos

Copyright 2008 Springer-Verlag Berlin Heidelberg

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-79499-8_14

Fonte

School of Electrical Engineering & Computer Science; Science & Engineering Faculty

Palavras-Chave #Secret Sharing Scheme #Threshold Access Structures #Share Verifiability #Chinese Remainder Theorem #Keyed One-Way Functions
Tipo

Journal Article