A NOTE ON A THRESHOLD VERIFIABLE MULTI-SECRET SHARING SCHEME

Rong Hao, Jia Yu, and Zhiling Song

References

  1. [1] A. Shamir, How to share a secret, Communications of theACM, 22 (11), 1979, 612–613.
  2. [2] G.R. Blakley, Safeguarding cryptographic keys, Proc. AFIPS1979 National Computer Conference, New York, USA, 1979,313–317.
  3. [3] W.A. Jackson, K.M. Martin, and C.M.O. Keefe, On shar-ing many secrets, Proc. Cryptology-Asiacrypt’94, Wollongong,Australia, 1994, 42–54.
  4. [4] J. He and E. Dawson, Multistage secret sharing based on one-way function, Electronics Letters, 30 (19), 1994, 1591–1592.
  5. [5] J. He and E. Dawson, Multisecret-sharing scheme based onone-way function, Electronics Letters, 31 (2), 1995, 93–95.
  6. [6] H.Y. Chien, J.K. Jan, and Y.M. Tseng, A practical efficientmulti-secret sharing scheme, IEICE Transactions on Funda-mentals, E83-A (12 ), 2000, 2762–2765.
  7. [7] C.C. Yang, T.Y. Chang, and M.S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation,151 (2), 2004, 483–490.333
  8. [8] J. Shao and Z.F. Cao, A new efficient (t,n) verifiable multi-secretsharing (VMSS) based on YCH scheme, Applied Mathematicsand Computation, 168 (1), 2005, 135–140.
  9. [9] J. Zhao, J. Zhang, and R. Zhao, A practical verifiable multi-secret sharing scheme, Computer Standards and Interfaces,29 (1), 2007, 138–141.
  10. [10] M.H. Dehkordi and S. Mashhadi, An efficient threshold verifi-able multi-secret sharing, Computer Standards and Interfaces,30 (3), 2008, 187–190.
  11. [11] L.J. Pang and Y.M. Wang, A new (t, n) multi-secret sharingscheme based on Shamir’s secret sharing, Applied Mathematicsand Computation, 167 (2), 2005, 840–848.
  12. [12] T.P. Pedersen, Non-interactive and information-theoretic se-cure verifiable secret sharing, Proc. Cryptology-Crypto’91,Santa Barbara, USA, 1991, 129–140.

Important Links:

Go Back