Skip to main content
SpringerLink
Log in
Book cover

International Conference on Security with Intelligent Computing and Big-data Services

SICBS 2018: Security with Intelligent Computing and Big-data Services pp 598–605Cite as

Efficient Computation Method of Participants’ Weights in Shamir’s Secret Sharing

  • Conference paper
  • First Online:

  • 1098 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 895))

Abstract

Shamir’s secret sharing is an important means to realize data protection. Since participants in a specific weighted secret sharing scheme have different weights, these weights need to be computed and allocated in advance. In [15], a weight calculation method is proposed based on Karnaugh map, but this method has certain application bottlenecks and the algorithm efficiency is not efficient enough. To solve the above problems, this paper proposes a novel weight calculation method based on ordered binary decision diagrams. The new method can calculate weights for any number of participants, and the algorithm has lower space-time complexity. Theoretical analysis shows that the proposed scheme is feasible and effective.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, pp. 313–317. AFIPS Press, Montvale (1979)

    Google Scholar 

  3. McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed solomon codes. Commun. ACM 24(8), 583–584 (1981)

    Article  MathSciNet  Google Scholar 

  4. Asmuth, A., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 30(2), 208–210 (1983)

    Article  MathSciNet  Google Scholar 

  5. Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret. In: Proceedings of CRYPTO 1986, pp. 412–417. Springer, Berlin (1986)

    Google Scholar 

  6. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings of the IEEE Global Telecommunications Conference, pp. 99–102. IEEE Press, Globecom (1987)

    Google Scholar 

  7. Hsu, C.F., Cheng, Q., Tang, X., Zeng, B.: An ideal multi-secret sharing scheme based on MSP. Inf. Sci. 181(7), 1403–1409 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Liu, Y., Zhang, F., Zhang, J.: Attacks to some verifiable multi-secret sharing schemes and two improved schemes. Inf. Sci. 329(1), 524–539 (2016)

    Article  MATH  Google Scholar 

  9. Lu, H.C., Fu, H.L.: New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures. Inf. Sci. 240(11), 83–94 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of 26 IEEE Symposium on Foundations of Computer Science, Portland, pp. 383–395. IEEE Press (1985)

    Google Scholar 

  11. He, J., Dawson, E.: Multistage secret sharing based on one-way function. Electron. Lett. 30(19), 1591–1592 (1994)

    Article  Google Scholar 

  12. Kumar, P.S., Ashok, M.S., Subramanian, R.: A publicly verifiable dynamic secret sharing protocol for secure and dependable data storage in cloud computing. Int. J. Cloud Appl. Comput. 2(3), 1–25 (2017)

    Google Scholar 

  13. Traverso, G,. Demirel, D., Buchmann, J.: Dynamic and verifiable hierarchical secret sharing. In: Proceedings on International Conference on Information Theoretic Security, pp. 24–43. Springer, Cham (2016)

    Google Scholar 

  14. Huang, W., Langberg, M., Kliewer, J., Bruck, J.: Communication efficient secret sharing. IEEE Trans. Inf. Theory 62(12), 7195–7206 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Harn, L., Hsu, C., Zhang, M., He, T., Zhang, M.: Realizing secret sharing with general access structure. Inf. Sci. 367–368, 209–220 (2016)

    Article  Google Scholar 

  16. Prasad, V.C.: Generalized Karnaugh map method for Boolean functions of many variables. IETE J. Educ. 58(1), 1–9 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Natural Science Foundation of China (U1711263, U1501252, 11603041), in part by the Key Research and Development Program of Guangxi (AC16380014, AA17202048, AA17202033), and in part by the Natural Science Foundation of Guangxi Province (2017GX NSFAA198283).

Author information

Authors and Affiliations

  1. Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, 541004, China

    Long Li, Tianlong Gu & Liang Chang

  2. School of Information and Communication, Guilin University of Electronic Technology, Guilin, 541004, China

    Jingjing Li

Authors
  1. Long Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tianlong Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jingjing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jingjing Li .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan

    Ching-Nung Yang

  2. Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan

    Sheng-Lung Peng

  3. University of Canberra, Canberra, ACT, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, L., Gu, T., Chang, L., Li, J. (2020). Efficient Computation Method of Participants’ Weights in Shamir’s Secret Sharing. In: Yang, CN., Peng, SL., Jain, L. (eds) Security with Intelligent Computing and Big-data Services. SICBS 2018. Advances in Intelligent Systems and Computing, vol 895. Springer, Cham. https://doi.org/10.1007/978-3-030-16946-6_48

Download citation

Publish with us

Policies and ethics

Search

Navigation