A completely fair secret sharing scheme without dealer

In secret sharing schemes, there is always a special participant called the dealer who controls the distribution of the secret S. It is so powerful that once the dealer is depraved, the whole system is to be paralyzed. In order to solve this problem, it is necessary to cancel the privilege of the dealer and realize completely fair secret sharing. In this paper, we make use of the excellent additivity property of the polynomial and obtain a completely fair secret sharing scheme without the dealer. In this way, we can securely and fairly share a secret without the threat of oversized power.

[1]  Qi Cheng,et al.  An ideal multi-secret sharing scheme based on MSP , 2011, Inf. Sci..

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

[3]  Lein Harn,et al.  Strong (n, t, n) verifiable secret sharing scheme , 2010, Inf. Sci..

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

[5]  Zhihui Li,et al.  Remarks on- an ideal multi-secret sharing scheme based on MSP , 2012, IACR Cryptol. ePrint Arch..

[6]  Silvio Micali,et al.  How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Manuel Blum,et al.  How to exchange (secret) keys , 1983, TOCS.

[8]  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).

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

[10]  Manuel Blum How to Exchange (Secret) Keys (Extended Abstract) , 1983, STOC 1983.

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

[12]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.