A ( t , n ) Multi-secret Sharing Scheme with Updated Secret Shadows

In multi-secret sharing, a number of secrets are shared among a group of participants in a single-secret sharing process. Each participant gets only one share from the sharing process and secrecy of one secret does not depend on the reconstruction of any other secrets. YCH method is a well-known multi-secret sharing scheme proposed by Yang, Chang, and Hwang. This scheme has used two-variable one-way function. Among these two variables, one is made public and another is a randomly distributed secret shadow for each participant. In the current work, YCH method is extended where the “public variable” is shared and each participant gets one of them. The shadows are updated periodically to prevent any adversary from collecting all the secret shadows within a stipulated time period.

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

[2]  Ed Dawson,et al.  Multistage secret sharing based on one-way function , 1994 .

[3]  Alimohammad Latif,et al.  An adaptive secret image sharing with a new bitwise steganographic property , 2016, Inf. Sci..

[4]  Lein Harn,et al.  Verifiable secret sharing based on the Chinese remainder theorem , 2014, Secur. Commun. Networks.

[5]  Neeta Nain,et al.  An (n, n)-Multi Secret Image Sharing Scheme Using Boolean XOR and Modular Arithmetic , 2016, 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA).

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

[7]  Shyamalendu Kandar,et al.  A (k, n) Multi Secret Sharing Scheme Using Two Variable One Way Function with Less Public Values , 2015, ICISS.

[8]  V. Ch. Venkaiah,et al.  Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT , 2015 .

[9]  Maroti Deshmukh,et al.  Secure (n, n + 1)-Multi Secret Image Sharing Scheme Using Additive Modulo☆ , 2016 .

[10]  Zhihui Li,et al.  A new multi-use multi-secret sharing scheme based on the duals of minimal linear codes , 2015, Secur. Commun. Networks.

[11]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[12]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[13]  Chakravarthy Bhagvati,et al.  CRT Based Threshold Multi Secret Sharing Scheme , 2014, Int. J. Netw. Secur..

[14]  Yixian Yang,et al.  Publicly Verifiable Secret Sharing Scheme with Provable Security against Chosen Secret Attacks , 2013, Int. J. Distributed Sens. Networks.

[15]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

[16]  Rafail Ostrovsky,et al.  How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.

[17]  Massoud Hadian Dehkordi,et al.  Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem , 2015, Inf. Sci..

[18]  Min-Shiang Hwang,et al.  A (t, n) multi-secret sharing scheme , 2004, Appl. Math. Comput..

[19]  V. Ch. Venkaiah,et al.  Multi-Stage Secret Sharing Schemes Based on Asmuth’s Bloom Sequence , 2016 .

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

[21]  Li Bai.  A Reliable (k, n) Image Secret Sharing Scheme , 2006, 2006 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing.

[22]  Hung-Yu Chien,et al.  A Practical ( t , n ) Multi-Secret Sharing Scheme , 2000 .

[23]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[24]  Bibhas Chandra Dhara,et al.  An Image Secret Sharing Technique with Block Based Image Coding , 2015, 2015 Fifth International Conference on Communication Systems and Network Technologies.

[25]  Ja-Chen Lin,et al.  Secret image sharing , 2002, Comput. Graph..

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