A scheme for threshold multi-secret sharing

Chan, Chao-Wen; Chang, Chin‐Chen

doi:10.1016/j.amc.2004.04.081

Cited by 45 publications

(38 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, it does not seem reasonable to compare these two types of multi-secret sharing schemes. In addition, in [10] there is an increase in the share size as a consequence of applying the Chinese Reminder Theorem on different sub-shadows. Indeed, in this scheme, the share size is equal to the sum of the secret sizes.…”

Section: Comparative Resultsmentioning

confidence: 99%

“…Later, various MSS schemes were presented based on different methods such as coding approach [8], congruence relations and Chinese Reminder Theorem [10] and linear equations [9]. The computational complexity and number of public values are two important factors for comparing the efficiency of MSS schemes and a number of publications appeared to reduce the value of these parameters [11] and [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach

Fatemi

Eghlidos

Aref

2009

Information and Communications Security

View full text Add to dashboard Cite

Abstract.A multi-stage secret sharing (MSS) scheme is a method of sharing a number of secrets among a set of participants, such that any authorized subset of participants could recover one secret in every stage. The first MSS scheme was proposed by He and Dawson in 1994, based on Shamir's well-known secret sharing scheme and one-way functions. Several other schemes based on different methods have been proposed since then. In this paper, the authors propose an MSS scheme using AllOr-Nothing Transform (AONT) approach. An AONT is an invertible map with the property that having "almost all" bits of its output, one could not obtain any information about the input. This characteristic is employed in the proposed MSS scheme in order to reduce the total size of secret shadows, assigned to each participant. The resulted MSS scheme is computationally secure. Furthermore, it does not impose any constraint on the order of secret reconstructions. A comparison between the proposed MSS scheme and that of He and Dawson indicates that the new scheme provides more security features, while preserving the order of public values and the computational complexity.

show abstract

Section: Comparative Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach

Fatemi

Eghlidos

Aref

2009

Information and Communications Security

View full text Add to dashboard Cite

show abstract

“…A threshold secret sharing scheme has many practical applications, such as opening a bank vault, launching a nuclear, or authenticating an electronic funds transfer. Later, several multisecret sharing schemes were proposed [8][9][10][11][12]. In a multisecret sharing scheme, there are multiple secrets to be shared during one secret sharing process.…”

Section: Introductionmentioning

confidence: 99%

A Novel Verifiable Multisecret Sharing Scheme in Wireless Multimedia Sensor Networks

Guo

Luo

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

This paper presents a secure and practical verifiable multi-secret sharing scheme with application on multimedia sensor networks. By utilizing the merits of biometric cryptography, the proposed scheme can reliably conceal private information and overcome the shortcoming of the traditional cryptography. Security analysis shows that the proposed scheme provides secure, robust, and trustworthy verification of dealer and participants over insecure wireless multimedia sensor networks.

show abstract

“…One can imagine that any pair of officers can reconstruct the coordinates of the target and then initialize the process by mobilizing the appropriate equipment (plane, submarine, missile) but only subsets of 8 out of 10 generals can get access to the bomb activation code and launch the strike. Recently Chan and Chang designed such a construction [2] but it only allows a single secret to be shared per threshold value.…”

Section: Introductionmentioning

confidence: 99%

“…In this article, we propose a generalization of [2,19] by introducing a Verifiable Multi-Threshold Multi-secret Sharing Scheme (VMTMSS) where several secrets can be shared per threshold value. The security of our multiple time scheme is guaranteed as soon as keyed one-way functions and collision resistant one-way functions exist.…”

Section: Introductionmentioning

confidence: 99%

Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures

Tartary

Pieprzyk

Wang

Information Security and Cryptology

View full text Add to dashboard Cite

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.

show abstract

A scheme for threshold multi-secret sharing

Cited by 45 publications

References 4 publications

A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach

A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach

A Novel Verifiable Multisecret Sharing Scheme in Wireless Multimedia Sensor Networks

Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures

Contact Info

Product

Resources

About