[1] |
SHAMIR A . How to share a secret[J]. Communications of the ACM, 1979,22(11): 612-613.
|
[2] |
BLAKLEY G R , . Safeguarding cryptographic keys[C]// The National Computer Conference 1979. 1979: 313-317.
|
[3] |
TOMPA M , WOLL H . How to share a secret with cheaters[J]. Journal of Cryptology, 1988,1(3): 133-138.
|
[4] |
TIAN Y L , MA J F , PENG C G ,et al. Fair (t,n) threshold secret sharing scheme[J]. IET Information Security, 2013,7(2): 106-112.
|
[5] |
HARN L . Comments on fair (t,n) threshold secret sharing scheme[J]. IET Information Security, 2014,8(6): 303-304.
|
[6] |
HARN L , LIN C L , LI Y . Fair secret reconstruction in (t,n) secret sharing[J]. Journal of Information Security and Applications, 2015,23: 1-7.
|
[7] |
RABIN T,BEN-OR M , . Verifiable secret sharing and multiparty protocols with honest majority[C]// ACM STOC 1989. 1989: 73-85.
|
[8] |
KUROSAWA K , OBANA S , OGATA W . T-cheater identifiable (k,n) threshold secret sharing schemes[C]// International Cryptology Conference on Advances in Cryptology. 1995.
|
[9] |
OBANA S , . Almost optimum t-cheater identifiable secret sharing schemes[C]// International Conference on Theory & Applications of Cryptographic Techniques:Advances in Cryptology. 2011.
|
[10] |
ROY P S , ADHIKARI A , XU R ,et al. An efficient robust secret sharing scheme with optimal cheater resiliency[M]// Security,Privacy,and Applied Cryptography Engineering. 2014.
|
[11] |
LIU Y X , YANG C N , WANG Y C ,et al. Cheating identifiable secret sharing scheme using symmetric bivariate polynomial[J]. Information Sciences, 2018:453.
|