Wireless Personal Communications

, Volume 63, Issue 2, pp 459–467 | Cite as

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

  • Ziba Eslami
  • Saideh Kabiri Rad


In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t − 1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if nt of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage, doi: 10.1007/s11277-009-9875-0]. In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme based on bilinear maps. Our scheme does not require a secure channel and participants can verify the shares pooled in the reconstruction phase. Our proposed scheme is multi-use such that in order to change the secrets, it is sufficient to renew some public information. Furthermore, the proposed scheme is flexible to the threshold value. Therefore, our proposed scheme has all the merits of (WTS), however, we achieve two major improvements. First when the secrets are to be changed, we require to publish fewer public values. This reduction can be very important in certain applications such as steganographic use of secret sharing schemes. The second is that (WTS) is designed with the assumption that the number of secrets (m) is equal to the threshold t so that the case m > t is handled by repeating the scheme \({\left\lceil \frac{m}{t}\right\rceil}\) times. However, in designing the scheme we do not assume any restrictions on the number of secrets.


Threshold scheme Verifiable scheme Multi-secret sharing Bilinear pairing Multi-use scheme 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Shamir A. (1979) How to share a secret. Communication of the ACM 22: 612–613MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Blakley G. (1979) Safeguarding cryptographic keys. AFIPS Conference Proceedings 48: 313–317Google Scholar
  3. 3.
    Zhao J., Zhang J., Zhao R. (2007) A practical verifiable multi-secret sharing scheme. Computer Standards Interface 29: 138–141CrossRefGoogle Scholar
  4. 4.
    He J., Dawson E. (1994) Multistage secret sharing based on one-way function. Electronics Letters 30(19): 1591–1592CrossRefGoogle Scholar
  5. 5.
    Jackson W. A., Martin K. M., O’keefe C. M. (1994) On sharing many secrets. Asiacrypt 94: 42–54Google Scholar
  6. 6.
    Chor, B., & Goldwasser, S. (1985). Verifiable secret sharing and achieving simultaneity in the presence of faults [a]. In Proceedings of 26th IEEE Symposium. FOCS, pp. 251–260.Google Scholar
  7. 7.
    Hwang R.-J., Chang C.-C. (1998) An on-line secret sharing scheme for multi secrets. Computer Communications 21(13): 1170–1176CrossRefGoogle Scholar
  8. 8.
    Shao J., Cao Z.-F. (2005) A new efficient (t,n) verifiable multi-secret sharing (vmss) based on ych scheme. Applied Mathematics and Computation 168: 135–140MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Chen, W., Long, X., Bai, Y. B., & Gao, X. P. (2007). A new dynamic threshold secret sharing scheme from bilinear maps. In International conference on parallel processing workshops, pp. 19–22.Google Scholar
  10. 10.
    Wang S. J., Tsai Y. R., Shen J. J. (2008) Verifiable threshold scheme in multi-secret sharing distributions upon extensions of ecc, Wireless Pers Commun. Springer, New York, pp 405–410. doi: 10.1007/s11277-009-9875-0 Google Scholar
  11. 11.
    Koblitz N. (1993) Introduction to elliptic curves and modular forms. Springer, New YorkzbMATHCrossRefGoogle Scholar
  12. 12.
    Washington L. C. (2003) Elliptic curves: Number theory and cryptography. CRC Press, Boca RatonzbMATHGoogle Scholar
  13. 13.
    Boneh D., Franklin M. (2001) Identity-based encryption from the weil pairing. Advances in Cryptology, Lecture Notes on Computer Science 2139: 213–229MathSciNetCrossRefGoogle Scholar
  14. 14.
    Galbraith S. D., Harrison K., Soldera D. (2002) Implementing the tate pairing. Algorithmic Number Theory Symposium ANTS-V, LNCS 2369: 324–337MathSciNetGoogle Scholar
  15. 15.
    Lee H.-S. (2004) Self-pairing map and its applications to cryptography. Applied Mathematics and Computation 151: 671–678MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Eslami Z., Razzaghi S., Ahmadabadi J. Z. (2010) Secret image sharing based on cellular automata and steganography. Pattern Recognition 43: 397–404zbMATHCrossRefGoogle Scholar
  17. 17.
    Lin C., Tsai W. (2004) Secret image sharing with steganography and authentication. The Journal of Systems and Software 73: 405–414CrossRefGoogle Scholar
  18. 18.
    Yang C., Chen T., Yu K., Wang C. (2007) Improvements of image sharing with steganography and authentication. The Journal of Systems and Software 80: 1070–1076CrossRefGoogle Scholar
  19. 19.
    Chang C., Hsieh Y., Lin C. (2008) Sharing secrets in stego images with authentication. Pattern Recognition 41: 3130–3137zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC. 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceShahid Beheshti University, G.C.TehranIran
  2. 2.School of MathematicsInstitute for Research in Fundamental Sciences (IPM)TehranIran

Personalised recommendations