CRT Based Threshold Multi Secret Sharing Scheme

This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any smaller set will not be able to know what it is. Re-source requirements here are not very high as in other cryptography schemes and is suitable for resource constrained environment for establishing session key or any such random secrets which they can use for short time.

[1]  Shiuh-Jeng Wang,et al.  Dynamic Threshold Multi-secret Sharing Scheme Using Elliptic Curve and Bilinear Maps , 2008, 2008 Second International Conference on Future Generation Communication and Networking.

[2]  Runhua Shi,et al.  A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[3]  Ali Aydin Selçuk,et al.  Robust Threshold Schemes Based on the Chinese Remainder Theorem , 2008, AFRICACRYPT.

[4]  Liusheng Huang,et al.  A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP , 2007 .

[5]  Ali Aydin Selçuk,et al.  A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem , 2008, INDOCRYPT.

[6]  Jianfeng Ma,et al.  Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings , 2012, Int. J. Netw. Secur..

[7]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[8]  Chakravarthy Bhagvati,et al.  Multi-Secret Communication Scheme , 2012 .

[9]  Wei-Pang Yang,et al.  An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme , 2005, Appl. Math. Comput..

[10]  Runhua Shi,et al.  An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme , 2008, WKDD.

[11]  Wu Yan,et al.  Threshold Multi-Secret Sharing Scheme for Cheat-Proof among Weighted Participants , 2009, 2009 Second International Symposium on Electronic Commerce and Security.

[12]  Douglas R Stinson.  Cryptography : Theory and Practice -3/E. , 2014 .

[13]  Wei-Pang Yang,et al.  An Improved Multi-stage Secret Sharing Scheme Based on the Factorization Problem , 2011, Inf. Technol. Control..

[14]  Sorin Iftene,et al.  Secret Sharing Schemes with Applications in Security Protocols , 2006, Sci. Ann. Cuza Univ..

[15]  Chakravarthy Bhagvati,et al.  CRT based secured encryption scheme , 2012, 2012 1st International Conference on Recent Advances in Information Technology (RAIT).

[16]  Bart Preneel,et al.  On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem , 2002, Public Key Cryptography.

[17]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

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

[19]  C. Ding.  Chinese remainder theorem , 1996 .

[20]  Wei-Pang Yang,et al.  A new multi-stage secret sharing scheme using one-way function , 2005, OPSR.

[21]  Wang Zhifang,et al.  A non-interactive modular verifiable secret sharing scheme , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[22]  Xian-Mo Zhang,et al.  Ideal Secret Sharing Schemes from Permutations , 2006, Int. J. Netw. Secur..