A (k,t,n) verifiable multi-secret sharing scheme based on adversary structure = A (k,t,n) verifiable multi-secret sharing scheme based on adversary structure

다국어 초록 (Multilingual Abstract)

A (n,t,n) secret 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 (k,t,n) 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 (n,t,n) secret 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.

참고문헌 (Reference)

1 S. Agrawal, "Verifiable secret sharing in a total of three rounds" 112 : 856-859, 2012

2 A. Patra, "The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO" 5677 : 487-504, 2009

3 L. Harn, "Strong (n,t,n) verifiable secret sharing scheme" 180 : 3059-3064, 2010

4 A. Parakh, "Space efficient secret sharing for implicit data security" 181 : 335-341, 2011

5 Q. Li, "Sharing a quantum secret without a trusted party"

6 M. Ito, "Secret sharing scheme realizing general access structure" 99-102, 1987

7 J.C. Benaloh, "Secret sharing homomorphisms: keeping shares of a secret. CRYPTO" 263 : 251-260, 1986

8 N. Pakniat, "Secret image sharing scheme with hierarchical threshold access structure" 25 : 1093-1101, 2014

9 G. R. Blakley, "Safeguarding cryptographic keys" 313-317, 1979

10 Y.B. Guo, "Practical secret sharing scheme realizing generalized adversary structure" 19 : 564-569, 2004

11 M.H. Dehkordi, "New efficient and practical verifiable multi-secret sharing schemes" 178 : 2262-2274, 2008

12 L. Harn, "Multilevel threshold secret sharing based on the Chinese Remainder Theorem" 114 : 504-509, 2014

13 C. Padro, "Lower bounds on the information rate of secret sharing schemes with homogeneous access structure" 83 : 345-351, 2002

14 A. Shamir, "How to share a secret" 22 : 612-613, 1979

15 J.C. Benaloh, "Generalized Secret Sharing and Monotone Functions" 403 : 27-35, 1990

16 S. Iftene, "General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting" 186 : 67-84, 2007

17 Y.X. Liu, "Efficient (n,t,n) secret sharing schemes" 85 : 1325-1332, 2012

18 M.H. Dehkordi, "An efficient threshold verifiable multi-secret sharing" 30 : 187-190, 2008

19 R.H. Shi, "An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme" 580-583, 2008

20 T.P. Pedersen, "A threshold cryptosystem without a trusted party" 547 : 522-526, 1991

21 D.W. Zhao, "A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure" 64 : 611-615, 2012

22 H.W. Qin, "A secret sharing scheme based on (t,n) threshold and adversary structure" 8 : 379-385, 2009

23 H. Y. Chien, "A practical (t,n) multi-secret sharing scheme" 2762-2765, 2000

24 C. Guo, "A hierarchical threshold secret image sharing" 33 : 83-91, 2012

25 G.L. Wang, "A Threshold Undeniable Signature Scheme without a Trusted Party" 13 : 1757-1764, 2002

26 Ingemarsson, Simmons, "A Protocol to Set Up Shared Secret Schemes without the Assistance of a Mutually Trusted Party" 1990

27 C.C. Yang, "A (t,n) multi-secret sharing scheme" 151 : 483-490, 2004

28 T.Y. Lin, "(t, n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm module a composite problems" 146 : 264-268, 1999