An extensible cheat-proofing multi-secret sharing scheme with low computation complexity

Secret sharing schemes are widely applied in various areas, and there are series of achievements, among which the verifiable multi-secret schemes are the most representative ones. A few verifiable multi-secret schemes own the following drawbacks: insensitive to the differences of security levels, lack of expandability, high computation complexity of verification process, and low efficiency of execution. Addressing the issues, an extensible cheat-proofing multi-secret sharing scheme with low computation complexity is proposed. With the security of RSA public key system and discrete logarithm puzzle, the proposed scheme can realize the following functions: first, the secret dealer can set relatively threshold values according to different security levels; second, the participants and secret combiner can verify the secret shares, which can guard against cheating problem, resist various kinds of attacks and improve the success rate of secret reconstruction; in addition, the secret shares are reusable in the situations of new group secret and new participant joining the group, which brings about good expandability. Moreover, compared with the previous schemes, the proposed scheme reduces the information content published by secret dealer and brings down the computation complexity of verification, which makes the efficiency of the scheme greatly improved. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  Hu Zheng-ming.  A Verifiable Multi-Policy Secret Sharing Scheme , 2010 .

[2]  Juan Qu,et al.  A practical dynamic multi-secret sharing scheme , 2010, 2010 IEEE International Conference on Information Theory and Information Security.

[3]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[4]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[6]  Ziba Eslami,et al.  A verifiable multi-secret sharing scheme based on cellular automata , 2010, Inf. Sci..

[7]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Hong Fan,et al.  A New Multi-secret Sharing Scheme with Multi-policy , 2007, The 9th International Conference on Advanced Communication Technology.

[9]  Avishek Adhikari,et al.  An efficient multi-use multi-secret sharing scheme based on hash function , 2010, Appl. Math. Lett..

[10]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[11]  Justie Su-tzu Juan,et al.  Efficient Multi-secret Sharing Scheme Using Room Square , 2009, 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement.

[12]  Runhua Shi,et al.  An Efficient Multi-secret Sharing Scheme with the Quasi-threshold Multipartite Access Structure , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

[13]  Ziba Eslami,et al.  A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps , 2012, Wirel. Pers. Commun..

[14]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[15]  Yuqing Zhang,et al.  Efficient (n, t, n) secret sharing schemes , 2012, J. Syst. Softw..

[16]  Y. Yeh,et al.  Dynamic Multi-Secret Sharing Scheme , 2008 .

[17]  Yun Wei,et al.  A Multi-Stage Secret Sharing Scheme with General Access Structures , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[18]  Pang Liaojun,et al.  An efficient and secure multi-secret sharing scheme with general access structures , 2006, Wuhan University Journal of Natural Sciences.

[19]  Adi Shamir,et al.  How to share a secret , 1979, CACM.