Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC

Wang, Shiuh-Jeng; Tsai, Yuh-Ren; Shen, Chien-Chih

doi:10.1007/s11277-009-9875-0

Cited by 19 publications

(32 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we compare our method with the scheme of Wang et al [10] in two aspects: (1) the number of values published publicly and (2) the restrictions on m. we show that our scheme outperforms (WTS) in both of them.…”

Section: Comparisonmentioning

confidence: 94%

“…Our proposal is of multi-use type and is flexible to the threshold value. We compare our scheme to Wang et al's scheme [10] and show that our scheme needs fewer number of public values. In Sect.…”

Section: Introductionmentioning

confidence: 99%

“…Verifiability plays an important role in protocols such as secure multi-party computations [7,8]. Recently, elliptic curves and bilinear maps have been used in providing verifiability [9,10]. In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme based on elliptic curves and bilinear maps.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

Eslami

Rad

2010

Wireless Pers Commun

View full text Add to dashboard Cite

In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t − 1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if n − t of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage, doi:10.1007/s11277-009-9875-0]. In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme based on bilinear maps. Our scheme does not require a secure channel and participants can verify the shares pooled in the reconstruction phase. Our proposed scheme is multi-use such that in order to change the secrets, it is sufficient to renew some public information. Furthermore, the proposed scheme is flexible to the threshold value. Therefore, our proposed scheme has all the merits of (WTS), however, we achieve two major improvements. First when the secrets are to be changed, we require to publish fewer public values. This reduction can be very important in certain applications such as steganographic use of secret sharing schemes. The second is that (WTS) is designed with the assumption that the number of secrets (m) is equal to the threshold t so that the case m > t is handled by repeating the scheme m t times. However, in designing the scheme we do not assume any restrictions on the number of secrets.

show abstract

Section: Comparisonmentioning

confidence: 94%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

Eslami

Rad

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…[38] also extends from [21], pursuing the same goal as [89]. The difference is that secrets are divided into n + m − t shares to reduce the number of shares.…”

Section: Group 4: Data-verifiable Secret Sharing Schemesmentioning

confidence: 99%

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud technologies. Various approaches, i.e., data encryption, anonymization, replication and verification, help enforce different facets of data security. Secret sharing is a particularly interesting cryptographic technique. Its most advanced variants indeed simultaneously enforce data privacy, availability and integrity, while allowing computation on encrypted data. The aim of this paper is thus to wholly survey secret sharing schemes with respect to data security, data access and costs in the pay-as-yougo paradigm.

show abstract

“…To the best of our knowledge, all previous MSSSS are computationally secure. The security of MSSSS is based either on a one‐way function or on some cryptographic assumptions such as solving the discrete logarithm problem or a factoring large integer . An OSMSSS was proposed by Chien et al .…”

Section: Introductionmentioning

confidence: 99%

A cheater identifiable multi‐secret sharing scheme based on the Chinese remainder theorem

Chen

Zhu

et al. 2015

Security Comm Networks

View full text Add to dashboard Cite

There are many researches on the polynomial‐based verifiable (k,n) multi‐secret sharing scheme (VMSSS), but none of them focuses on the Chinese remainder theorem (CRT)‐based VMSSS so far. For the first time, we provide a cheater identifiable multi‐secret sharing scheme based on CRT as an alternative method for VMSSS, which is unconditionally secure when the number of cheaters t≤(k − 1)/3. We adopt an encoding method, which makes multiple secrets to be transferred as a single one. In addition, we utilize a single keyed message authenticated code (MAC) to detect and identify cheaters in the reconstruction phase. Then, combine these two methods with a CRT‐based Asmuth‐Bloom's SSS to achieve our design goals. In our scheme, all participants share a single key of MAC rather than each participant possesses an independent key to check the validity of shares, and the size of share is independent in any of n,k, and t. Analyses show that our scheme is more efficient and secure than existing ones. Finally, as an example of the practical impact of our work, we present how our techniques can be applied to secure sum computation. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC

Cited by 19 publications

References 9 publications

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

Secret sharing for cloud data security: a survey

A cheater identifiable multi‐secret sharing scheme based on the Chinese remainder theorem

Contact Info

Product

Resources

About