• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A (k,t,n) Verifiable Multi-secret Sharing Scheme Based on Adversary Structure

Vol. 8, No.12, December 31, 2014
10.3837/tiis.2014.12.018, Download Paper (Free):

Abstract

A () ,, ntnsecret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong () ,, ktn verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn’t need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous () ,, ntnsecret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Jing Li, Licheng Wang, Jianhua Yan, Xinxin Niu and Yixian Yang, "A (k,t,n) Verifiable Multi-secret Sharing Scheme Based on Adversary Structure," KSII Transactions on Internet and Information Systems, vol. 8, no. 12, pp. 4552-4567, 2014. DOI: 10.3837/tiis.2014.12.018

[ACM Style]
Li, J., Wang, L., Yan, J., Niu, X., and Yang, Y. 2014. A (k,t,n) Verifiable Multi-secret Sharing Scheme Based on Adversary Structure. KSII Transactions on Internet and Information Systems, 8, 12, (2014), 4552-4567. DOI: 10.3837/tiis.2014.12.018